Related papers: Higher-order generalizations of stability and arit…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We introduce a new notion of the stability of computations, which holds under post-processing and adaptive composition. We show that the notion is both necessary and sufficient to ensure generalization in the face of adaptivity, for any…
Let $G$ be a reductive affine algebraic group, and let $X$ be an affine algebraic $G$-variety. We establish a (poly)stability criterion for points $x\in X$ in terms of intrinsically defined closed subgroups $H_{x}$ of $G$, and relate it…
L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…
Modern data science applications demand solving large-scale optimization problems. The prevalent approaches are first-order methods, valued for their scalability. These methods are implemented to tackle highly irregular problems where…
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
We prove that any tame abstract elementary class categorical in a suitable cardinal has an eventually global good frame: a forking-like notion defined on all types of single elements. This gives the first known general construction of a…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
Let $a_{i1}x_1+\cdots+a_{ik}x_k=0$, $i\in[m]$ be a balanced homogeneous system of linear equations with coefficients $a_{ij}$ from a finite field $\mathbb{F}_q$. We say that a solution $x=(x_1,\ldots, x_k)$ with $x_1,\ldots, x_k\in…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…
We give a stability theoretic proof of the algebraic regularity lemma of Tao, making use of a lemma of Hrushovski. We also point out that the underlying results hold at the level of measurable theories and structures in the sense of Elwes,…
Grossberg and VanDieren have started a program to develop a stability theory for tame classes. We prove, for instance, that for tame abstract elementary classes satisfying the amlagamation property and for large enough cardinals kappa,…
Uniform stability of a learning algorithm is a classical notion of algorithmic stability introduced to derive high-probability bounds on the generalization error (Bousquet and Elisseeff, 2002). Specifically, for a loss function with range…
A group $\Gamma$ is said to be uniformly HS stable if any map $\varphi : \Gamma \to U(n)$ that is almost a unitary representation (w.r.t. the Hilbert Schmidt norm) is close to a genuine unitary representation of the same dimension. We…
Given a closed, convex cone $K\subseteq \mathbb{R}^n$, a multivariate polynomial $f\in\mathbb{C}[\mathbf{z}]$ is called $K$-stable if the imaginary parts of its roots are not contained in the relative interior of $K$. If $K$ is the…
We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…
Was paper 839 in the author's list until winter 2023 when it was divided into three. Part I: We would like to generalize imaginary elements, weight of ortp$(a,M,N), {\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [She90, Ch.…
We investigate a hierarchy of semidefinite bounds $\vartheta^{(r)}(G)$ for the stability number $\alpha(G)$ of a graph $G$, based on its copositive programming formulation and introduced by de Klerk and Pasechnik [{\em SIAM J. Optim.} 12…
This paper introduces and investigates a regularity condition in the asymptotic sense for optimization problems whose objective functions are polynomial. Under this regularity condition, the normalization argument in asymptotic analysis…