相关论文: Inside-Out Polytopes

A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…

First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…

We consider geometric hypergraphs whose vertex set is a finite set of points (e.g., in the plane), and whose hyperedges are the intersections of this set with a family of geometric regions (e.g., axis-parallel rectangles). A typical…

In any vertex coloring of a graph some edges have differently colored ends (\emph{good} edges) and some are monochromatic (\emph{bad} edges). In a proper coloring all edges are good. In a \emph{majority coloring} it is enough that for every…

The \emph{coloring number} $\mathrm{col}(G)$ of a graph $G$, which is equal to the \emph{degeneracy} of $G$ plus one, provides a very useful measure for the uniform sparsity of $G$. The coloring number is generalized by three series of…

In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…

Ehrhart theory measures a polytope P discretely by counting the lattice points inside its dilates P, 2P, 3P, .... We compute the Ehrhart quasipolynomials of the standard Coxeter permutahedra for the classical Coxeter groups, expressing them…

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…

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…

We provide a "soft" proof for non-trivial bounds on spherical, hyperbolic and unipotent Fourier coefficients of a fixed Maass form for a general co-finite lattice $\Gamma$ in $PGL(2,R)$. We use the amplification method based on the Airy…

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…

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…

We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…