Related papers: Shadows and intersections: stability and new proof…
For any $\epsilon>0$ and $n>(1+\epsilon)t$, $n>n_0(\epsilon)$ we determine the size of the largest $t$-intersecting family of permutations, as well as give a sharp stability result. This resolves a conjecture of Ellis, Friedgut and Pilpel…
In this short note, we address two problems in extremal set theory regarding intersecting families. The first problem is a question posed by Kupavskii: is it true that given two disjoint cross-intersecting families $\mathcal{A}, \mathcal{B}…
For an integer $r \ge 3$ and a subset $L \subset [0,r-1]$, a graph $G$ is $(K_{r}, L)$-intersecting if the number of vertices in the intersection of every pair of $K_r$ in $G$ belongs to $L$. We study the maximum number of $K_r$ in an…
This paper develops a theory of propagation of chaos for a system of weakly interacting particles whose terminal configuration is fixed as opposed to the initial configuration as customary. Such systems are modeled by backward stochastic…
Inspired by the Kruskal-Katona theorem a minimization problem is studied, where the role of the shadow is replaced by the image of the action of the monoid of increasing functions. One of our main results shows that compressed sets are a…
The (left-)curtain coupling, introduced by Beiglb\"ock and the author is an extreme element of the set of "martingale" couplings between two real probability measures in convex order. It enjoys remarkable properties with respect to order…
Erd\H{o}s-Ko-Rado (EKR) type theorems yield upper bounds on the sizes of families of sets, subject to various intersection requirements on the sets in the family. Stability versions of such theorems assert that if the size of a family is…
A family of subsets of $[n]$ is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combinatorics. Frankl-Kupavskii and Balogh-Das-Liu-Sharifzadeh-Tran…
We say that a family of $k$-subsets of an $n$-element set is intersecting, if any two of its sets intersect. In this paper we study different extremal properties of intersecting families, as well as the structure of large intersecting…
Isoperimetric inequalities have been studied since antiquity, and in recent decades they have been studied extensively on discrete objects, such as the hypercube. An important special case of this problem involves bounding the size of the…
We apply the theory of the Chow-Mumford line bundle as developed by Arezzo-et-al and build on earlier key insights of Paul and Tian (see \cite{Arezzo:DellaVedova:LaNave} and the references therein). In particular, we give an explicit…
We show that a large family of groups is uniformly stable relative to unitary groups equipped with submultiplicative norms, such as the operator, Frobenius, and Schatten $p$-norms. These include lamplighters $\Gamma \wr \Lambda$ where…
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the…
We develop a theory of Bridgeland stability conditions and moduli spaces of semistable objects for a family of varieties. Our approach is based on and generalizes previous work by Abramovich-Polishchuk, Kuznetsov, Lieblich, and…
The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverberg-type theory, which is concerned with the intersection pattern of faces in a…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
This paper examines and strengthens the Cuntz-Thomsen picture of equivariant Kasparov theory for arbitrary second-countable locally compact groups, in which elements are given by certain pairs of cocycle representations between C*-dynamical…
We examine the m-shades of t-intersecting families of k-subsets of [n], and conjecture on the optimal upper bound on their cardinalities. This conjecture extends Frankl's General Conjecture that was proven true by Ahlswede-Khachatrian. From…
The classical Erd\H{o}s-Ko-Rado theorem on the size of an intersecting family of $k$-subsets of the set $[n] = \{1, 2, \dots, n\}$ is one of the fundamental intersection theorems for set systems. After the establishment of the EKR theorem,…
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…