Related papers: A Tight Analysis of Bethe Approximation for Perman…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

Let A_n=(a_{ij})_{i,j=1}^n be an n\times n positive matrix with entries in [a,b], 0<a\le b. Let X_n=(\sqrta_{ij}x_{ij})_{i,j=1}^n be a random matrix, where {x_{ij}} are i.i.d. N(0,1) random variables. We show that for large n, \det…

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…

We generalize the classical theory of periodic continued fractions (PCFs) over ${\mathbf Z}$ to rings ${\mathcal O}$ of $S$-integers in a number field. Let ${\mathcal B}=\{\beta, {\beta^*}\}$ be the multi-set of roots of a quadratic…

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…

Let $A$ be an irreducible (entrywise) nonnegative $n\times n$ matrix with eigenvalues $$\rho, b+ic,b-ic, \lambda_4,\cdots,\lambda_n,$$ where $\rho$ is the Perron eigenvalue. It is shown that for any $t \in [0, \infty)$ there is a…

The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of complexity theory. It states that CNF formulas cannot be analyzed for satisfiability with a speedup over exhaustive search. This hypothesis and its…

For real symmetric positive definite matrices $A$ and $B$, we characterize when a function $f \in L^2(\mathbb{R}^d)$ satisfies \[ |f(x)| \lesssim e^{-(\frac12 - \lambda) \langle Ax, x\rangle} \quad \text{and} \quad |\widehat{f}(\xi)|…

This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…

A probabilistic frame is a Borel probability measure with finite second moment whose support spans $\mathbb{R}^d$. A Parseval probabilistic frame is one for which the associated matrix of the second moments is the identity matrix in…

A well-known fact in linear algebra is that $A^T A$ is always positive semi-definite for any real matrix $A$. We consider a generalization of this fact via the following decision problem. Given a symbolic product of length $k$, consisting…

In our previous works, we proved that the inverse of the stiffness matrix of an $h$-version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Suppose we are given an oracle that claims to approximate the permanent for most matrices X, where X is chosen from the Gaussian ensemble (the matrix entries are i.i.d. univariate complex Gaussians). Can we test that the oracle satisfies…

In this article we compute the number of invertible $2\times 2$ matrices with integer entries modulo $n$ whose permanents are congruent modulo $n$ to a given integer $x$.

We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number of variables have a tractable structure that we refer to as…

We study the approximability of the NP-complete \textsc{Maximum Minimal Feedback Vertex Set} problem. Informally, this natural problem seems to lie in an intermediate space between two more well-studied problems of this type:…

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…