In this paper, we prove a conjecture of Kottwitz and Rapoport on a union of (generalized) affine Deligne-Lusztig varieties $X(\mu, b)_J$ for a $p$-adic group $G$ and its parahoric subgroup $P_J$. We show that $X(\mu, b)_J \neq \emptyset$ if and only if the group-theoretic version of Mazur's inequality is satisfied. In the process, we obtain a generalization of Grothendieck's conjecture on the closure relation of $\s$-conjugacy classes of a twisted loop group.

In this paper, we consider the L p dual Minkowski problem by geometric variational method. Using anisotropic Gauss–Kronecker curvature flows, we establish the existence of smooth solutions of the L p dual Minkowski problem when pq ≥ 0 and the given data is even. If f ≡ 1, we show under some restrictions on p and q that the only even, smooth, uniformly convex solution is the unit ball.

No abstract uploaded!

The Hamiltonian cycle problem is an important problem in graph theory and computer science. It is a special case of the famous traveling salesman problem. A signicant amount of research has been done on the special cases of nding Hamiltonian cycles in subgraphs of triangular, square and hexagonal grids. However, there is little work on more complicated grids. In this paper, we investigate the hardness of Hamiltonian cycle problem in grid graphs of semiregular tessellations, which are tessellations formed by two or more kinds of regular polygons. There are only eight semiregular tessellations, and we prove that the Hamiltonian cycle problem in all of them are NP-complete by reducing from NP-complete problems, such as the Hamiltonian cycle problem in max degree 3 bipartite planar graphs. Knowing the NP-completeness of Hamiltonian cycle problem in semiregular grids indicates that there will not be any polynomial time algorithm that solves the Hamiltonian path problem in these tessellations if NP does not equal to P, which helps show the limits of ecient motion planning algorithms and provides new information about what makes problems computationally dicult to solve.

We call a finite set ${\mathcal{D}}\subset {\Bbb Z}^s$ a {\it (self-affine) tile digit set} with respect to an expanding integral matrix ${\bf A}$ if the self-affine set $T({\bf A}, \D)$ is a tile in ${\Bbb R}^s$. It has been a widely open problem to characterize the tile digit sets for a given ${\bf A}$. While there are substantial investigations on ${\Bbb R}$, there is no result on ${\Bbb R}^s$ other than the case where $|\det {\bf A}| =p$ with $p$ a prime. In this paper, we make an initiation to study a basic case ${\bf A} = p{\bf I}_2$ in ${\Bbb R}^2$. We characterize the tile digit sets by making use of the zeros of the mask polynomial of ${\mathcal{D}}$ associated with a tile criterion of Kenyon [K], together with a recent result of Iosevich {\it et al} on factorization of sets in ${\Bbb Z}_p \times {\Bbb Z}_p$ [IMP].