Related papers: The Finiteness Threshold Width of Lattice Polytope…

We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…

The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the…

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

We demonstrate that the standard O(n) symmetric $\phi^{4}$ field theory does not correctly describe the leading finite-size effects near the critical point of spin systems on a $d$-dimensional lattice with $d > 4$. We show that these…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general…

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

Let $\Omega$ be a bounded closed convex set in ${\mathbb R}^d$ with non-empty interior, and let ${\cal C}_r(\Omega)$ be the class of convex functions on $\Omega$ with $L^r$-norm bounded by $1$. We obtain sharp estimates of the…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

Let $P\subset\R^d$ be a $d$-dimensional polytope. The {\em realization space} of~$P$ is the space of all polytopes $P'\subset\R^d$ that are combinatorially equivalent to~$P$, modulo affine transformations. We report on work by the first…

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

We provide a sharp estimate for the asymptotic number of lattice zonotopes, inscribed in $[0,n ]^d$ when $n$ tends to infinity. Our estimate refines the logarithmic equivalent established by Barany, Bureaux, and Lund when the sum of the…

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…

We discuss the validity of the Weyl asymptotics -- in the sense of two-sided bounds -- for the size of the discrete spectrum of (discrete) Schr\"odinger operators on the $d$--dimensional, $d\geq 1$, cubic lattice $\mathbb{Z}^{d}$ at large…