Related papers: Extremal $t$-intersecting families for direct prod…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

Families $\mathcal{A}_1, \mathcal{A}_2, ..., \mathcal{A}_k$ of sets are said to be \emph{cross-intersecting} if for any $i$ and $j$ in $\{1, 2, ..., k\}$ with $i \neq j$, any set in $\mathcal{A}_i$ intersects any set in $\mathcal{A}_j$. For…

We develop a model characterizing all possible knots and links arising from recombination starting with a twist knot substrate, extending previous work of Buck and Flapan. We show that all knot or link products fall into three…

Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we…

Skew-symmetric families of distributions such as the skew-normal and skew-$t$ represent supersets of the normal and $t$ distributions, and they exhibit richer classes of extremal behaviour. By defining a non-stationary skew-normal process,…

Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.

The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd\H{o}s-Ko-Rado theorem. Such intersecting families, also known as constant-weight anticodes in coding…

Let $X$ be a mildly singular Fano variety such that the tangent sheaf is a direct sum. We show that the direct factors are algebraically integrable, so the infinitesimal decomposition induces a product structure on a quasi-\'etale cover of…

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

We consider the ideal structure of reduced crossed products over discrete groups. First, we completely characterize primality for reduced crossed products. Second, we characterize the ideal intersection property for reduced crossed products…

Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the…

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…

Intersecting families and blocking sets feature prominently in extremal combinatorics. We examine the following generalization of an intersecting family investigated by Hajnal, Rothschild, and others. If $s \geq 1$, $k \geq 2$, and $u \geq…

Let $X$ be the product of a surface satisfying $b_2=\rho$ and of a curve over a finite field. We study a strong form of the integral Tate conjecture for $1$-cycles on $X$. We generalize and give unconditional proofs of several results of…

We prove that there exists a constant $c_0$ such that for any $t \in \mathbb{N}$ and any $n\geq c_0 t$, if $A \subset S_n$ is a $t$-intersecting family of permutations then$|A|\leq (n-t)!$. Furthermore, if $|A|\ge 0.75(n-t)!$ then there…

We ask when a finite set of t-structures in a triangulated category can be `averaged' into one t-structure or, equivalently, when the extension closure of a finite set of aisles is again an aisle. There is a straightforward, positive answer…

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…

We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…

For a set $L$ of positive proper fractions and a positive integer $r \geq 2$, a fractional $r$-closed $L$-intersecting family is a collection $\mathcal{F} \subset \mathcal{P}([n])$ with the property that for any $2 \leq t \leq r$ and $A_1,…

Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constraints on the query and on a possible preprocessing of the set…