Related papers: Openness of Regular Regimes of Complex Random Matr…
In this work, we extend a classical theorem of Keith Ball on integrals of log-concave functions along rays against the weight $r^{p-1}$ to the previously inaccessible regime $p\in (-1,0)$: if $g:\mathbb R^n\to\mathbb R_+$ is an integrable…
The aim of this paper is to study the dimensions and standard part maps between the field of $p$-adic numbers ${{\mathbb Q}_p}$ and its elementary extension $K$ in the language of rings $L_r$. We show that for any $K$-definable set…
We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…
We find higher rank generalizations of the Razumov--Stroganov sum rules at $q=-e^{i\pi\over k+1}$ for $A_{k-1}$ models with open boundaries, by constructing polynomial solutions of level one boundary quantum Knizhnik--Zamolodchikov…
The joint replenishment problem (JRP) is a classical inventory management problem. We consider a natural generalization with outliers, where we are allowed to reject (that is, not service) a subset of demand points. In this paper, we are…
We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…
Given a matrix $A$, the goal of the entrywise low-rank approximation problem is to find $\operatorname{argmin} \|A-B\|_p$ over all rank-$k$ matrices $B$, where $\| \cdot \|_p$ is the entrywise $\ell_p$ norm. When $p = 2$ this well-studied…
We show that a densely defined closable operator $A$ such that the resolvent set of $A^2$ is not empty is necessarily closed. This result is then extended to the case of a polynomial $p(A)$. We also generalize a recent result by…
We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
The Weak approximation theorem describes the closure of $G(Q)$ inside $G(Q_p)$ as well as inside $G(R)$ for $G$ an algebraic group over $Q$; the closure is always an open normal subgroup with finite abelian quotient, and is well understood…
We construct new solvable rational and trigonometric spin models with near-neighbors interactions by an extension of the Dunkl operator formalism. In the trigonometric case we obtain a finite number of energy levels in the center of mass…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
We show that the TASEP of a driven system of particles of arbitrary size, with nearest neighbor repulsive interaction, on an open lattice is equivalent to the TASEP of interacting monomers on an open lattice whose size fluctuates in…
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…
We study the boundedness problem for maximal operators $\mathbb{M}$ associated to averages along families of finite type curves in the plane, defined by $$\mathbb{M}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{\mathbb{C}} f(x-ty) \,…
We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…