Related papers: Hyperdeterminants on semilattices

We give a formula in terms of multidimensional resultants for an equation for the flex locus of a projective hypersurface, generalizing a classical result of Salmon for surfaces. Using this formula, we compute the dimension of this flex…

We study intertwining relations for matrix one-dimensional, in general, non-Hermitian Hamiltonians by matrix differential operators of arbitrary order. It is established that for any matrix intertwining operator Q_N^- of minimal order N…

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states which are invariant under the SLOCC group $SL(2,{\mathbb C})^{4}$. From this description, we obtain a closed formula for the…

We generalize the (signed) Varchenko matrix of a hyperplane arrangement to complexes of oriented matroids and show that its determinant has a nice factorization. This extends previous results on hyperplane arrangements and oriented…

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma…

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…

Given polynomials $f_1,\ldots,f_n$ in $m$ variables with integral coefficients, we give upper bounds for the number of integral $m$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_n$ of bounded height such that $f_1(\mathbf{u}_1), \ldots,…

We investigate the behaviour of the regularized determinant of the Laplace-Beltrami operator on compact hyperbolic surfaces when the genus goes to infinity. We show that for all popular models of random surfaces, with high probability as…

We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…

In this paper, we prove a generalization of the Schmidt's subspace theorem for polynomials of higher degree in subgeneral position with respect to a projective variety over a number field. Our result improves and generalizes the previous…

The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with…

Let $A$ be a central division algebra of prime degree $p$ over $\mathbb{Q}$. We obtain subconvex hybrid bounds, uniform in both the eigenvalue and the discriminant, for the sup-norm of Hecke-Maass forms on the compact quotients of…

Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…

Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…