Related papers: Explicit SoS lower bounds from high-dimensional ex…
We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…
We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…
We continue our work [arXiv:2403.07628] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre random matrix ensembles. By revisiting the construction of the associated skew-orthogonal polynomials…
We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this…
We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extractors, which are extractors that remain…
Motivated by stability analysis of large scale power systems, we describe how the Lasserre (moment-sums of squares, SOS) hierarchy can be used to generate outer approximations of the region of attraction (ROA) of sparse polynomial…
The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the…
A few years ago Selivanova gave an existence proof for some integrable models, in fact geodesic flows on two dimensional manifolds, with a cubic first integral. However the explicit form of these models hinged on the solution of a nonlinear…
We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…
In the present paper, using a modification of the method of vector fields $Z_i$ of the bi-Hamiltonian theory of separation of variables (SoV), we construct symmetric non-St\"ackel variable separation for three-dimensional extension of the…
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
We consider non-selfadjoint operators of the kind arising in linearized NLS and prove dispersive bounds for the time-evolution without assuming that the edges of the essential spectrum are regular. Our approach does not depend on any…
The moment-sum of squares hierarchy by Lasserre has become an established technique for solving polynomial optimization problems. It provides a monotonically increasing series of tight bounds, but has well-known scalability limitations. For…
We present two new explicit constructions of Cayley high dimensional expanders (HDXs) over the abelian group $\mathbb{F}_2^n$. Our expansion proofs use only linear algebra and combinatorial arguments. The first construction gives local…
The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…
The type III Hermite $X_m$ exceptional orthogonal polynomial family is generalized to a double-indexed one $X_{m_1,m_2}$ (with $m_1$ even and $m_2$ odd such that $m_2 > m_1$) and the corresponding rational extensions of the harmonic…
Combining recent results on rational solutions of the Riccati-Schr\"odinger equations for shape invariant potentials to the finite difference B\"acklund algorithm and specific symmetries of the isotonic potential, we show that it is…
We describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an idea of M. Gromov and A. Nabutovski. The immediate application,…
We introduce a family of trivalent expanders which tessellate compact hyperbolic surfaces with large isometry groups. We compare this family with Platonic graphs and modifications of them and prove topological and spectral properties of…
We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our construction is simpler to state and analyze than the only prior…