Related papers: Luck and magic for Pitman-Stanley polytopes and pa…

We introduce the notion of P-critical connections for hermitian holomorphic vector bundles over compact balanced manifolds: integrable hermitian connections whose curvature solves a polynomial equation. Such connections include HYM and dHYM…

A parking function on $[n]$ creates a permutation in $S_n$ via the order in which the $n$ cars appear in the $n$ parking spaces. Placing the uniform probability measure on the set of parking functions on $[n]$ induces a probability measure…

We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has…

We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

We complete the visible, hidden, sectorial, and discrete symmetries of Ernst-like potential spaces in stationary, axisymmetric Einstein-Maxwell-Scalar Field (EMSF) and Einstein-ModMax-Scalar Field (EMMSF) theories. In the real potential…

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A…

Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

We construct multiplicative renormalization for the Epstein--Glaser renormalization scheme in perturbative Algebraic Quantum Field Theory: To this end, we fully combine the Connes--Kreimer renormalization framework with the Epstein--Glaser…

One considers weighted sums over points of lattice polytopes, where the weight of a point v is the monomial q^f(v) for some linear form f. One proposes a q-analogue of the classical theory of Ehrhart series and Ehrhart polynomials,…

We prove that all lattice path matroids are Ehrhart positive. This unifies and generalizes numerous results on the Ehrhart positivity of matroids developed over the last two decades. We rely on our previous work on the positivity of order…

We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…

We give new proofs of three theorems of Stanley on generating functions for the integer points in rational cones. The first, Stanley's reciprocity theorem, relates the rational generating functions for the integer points in a cone K and for…

This paper is to study the Ehrhart function $L(P,t)$ of a rational $n$-polytope $P$, defined as the number of lattice points of dilated polytopes $tP$ with real numbers $t\geq 0$. It turns out that $L(P,t)$ is a quasi-polynomial of real…

The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…