Related papers: Plethysm and lattice point counting
We derive asymptotic formulas for the number of integer partitions with given sums of $j$th powers of the parts for $j$ belonging to a finite, non-empty set $J \subset \mathbb N$. The method we use is based on the `principle of maximum…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
This paper contains two main results. First, we provide combinatorial branching rules for $\text{GL}_n \downarrow \text{O}_n$ and $\text{GL}_{2n} \downarrow \text{Sp}_{2n}$ extending the Littlewood restriction rules. Second, we use these…
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 n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…
We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in terms of the cost vector and the determinant of the lattice.
We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations:…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
We calculate numerically the density of states n(S) for SU(2) lattice gauge theory on $L^4$ lattices. Small volume dependence are resolved for small values of S. We compare $ln(n(S))$ with weak and strong coupling expansions. Intermediate…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
A class of Hamiltonian stochastic differential equations with multiplicative L\'{e}vy noise in the sense of Marcus, and the construction and numerical implementation methods of symplectic Euler scheme, are considered. A general symplectic…
We describe a stochastic technique which allows one to compute numerically the coefficients of the weak coupling perturbative expansion of any observable in Lattice Gauge Theory. The idea is to insert the exponential representation of the…
We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…
For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…
A method is presented for calculating the Lie point symmetries of a scalar difference equation on a two-dimensional lattice. The symmetry transformations act on the equations and on the lattice. They take solutions into solutions and can be…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…
Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…
We study a lattice point counting problem for a class of families of domains in a Euclidean space. This class consists of anisotropically expanding bounded domains, which remain unchanged along some fixed linear subspace and expand in…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…