Related papers: Openness of Regular Regimes of Complex Random Matr…
We approach the Max-3-Cut problem through the lens of maximizing complex-valued quadratic forms and demonstrate that low-rank structure in the objective matrix can be exploited, leading to alternative algorithms to classical semidefinite…
In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…
We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…
We study the one-dimensional asymmetric simple exclusion process (ASEP) with open boundary conditions. Particles are injected and ejected at both boundaries. It is clarified that the steady state of the model is intimately related to the…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of…
In this workshop, we discuss several algorithms for mathematical programs with equilibrium constraints (MPECs). The unifying theme is that MPECs are optimization problems whose feasible set contains a lower-level equilibrium system, often…
Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
In this article, we study the q-state Potts random matrix models extended to branched polymers, by the equations of motion method. We obtain a set of loop equations valid for any arbitrary value of q. We show that, for q=2-2 \cos {l \over…
The vertex algebras $V^{(p)}$ and $R^{(p)}$ introduced in [2] are very interesting relatives of the famous triplet algebras of logarithmic CFT. The algebra $V^{(p)}$ (respectively, $R^{(p)}$) is a large extension of the simple affine vertex…
We examine sets $\mathscr A$ of natural numbers having the property that for some real number $p\in (0,2)$, one has the subconvex bound $$\int_0^1 \Bigl| \sum_{n\in \mathscr A\cap [1,N]}e(n\alpha)\Bigr|^p\, {\rm d}\alpha \ll N^{-1}|\mathscr…
We prove an abstract criterion that a surjective convolution operator in spaces of analytic functions on convex subsets of the complex plane has a continuous linear right inverse. Considered convex sets have a countable neighborhood basis…
We generalize an earlier result of Segev, which shows that {\em some\/} component in a minimal counterexample to Quillen's conjecture must admit an outer automorphism. We show in fact that {\em every\/} component must admit an outer…
We study the equilibrium measure for a logarithmic potential in the presence of an external field V*(x) + tp(x), where t is a parameter, V*(x) is a smooth function and p(x) a monic polynomial. When p(x) is of an odd degree, the equilibrium…
Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…
Given a positive definite kernel in a locally compact space, we study a minimal energy problem in the presence of an external field over the class of all nonnegative Radon measures that are supported by a given closed noncompact set,…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…
We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…