Related papers: Lattice point enumeration of polytopes associated …
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
Let H_T=C[T,T^{-1}] be the Hopf algebra of symmetries of a lattice of rank 1, or equivalently, H_T is the group algebra of a free Abelian group with one generator T. We construct conformal algebras, vertex Poisson algebras and vertex…
We prove tight lower bounds for the coefficients of the generalized $h$-vector of a rational polytope with a symmetry of prime order that is fixed--point--free on the boundary. These bounds generalize results of R.~Stanley and R.~Adin for…
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…
In a non-perturbative gauge-invariant formulation of grand-unified theories all low energy vector states need to be composite with respect to the high-scale gauge group, including the photon. We investigate this by using lattice methods to…
Let $\Sigma_{g,n}$ be a compact oriented surface of genus $g$ with $n$ open disks removed. The algebra $\mathcal{L}_{g,n}(H)$ was introduced by Alekseev-Grosse-Schomerus and Buffenoir-Roche and is a combinatorial quantization of the moduli…
Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma(G,x) = \sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such…
We characterize the Archimedean vector lattices that admit a positively homogeneous continuous function calculus by showing that the following two conditions are equivalent for each $n$-tuple $\boldsymbol{x} = (x_1,\ldots,x_n)\in X^n$,…
Let $G$ be a simple graph on $n$ vertices and $I(G)\subseteq R$ be its edge ideal. In this paper, we initiate the study of determining lattice points in $\mathbb{N}^2$ that appear as a pair $(\mathrm{reg}(R/I(G)), \mathrm{v}(I(G)))$, where…
We show that there are $f$-vectors of balanced simplicial complexes giving a source of simplicial complexes exhibiting a Boolean decomposition similar to a geometric Lefschetz decomposition. The objects we are working with are $h$-vectors…
We consider 3 (weighted) posets associated with a graph G - the poset P(G) of distinct induced unlabelled subgraphs, the lattice Omega(G) of distinct unlabelled graphs induced by connected partitions, and the poset Q(G) of distinct…
We study a class of nonlinear PDEs that admit the same bi-Hamiltonian structure as WDVV equations: a Ferapontov-type first-order Hamiltonian operator and a homogeneous third-order Hamiltonian operator in a canonical Doyle--Potemin form,…
Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…
In 1999, Pitman and Stanley introduced the polytope bearing their name along with a study of its faces, lattice points, and volume. The Pitman-Stanley polytope is well-studied due to its connections to probability, parking functions, the…
One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…
We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of…
For a positive integer $d$, the $d$-dimensional Chebyshev-Frolov lattice is the $\mathbb{Z}$-lattice in $\mathbb{R}^d$ generated by the Vandermonde matrix associated to the roots of the $d$-dimensional Chebyshev polynomial. It is important…
An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…
In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of…
We prove the existence of critical points of vortex type Hamiltonians \[ H(p_1,\ldots, p_N) = \sum_{{i,j=1},{i\ne j}}^N \Gamma_i\Gamma_jG(p_i,p_j)+\psi(p_1,\dots,p_N) \] on a closed Riemannian surface $(\Sigma,g)$ which is not homeomorphic…