Related papers: The second Voronoi conjecture on parallelohedra fo…
We describe limits of line bundles on nodal curves in terms of toric arrangements associated to Voronoi tilings of Euclidean spaces. These tilings encode information on the relationship between the possibly infinitely many limits, and…
We prove a conjecture of Toponogov on complete convex planes, namely that such planes must contain an umbilic point, albeit at infinity. Our proof is indirect. It uses Fredholm regularity of an associated Riemann-Hilbert boundary value…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
In this paper, we establish a second main theorem for holomorphic curve intersecting hypersurfaces in general position in projective space with level of truncation. As an application, we reduce the number hypersurfaces in uniqueness problem…
A geometric construction of Getzler's cohomological relation in the moduli space of 4 pointed elliptic curves is given by a push-forward of a natural rational equivalence in a space of admissible covers. In particular, Getzler's relation is…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
It is shown that, given any (n-1)-dimensional lattice L, there is a vector v in Z^n such that the projection of Z^n onto v^perp is arbitrarily close to L. The problem arises in attempting to find the largest cylinder anchored at two points…
We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…
We show that Vojta's conjecture for some rational surfaces is related to the $abc$ conjecture. More specifically, we prove that Vojta's conjecture on these surfaces implies a special case of the $abc$ conjecture, while the $abc$ conjecture…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
Here are two problems. First, understand the dynamics of a tiling billiard in a cyclic quadrilateral periodic tiling. Second, describe the topology of connected components of plane sections of a centrally symmetric subsurface $S \subset…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
We introduce a notion of equivalence on tilings which is formulated in terms of their local structure. We compare it with the known concept of locally deriving one tiling from another and show that two tilings of finite type are…
Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…
We establish several new inequalities linking classical exponents of Diophantine approximation associated to a real vector $\underline{\xi}=(\xi,\xi^{2},\ldots,\xi^{N})$, in various dimensions $N$. We thereby obtain variants, and partly…
Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…
A classical Theorem of Alexandrov states that the map associating its boundary to a convex polyhdedron of the 3-dimensional Euclidean space is a bijection from the set of convex polyhdedron up to congruence to the set of isometry classes of…
Motivated by recent new Monte Carlo data we investigate a heuristic asymptotic theory that applies to n-faced 3D Poisson-Voronoi cells in the limit of large n. We show how this theory may be extended to n-edged cell faces. It predicts the…