Related papers: Lattice point enumeration of polytopes associated …

We propose a combinatorial approach to the following strengthening of Gal's conjecture: $\gamma(\Delta)\ge \gamma(E)$ coefficientwise, where $\Delta$ is a flag homology sphere and $E\subseteq \Delta$ an induced homology sphere of…

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

We investigate the standard context, denoted by $\mathbb{K}\left(\mathcal{L}_{n}\right)$, of the lattice $\mathcal{L}_{n}$ of partitions of a positive integer $n$ under the dominance order. Motivated by the discrete dynamical model to study…

In this article, we generalize a theorem of Victor L. Shapiro concerning nontangential convergence of the Poisson integral of a $L^p$-function. We introduce the notion of $\sigma$-points of a locally finite measure and consider a wide class…

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

We present a unified method of construction of surfaces associated with Grassmannian sigma models, expressed in terms of an orthogonal projector. This description leads to compact formulae for structural equations of two-dimensional…

We prove a multiplication theorem of a quantum Caldero-Chapoton map associated to valued quivers which extends the results in \cite{DX}\cite{D}. As an application, when $Q$ is a valued quiver of finite type or rank 2, we obtain that the…

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

From the paper of the first author it follows that upper and lower bounds for $\gamma$-vector of a simple polytope imply the bounds for its $g$-,$h$- and $f$-vectors. In the paper of the second author it was obtained unimprovable upper and…

The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…

We compute the asymptotics of the number of integral quadratic forms with prescribed orthogonal decompositions and, more generally, the asymptotics of the number of lattice points lying in sectors of affine symmetric spaces. A new key…

Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

We describe a genetic algorithm to find candidates for $h^*$-vectors satisfying given properties in the space of integers vectors of finite length. We use an implementation of such algorithm to find a 52-dimensional lattice polytope having…

The Q1 lattice equation, a member in the Adler-Bobenko-Suris list of 3D consistent lattices, is investigated. By using the multidimensional consistency, a novel Lax pair for Q1 equation is given, which can be nonlinearised to produce…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

We introduce the notion of an $L_{\infty}$-bialgebra structure on a vector space. We show that the rational homotopy groups $\pi_{*}(\Omega \Sigma Y)\otimes \mathbb{Q}$ admit such a structure for the loop space $\Omega \Sigma Y$ of a…