Related papers: A New Proof of the New Intersection Theorem
There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
These notes are the first chapter of a monograph, dedicated to a detailed proof of the equivariant index theorem for transversally elliptic operators. In this preliminary chapter, we prove a certain number of natural relations in…
The algebraic Hodge theorem was proved in a beautiful 1987 paper by Deligne and Illusie, using positive characteristic methods. We argue that the central algebraic object of their proof can be understood geometrically as a line bundle on a…
O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker…
We extend the relative theory of admissible pairs and $p$-adic Hodge structures introduced in Part II to allow variation in the underlying local systems of $\mathbb{Q}_p$-vector spaces and isocrystals. This extension accommodates, in…
A pairing model for nucleons, introduced by Richardson in 1966, which describes proton-neutron pairing as well as proton-proton and neutron-neutron pairing, is re-examined in the context of the Quantum Inverse Scattering Method.…
We present a methodology for computer assisted proofs of Shil'nikov homoclinic intersections. It is based on geometric bounds on the invariant manifolds using rate conditions, and on propagating the bounds by an interval arithmetic…
Broadening existing results in the literature to much wider classes of rings, we prove among other things: 1. Reduced quotients of excellent regular rings of characteristic $p$ admit big test elements, 2. The set of F-jumping numbers of a…
Let $A$ be a commutative noetherian ring and $I$ an ideal in $A$. We characterize algebraically when all the minimal primes of the associated graded ring $G_I A$ contract to minimal primes of $A/I$. This, applied to intersection theory,…
Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…
The seminal Erd\H{o}s--Ko--Rado (EKR) theorem states that if $\mathcal{F}$ is a family of $k$-subsets of an $n$-element set $X$ for $k\leq n/2$ such that every pair of subsets in $\mathcal{F}$ has a nonempty intersection, then $\mathcal{F}$…
We prove a geometrical version of Herbert's theorem by considering the self-intersection immersions of a self-transverse immersion up to bordism. This generalises Herbert's theorem to additional cohomology theories and gives a commutative…
For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…
In [5], Srijuntongsiri and Vavasis propose the "Kantorovich-Test Subdivision algorithm", or KTS, which is an algorithm for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the…
In 1987, Frankl proved an influential stability result for the Erd\H os--Ko--Rado theorem, which bounds the size of an intersecting family in terms of its distance from the nearest (subset of) star or trivial intersecting family. It is a…
We develop a systematic method to solve the Cardy condition for the coset conformal field theory G/H. The problem is equivalent to finding a non-negative integer valued matrix representation (NIM-rep) of the fusion algebra. Based on the…
The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with…
A set of permutations of $\{1,2,\dots,n\}$ is $t$-intersecting if any two permutations agree on at least $t$ inputs. A recent work by Kupavskii, in the spirit of the Erd\H{o}s-Ko-Rado Theorem, shows that for all $t\leq…
In 1958, Hill conjectured that the minimum number of crossings in a drawing of $K_n$ is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…