Related papers: The polytope of Tesler matrices

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

Let $\A$ be a finite dimensional vector space and $\Phi$ be a finite root system in $\A$. To this data is associated an affine poly-simplicial complex. Motivated by a forthcoming construction of connectified higher buildings, we study…

Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as non-negative integer entries. For a fixed triple…

Let $A$ be a finite dimensional algebra over an algebraically closed field $k$. Assume $A$ is a basic connected and triangular algebra with $n$ pairwise non-isomorphic simple modules. We consider the {\em Coxeter transformation} $\phi_A(T)$…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…

The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute…

The half-open hypersimplex $\Delta'_{n,k}$ consists of those $x = (x_{1}, \ldots, x_{n}) \in[0,1]^n$ with $k-1<x_1+\cdots+x_n\le k$, where $0 < k \leq n$. The $f$-vector of a half-open hypersimplex and related generating functions are…

In this article we answer a question raised by N. Feldman in \cite{Feldman} concerning the dynamics of tuples of operators on $\mathbb{R}^n$. In particular, we prove that for every positive integer $n\geq 2$ there exist $n$ tuples $(A_1,…

We work over strata of meromorphic differentials with poles of order 1, and on affine subspaces defined by linear conditions on the residues. We propose a definition of the volume of these objects as the integral of a tautological class on…

The characteristic polynomial of an $r$-tuple $(A_1,..., A_r)$ of $n \times n$ matrices is the determinant $\det(x_0 I + x_1 A_1 + ... + x_r A_r)$. We show that if $r$ is at least 3 and $A = (A_1,..., A_r)$ is an $r$-tuple of matrices in…

In this paper we study the computation of both algebraic and non-algebraic tensor functions under the tensor-tensor multiplication with linear maps. In the case of algebraic tensor functions, we prove that the asymptotic exponent of both…

In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…