Related papers: On the regularity of almost stable relations
We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets to obtain an improved Lower…
Work of D. Stern and Bray-Kazaras-Khuri-Stern provide differential-geometric identities which relate the scalar curvature of Riemannian 3-manifolds to global invariants in terms of harmonic functions. These quantitative formulas are useful…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
In this work, we prove three types of results with the strategy that, together, the author believes these should imply the local version of Hilbert's Fifth problem. In a separate development, we construct a nontrivial topology for rings of…
The relative fixity of a permutation group is the maximum proportion of the points fixed by a non-trivial element of the group and the relative fixity of a graph is the relative fixity of its automorphism group, viewed as a permutation…
The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing various regularity properties such as metric regularity, i.e., the openness with a linear rate around the reference point, of…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
Although the \emph{residual method}, or \emph{constrained regularization}, is frequently used in applications, a detailed study of its properties is still missing. This sharply contrasts the progress of the theory of Tikhonov…
We prove stable versions of trace theorems on the sphere in $L^2$ with optimal constants, thus obtaining rather precise information regarding near-extremisers. We also obtain stability for the trace theorem into $L^q$ for $q > 2$, by…
This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…
This paper studies the quintic nonlinear Schr\"odinger equation on $\mathbb{R}^d$ with randomized initial data below the critical regularity $H^{\frac{d-1}{2}}$. The main result is a proof of almost sure local well-posedness given a Wiener…
The aim of this note is to present some new results concerning "almost everywhere" well-posedness and stability of continuity equations with measure initial data. The proofs of all such results can be found in \cite{amfifrgi}, together with…
We prove a slope 1 stability range for the homology of the symplectic, orthogonal and unitary groups with respect to the hyperbolic form, over any fields other than $F_2$, improving the known range by a factor 2 in the case of finite…
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…
We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…
We formulate and prove a very general relative version of the Dobrushin-Lanford-Ruelle theorem which gives conditions on constraints of configuration spaces over a finite alphabet such that for every absolutely summable relative…
Any Littlestone class, or stable graph, has finite sets which function as ``virtual elements'': these can be seen from the learning side as representing hypotheses which are expressible as weighted majority opinions of hypotheses in the…
We prove that infinite definably simple locally finite groups of finite centraliser dimension are simple groups of Lie type over locally finite fields. Then, we identify conditions on automorphisms of a stable group that make it resemble…