Related papers: Plethysm and lattice point counting

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…

We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the…

For $k\geqslant 1$, denote by $p_k(n)$ the number of partitions of an integer $n$ into $k$-th powers. In this note, we apply the saddle-point method to provide a new proof for the well-known asymptotic expansion of $p_k(n)$. This approach…

Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

We derive a formula for the number of lattice points in type B generalized permutohedra, providing a concise alternative to the formula obtained recently by Eur, Fink, Larson, and Spink as a result from a study of delta-matroids. Our…

We discuss the problem to count, or, more modestly, to estimate the number f(m,n) of unimodular triangulations of the planar grid of size $m\times n$. Among other tools, we employ recursions that allow one to compute the (huge) number of…

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…

We provide a complete description of the asymptotics of the gradient flow on the space of metrics on any semistable quiver representation. This involves a recursive construction of approximate solutions and the appearance of iterated…

In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…

We obtain a growth estimate for the number of lattice points inside any Q-Gorenstein cone. Our proof uses the result of Futaki-Ono-Wang on Sasaki-Einstein metric for the toric Sasakian manifold associated to the cone, a Yau's inequality,…

Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…

Let $G$ be a compact semisimple Lie group and $T$ be a maximal torus of $G$. We describe a method for weight multiplicity computation in unitary irreducible representations of $G$, based on the theory of Berezin quantization on $G/T$. Let…

Symplectic gauge theories coupled to matter fields lead to symmetry enhancement phenomena that have potential applications in such diverse contexts as composite Higgs, top partial compositeness, strongly interacting dark matter, and…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…

We derive a path counting formula for two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves a problem of finding an explicit…