English
Related papers

Related papers: Set System Blowups

200 papers

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

Combinatorics · Mathematics 2025-12-25 Ryan Alweiss

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a set $S\subseteq [n]$ if every possible subset of $S$ appears as the intersection of $S$ with some element of $\mathcal{F}$ and we denote by $\text{Sh}(\mathcal{F})$ the…

Combinatorics · Mathematics 2019-08-09 Tamás Mészáros

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

Combinatorics · Mathematics 2019-12-17 Gil Kalai , Zuzana Patáková

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

Combinatorics · Mathematics 2026-01-13 Dehai Liu , Kaishun Wang , Tian Yao

The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…

Commutative Algebra · Mathematics 2011-06-21 Susumu Oda

For each given union-closed family F of n elements and m sets, we discuss the union-closed sets conjecture from height number of the UC family, which is a natural parameter from lattice theory. In this paper, we call it height number of…

Combinatorics · Mathematics 2022-04-12 Chenxiao Tian

We prove the following uniform version of a theorem by Lindstr\"om: Let $\mbox{$\cal F$}:=\{F_i:~ i\in I\}$ be a $k$-uniform set family of $[n]$, where $k\geq 1$. If $|\mbox{$\cal F$}|\geq n+1$, then there exist two disjoint subsets $I_1$…

Combinatorics · Mathematics 2026-02-27 Gábor Hegedüs

This paper explores the structure of the combinatorial domain $2^X$ in relation to sunflowers. The previous study found some intrinsic properties of the $l$-extension \[ Ext \left( \mathcal{F}, l \right) = \left\{ V ~:~ V \in {X \choose…

Combinatorics · Mathematics 2025-04-30 Junichiro Fukuyama

For each variety in positive characteristic, there is a series of canonically defined blowups, called F-blowups. We are interested in the question of whether the $e+1$-th blowup dominates the $e$-th, locally or globally. It is shown that…

Algebraic Geometry · Mathematics 2024-02-27 Takehiko Yasuda

In this paper we consider the $b$-family of equations on the torus $u\_t- u\_{txx}+ (b+1) u u\_x=b u\_x u\_{xx} + u u\_{xxx}$, which for appropriate values of $b$ reduces to well-known models, such as the Camassa-Holm equation or the…

Analysis of PDEs · Mathematics 2016-05-27 Manuel Fernando Cortez Estrella

It is shown that in a topological dynamical system with positive entropy, there is a measure-theoretically "rather big" set such that a multivariant version of mean Li-Yorke chaos happens on the closure of the stable or unstable set of any…

Dynamical Systems · Mathematics 2014-02-17 Wen Huang , Jian Li , Xiangdong Ye

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…

Combinatorics · Mathematics 2021-12-30 Ron Aharoni , Joseph Briggs , Minho Cho , Jinha Kim

The Union-Closed Sets Conjecture, often attributed to P\'eter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets $S\neq\{\emptyset\}$, if the union of any two sets in the family is…

Combinatorics · Mathematics 2024-05-31 Kengbo Lu , Abigail Raz

We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1,…

Combinatorics · Mathematics 2026-01-29 Jiangdong Ai , Ming Chen , Seokbeom Kim , Hyunwoo Lee

We introduce a fairly general concept of functional equation for $k$-tuples of functions $f_1,\dots,f_k\colon X \to Y$ between arbitrary sets. The homomorphy equations for mappings between groups and other algebraic systems, as well as…

Functional Analysis · Mathematics 2015-10-19 Pavol Zlatoš

We consider $u(x,t)$, a solution of $\partial_tu = \Delta u + |u|^{p-1}u$ which blows up at some time $T > 0$, where $u:\mathbb{R}^N \times[0,T) \to \mathbb{R}$, $p > 1$ and $(N-2)p < N+2$. Define $S \subset \mathbb{R}^N$ to be the blow-up…

Analysis of PDEs · Mathematics 2017-04-06 Tej-Eddine Ghoul , Van Tien Nguyen , Hatem Zaag

We study K-equivalent birational maps which are resolved by a single blowup. Examples of such maps include standard flops and twisted Mukai flops. We give a criterion for such maps to be a standard flop or a twisted Mukai flop. As an…

Algebraic Geometry · Mathematics 2017-01-18 Duo Li

This paper is motivated by the question of whether a sequence of solutions of a given integrable system can be blown up to obtain a solution of a different integrable system in the limit. We study a specific example of this phenomenon.…

Differential Geometry · Mathematics 2025-05-13 Emma Carberry , Sebastian Klein , Martin Ulrich Schmidt

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Combinatorics · Mathematics 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong