Related papers: Stable sets in flag spheres
We show the stability of certain syzygies of line bundles on curves, which we call transforms, and are kernels of the evaluation map on subspaces of the space of global sections. For the transforms constructed, we prove the existence of…
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…
We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…
Two types of stability boundaries exist for any planetary system consisting of one star and two planets. Lagrange stability requires that the planets remain bound to the star, conserves the ordering of the distance from the star, and limits…
In the stable marriage problem N men and N women have to be matched by pairs under the constraint that the resulting matching is stable. We study the statistical properties of stable matchings in the large N limit using both numerical and…
We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their…
We prove a conjecture of Marques-Neves in arXiv:2103.10093, and several alternative formulations thereof, about the stability of the min-max width of three-spheres under the additional assumption of rotational symmetry. We can moreover…
Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…
We provide an example of minimum size of a finite semigroup with $\mathcal{J}^{\ast}\neq\mathcal{D}^{\ast}$. We introduce the notion of starred stability and prove that every starred stable semigroup has…
In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
We consider the isoperimetric inequality involving the $s$-perimeter and the $t$-perimeter with $0<s<t<1$, and show that the ball is a local minimizer of the (scale-invariant) isoperimetric ratio $\mathcal{F}(E):=P_t(E)^{\frac{1}{n-t}}/…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
We show the existence of stable bound orbits for the massive and massless particles moving in the simplest microstate geometry spacetime in the bosonic sector of the five-dimensional minimal supergravity. In our analysis, reducing the…
Nonlinear stripe patterns occur in many different systems, from the small scales of biological cells to geological scales as cloud patterns. They all share the universal property of being stable at different wavenumbers $q$, i.e., they are…
Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…
We develop a systematic framework for constructing spherical harmonics on the two-dimensional unit sphere as superpositions of Gaussian beams whose poles form well-separated point configurations. The distributional and analytic properties…
The edge domination number $\gamma_e(G)$ of a graph $G$ is the minimum size of a maximal matching in $G$. It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been…
Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on…