English
Related papers

Related papers: A Common Generalization to Theorems on Set Systems…

200 papers

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A…

Combinatorics · Mathematics 2025-10-27 Jie Wen , Benjian Lv

In this note, we prove a certain hypergraph generalization of the Balog-Szemeredi-Gowers Theorem. Our result shares some features in common with a similar such generalizsation due to Sudakov, Szemeredi and Vu, though the conclusion of our…

Combinatorics · Mathematics 2008-06-25 Ernie Croot , Evan Borenstein

We shall be interested in the following Erdos-Ko-Rado-type question. Fix some subset B of [n]. How large a family A of subsets of [n] can we find such that the intersection of any two sets in A contains a cyclic translate (modulo n) of B?…

Combinatorics · Mathematics 2007-10-10 Paul A. Russell

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Logic · Mathematics 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

We give simpler algebraic proofs of uniqueness for several Erd\H{o}s-Ko-Rado results, i.e., that the canonically intersecting families are the only largest intersecting families. Using these techniques, we characterize the largest partially…

Combinatorics · Mathematics 2022-01-11 Yuval Filmus , Nathan Lindzey

We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…

Logic in Computer Science · Computer Science 2015-03-18 Kentaro Kikuchi

The root systems appearing in the theory of Lie superalgebras and Nichols algebras admit a large symmetry extending properly the one coming from the Weyl group. Based on this observation we set up a general framework in which the symmetry…

Quantum Algebra · Mathematics 2007-05-23 I. Heckenberger , H. Yamane

We provide a structural generalization of a theorem by Kleiman--Piene, concerning the enumerative geometry of nodal curves in a complete linear system |L| on a smooth projective surface S. Provided that r, the number of nodes, is…

Algebraic Geometry · Mathematics 2014-07-17 Nikolay Qviller

A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…

Number Theory · Mathematics 2020-08-19 Kenneth Ascher , Lucas Braune , Amos Turchet

This paper proves a stability result for a variation of the Erd\H{o}s-Ko-Rado theorem in the context of polynomials over finite fields. Let $\mathcal F$ be a family of polynomials of degree at most $k \geq 3$ in $\mathbb F_q[X]$. Call…

Combinatorics · Mathematics 2025-12-10 Sam Adriaensen

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…

Combinatorics · Mathematics 2016-10-10 Gabor Hegedüs , Lajos Ronyai

A family of sets is intersecting if every pair of its members has an element in common. Such a family of sets is called a star if some element is in every set of the family. Given a graph $G$, let $\mu(G)$ denote the size of the smallest…

Combinatorics · Mathematics 2025-06-10 Glenn Hurlbert

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

We show that A. Javanpeykar's proof of Belyi's theorem for smooth complete intersections of general type in ordinary projective spaces can be generalised to smooth complete intersections of general type in generalised Grassmannians and…

Algebraic Geometry · Mathematics 2025-08-20 Mikhail Ovcharenko

A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…

Combinatorics · Mathematics 2020-08-20 Shaun Fallat , Karen Meagher , Mahsa N. Shirazi

Intersection bodies represent a remarkable class of geometric objects associated with sections of star bodies and invoking Radon transforms, generalized cosine transforms, and the relevant Fourier analysis. The main focus of this article is…

Functional Analysis · Mathematics 2007-05-23 Boris Rubin

A family $F$ of sets is said to be $t$-intersecting if $|A \cap B| \geq t$ for any $A,B \in F$. The seminal Complete Intersection Theorem of Ahlswede and Khachatrian (1997) gives the maximal size $f(n,k,t)$ of a $t$-intersecting family of…

Combinatorics · Mathematics 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz

We generalize Nakamaye's description, via intersection theory, of the augmented base locus of a big and nef divisor on a normal pair with log-canonical singularities or, more generally, on a normal variety with non-lc locus of dimension at…

Algebraic Geometry · Mathematics 2014-12-24 Salvatore Cacciola , Angelo Felice Lopez

Sunflowers, or $\Delta$-systems, are a fundamental concept in combinatorics introduced by Erd\H{o}s and Rado in their paper: {\em Intersection theorems for systems of sets}, J. Lond. Math. Soc. (1) {\bf 35} (1960), 85--90. A sunflower is a…

Combinatorics · Mathematics 2025-09-19 Anup Rao

Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp.…

Combinatorics · Mathematics 2026-05-25 Shuhui Yu , Lijun Ji
‹ Prev 1 4 5 6 7 8 10 Next ›