2,288 research outputs found
Unimodular graphs and Eisenstein sums
Motivated in part by combinatorial applications to certain sum-product
phenomena, we introduce unimodular graphs over finite fields and, more
generally, over finite valuation rings. We compute the spectrum of the
unimodular graphs, by using Eisenstein sums associated to unramified extensions
of such rings. We derive an estimate for the number of solutions to the
restricted dot product equation over a finite valuation ring.
Furthermore, our spectral analysis leads to the exact value of the
isoperimetric constant for half of the unimodular graphs. We also compute the
spectrum of Platonic graphs over finite valuation rings, and products of such
rings - e.g., . In particular, we deduce an improved lower
bound for the isoperimetric constant of the Platonic graph over
.Comment: V2: minor revisions. To appear in the Journal of Algebraic
Combinatoric
Message-Passing Algorithms for Quadratic Minimization
Gaussian belief propagation (GaBP) is an iterative algorithm for computing
the mean of a multivariate Gaussian distribution, or equivalently, the minimum
of a multivariate positive definite quadratic function. Sufficient conditions,
such as walk-summability, that guarantee the convergence and correctness of
GaBP are known, but GaBP may fail to converge to the correct solution given an
arbitrary positive definite quadratic function. As was observed in previous
work, the GaBP algorithm fails to converge if the computation trees produced by
the algorithm are not positive definite. In this work, we will show that the
failure modes of the GaBP algorithm can be understood via graph covers, and we
prove that a parameterized generalization of the min-sum algorithm can be used
to ensure that the computation trees remain positive definite whenever the
input matrix is positive definite. We demonstrate that the resulting algorithm
is closely related to other iterative schemes for quadratic minimization such
as the Gauss-Seidel and Jacobi algorithms. Finally, we observe, empirically,
that there always exists a choice of parameters such that the above
generalization of the GaBP algorithm converges
Convex Combinatorial Optimization
We introduce the convex combinatorial optimization problem, a far reaching
generalization of the standard linear combinatorial optimization problem. We
show that it is strongly polynomial time solvable over any edge-guaranteed
family, and discuss several applications
The Complexity of Testing Monomials in Multivariate Polynomials
The work in this paper is to initiate a theory of testing monomials in
multivariate polynomials. The central question is to ask whether a polynomial
represented by certain economically compact structure has a multilinear
monomial in its sum-product expansion. The complexity aspects of this problem
and its variants are investigated with two folds of objectives. One is to
understand how this problem relates to critical problems in complexity, and if
so to what extent. The other is to exploit possibilities of applying algebraic
properties of polynomials to the study of those problems. A series of results
about and polynomials are obtained in this paper,
laying a basis for further study along this line
- …