Related papers: Counting Integer Points in Multi-Index Transportat…

It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

We extend the Barvinok-Woods algorithm for enumerating projections of integer points in polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the…

Let m,n be positive integers. Define T(m,n) to be the transportation polytope consisting of the m x n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case B(n)=T(n,n) is the much-studied…

The asymptotic formula of the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups is given by the average of the product of the number of local solutions twisted by the…

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that…

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

We establish the asymptotic formula for the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups over global function fields, given by the sum of the products of local…

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…

A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

We establish asymptotic formulas for the number of integral points of bounded height on partial equivariant compactifications of vector groups.

We study the distribution of $S$-integral points on $\mathrm{SL}_2$-orbit closures of binary forms and prove an asymptotic formula for the number of $S$-integral points of bounded height on $\mathrm{SL}_2$-orbit closures of binary forms.…

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity.…

We examine the various indices defined on pairs of almost commuting unitary matrices that can detect pairs that are far from commuting pairs. We do this in two symmetry classes, that of general unitary matrices and that of self-dual…

In this paper, we address the problem of counting integer points in a rational polytope described by $P(y) = \{ x \in \mathbb{R}^m \colon Ax = y, x \geq 0\}$, where $A$ is an $n \times m$ integer matrix and $y$ is an $n$-dimensional integer…