Related papers: Simplices for Numeral Systems
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We study polynomial Poisson algebras with some regularity conditions. Linear (Lie-Berezin-Kirillov) structures on dual spaces of semi-simple Lie algebras, quadratic Sklyanin elliptic algebras of \cite{FO1},\cite{FO2} as well as polynomial…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and…
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
In the last few years, the notion of symmetry has provided a powerful and essential lens to view several optimization or sampling problems that arise in areas such as theoretical computer science, statistics, machine learning, quantum…
In this article Ehrhart quasi-polynomials of simplices are employed to determine isospectral lens spaces in terms of a finite set of numbers. Using the natural lattice associated with a lens space the associated toric variety of a lens…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
We study lattice points on hyperbolic circles centred at Heegner points of class number one. Our main result is that, on a density one subset of radii tending to infinity, the angles of such points equidistribute on the unit circle. To…
We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…
We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
Motivated by connections to intersection homology of toric morphisms, the motivic monodromy conjecture, and a question of Stanley, we study the structure of triangulations of simplices whose local h-polynomial vanishes. As a first step, we…