Related papers: A New Algorithm in Geometry of Numbers
We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…
We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…
We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
Finding the exact spanning ratio of a Delaunay graph has been one of the longstanding open problems in Computational Geometry. Currently there are only four convex shapes for which the exact spanning ratio of their Delaunay graph is known:…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
In 1960, G. Gr\"atzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional…
The paper is devoted to perfect and almost perfect homogeneous polytopes in Euclidean spaces. We classified perfect and almost perfect polytopes among all regular polytopes and all semiregular polytopes excepting Archimedean solids and two…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. Based on this condition, we characterize the problem…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…