arXiv subjects

Alexander Barvinok

Publications and source records attributed to Alexander Barvinok.

61 records · Page 4Linked to original sources

arXiv2002

Short rational generating functions for lattice point problems

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the dimension and the number of generators) are fixed. It follows then that many computational problems for such sets (for example, finding the number of positive integers not representable as a non-negative integer combination of given coprime positive integers a_1 ... a_d admit polynomial time algorithms. We also discuss a related problem of computing the Hilbert series of a ring generated by monomials.

math.CO↗

arXiv2002

Estimating Maximum by Moments for Functions on Orbits

Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain approximation algorithms to find the maximum absolute value of a given multivariate polynomial over the unit sphere (in which case G is the orthogonal group) and for the multidimensional assignment problem, a hard problem of combinatorial optimization (in which case G is the symmetric group).

math.OC↗

arXiv2001

Approximating a norm by a polynomial

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}. Corollaries and polynomial approximations of the Minkowski functional of a convex body are discussed.

math.FA↗

arXiv2001

The distribution of values in the quadratic assignment problem

We obtain a number of results regarding the distribution of values of a quadratic function f on the set of nxn permutation matrices (identified with the symmetric group S_n) around its optimum (minimum or maximum). In particular, we estimate the fraction of permutations sigma such that f(sigma) lies within a given neighborhood of the optimal value of f. We identify some ``extreme'' functions f (there are 4 of those for n even and 5 for n odd) such that the distribution of every quadratic function around its optimum is a certain ``mixture'' of the distributions of the extremes and describe a natural class of functions (which includes, for example, the objective function in the Traveling Salesman Problem) with a relative abundance of near-optimal permutations. In particular, we identify a large class of functions f with the property that permutations in the vicinity of the optimal permutation (in the Hamming metric of S_n) tend to produce near optimal values of f (such is, for example, the objective function in the symmetric Traveling Salesman Problem) and show that for general f, just the opposite behavior may take place: an average permutation in the vicinity of the optimal permutation may be much worse than an average permutation in the whole group S_n.

math.CO↗

arXiv2000

New Permanent Estimators via Non-Commutative Determinants

We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $Å$. The monomial expansion of the symmetrized determinant is obtained from the standard expansion of the commutative determinant by averaging the products of entries of the matrix in all possible orders. We show that for any fixed finite-dimensional associative algebra $Å$, the symmetrized determinant of an $n\times n$ matrix with the entries in $Å$ can be computed in polynomial in $n$ time (the degree of the polynomial is linear in the dimension of $Å$). Then, for every associative algebra $Å$ endowed with a scalar product and unbiased probability measure, we construct a randomized polynomial time algorithm to estimate the permanent of non-negative matrices. We conjecture that if $Å=\Mat(d, {\Bbb R})$ is the algebra of $d\times d$ real matrices endowed with the standard scalar product and Gaussian measure, the algorithm approximates the permanent of a non-negative $n \times n$ matrix within $O(γ_d^n)$ factor, where $\lim_{d \longrightarrow +\infty} γ_d=1$. Finally, we provide some informal arguments why the conjecture might be true.

math.CO↗

arXiv2000

The Distance Approach to Approximate Combinatorial Counting

We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Geometrically, we estimate the cardinality of a subset of the Boolean cube via the average distance from a point in the cube to the subset. As an application, we present a new randomized polynomial time algorithm which approximates the permanent of a 0-1 matrix by solving a small number of Assignment problems.

math.CO↗

arXiv1997

A simple polynomial time algorithm to approximate the permanent within a simply exponential factor

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized polynomial time the permanent of a given $n \times n$ non-negative matrix within a factor $2^{O(n)}$. When applied to approximating the permanent, the algorithm turns out to be a simple modification of the well-known Godsil-Gutman estimator.

math.RA↗