Related papers: The Non-Cancelling Intersections Conjecture
The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…
We study how macroscopic observational constraints restrict admissible microscopic explanatory structures when no intrinsic order or dynamics is assumed a priori. Starting from an unordered collection of measurement outcomes, we formulate…
Let $t$ be a non-negative integer and $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ be a set-pair family satisfying $|A_i \cap B_i|\leq t$ for $1\leq i \leq m$. $\mbox{$\cal P$}$ is called strong Bollob\'as $t$-system, if $|A_i\cap…
Early results by Borel and Cantelli and Erd\H{o}s and Chung have provided bounds for the measure of a limsup set in terms of measures of its constituent sets and their intersections. Recent work by Beresnevich and Velani \cite{Velanipaper}…
The translative intersection formula of integral geometry yields an expression for the mean Euler characteristic of a stationary random closed set intersected with a fixed observation window. We formulate this result in the setting of sets…
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…
Two main approaches in simultaneous inference are intersection-union tests and union-intersection tests. For intersection-union hypotheses, the classical IUT based on marginal p-values and the all-in-alternative UIT are compared. Depending…
The idea of a finite collection of closed sets having "strongly regular intersection" at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically,…
In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \(k\)…
Let $\mathcal{A}\subseteq{[n]\choose a}$ and $\mathcal{B}\subseteq{[n]\choose b}$ be two families of subsets of $[n]$, we say $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting if $A\cap B\neq \emptyset$ for all $A\in\mathcal{A}$,…
Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. For any positive integers $n$ and $k$, let $\binom{[n]}{k}$ denote…
A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.
A family $\mathcal F\subset 2^{[n]}$ is called intersecting if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Peter Frankl…
The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…
The purpose of the article is to provide partial proofs for two conjectures given by Witte and Forrester in "Moments of the Gaussian $\beta$ Ensembles and the large $N$ expansion of the densities" with the use of the topological recursion…
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
We apply methods of derived and non-commutative algebraic geometry to understand intersection theoretic phenomena on arithmetic schemes. Specifically, we categorify Bloch's intersection number (in the formulation provided by Kato--Saito).…
Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…