Related papers: Counting d-polytopes with d+3 vertices
Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…
In the past few years we have derived asymptotic expansions for lambda_d of the dimer problem and lambda_d(p) of the monomer-dimer problem. The many expansions so far computed are collected herein. We shine a light on results in two…
Stationary 1D Schr\"odinger equations with polynomial potentials are reduced to explicit countable closed systems of exact quantization conditions, which are selfconsistent constraints upon the zeros of zeta-regularized spectral…
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…
New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…