Related papers: Set System Blowups
We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…
We consider the $SU(n+1)$ Toda system $$(S_\lambda) \quad \left\{ \begin{aligned} & \Delta u_1 + 2\lambda e^{u_1} - \lambda e^{u_2}- \dots - \lambda e^{u_k} = 0\quad \hbox{in}\ \Omega,\\ & \Delta u_2 - \lambda e^{u_1} + 2\lambda e^{u_2} -…
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…
We consider the classical problem of the blowing-up of solutions of the nonlinear heat equation. We show that there exist infinitely many profiles around the blow-up point, and for each integer $k$, we construct a set of codimension $2k$ in…
Consider families of $k$-subsets (or blocks) on a ground set of size $v$. Recall that if all $t$-subsets occur with the same frequency $\lambda$, one obtains a $t$-design with index $\lambda$. On the other hand, if all $t$-subsets occur…
A family of permutations $A \subset S_n$ is said to be \emph{$t$-set-intersecting} if for any two permutations $\sigma, \pi \in A$, there exists a $t$-set $x$ whose image is the same under both permutations, i.e. $\sigma(x)=\pi(x)$. We…
For Liouville equation with quantized singular sources, the non-simple blowup phenomenon has been a major difficulty for years. It was conjectured by the first two authors that the non-simple blowup phenomenon does not occur if the equation…
In this paper we study a system of delay differential equations from the viewpoint of a finite time blow-up of the solution. We prove that the system admits a blow-up solution, no matter how small the length of the delay is. In the…
Given a graph $G$, let $f_{G}(n,m)$ be the minimal number $k$ such that every $k$ independent $n$-sets in $G$ have a rainbow $m$-set. Let $\mathcal{D}(2)$ be the family of all graphs with maximum degree at most two. Aharoni et al. (2019)…
In this paper, we consider the Cauchy problem of the Geng-Xue system with cubic nonlinearity. Firstly, we prove a blow-up criteria in the low besov space. Secondly, we prove the blow-up phenomenon by using the method which does not require…
We study positive blowing-up solutions of systems of the form: $$u_t=\delta_1 \Delta u+e^{pv},\quad v_t= \delta_2\Delta v+e^{qu},$$ with $\delta_1,\delta_2>0$ and $p, q>0$. We prove single-point blow-up for large classes of radially…
Blow-up rates are established for general solutions to the quasilinear diffusion equation $$ \partial_tu=\Delta u^m+|x|^{\sigma}u^p, \quad (x,t)\in\mathbb{R}^N\times(0,T), $$ in the range of exponents $1<p<m$, $\sigma>0$. More precisely, if…
In this paper we develop a blow up theory for the parabolic-elliptic Keller-Segel system, which can be viewed as a parabolic counterpart to the Liouville equation. This theory is applied to the study of first time singularities, ancient…
A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently large depending on $k$, then the largest…
The Union-Closed Sets Conjecture asks whether every union-closed set family $\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in…
For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is…
A classical result of K. L. Chung and W. Feller deals with the partial sums $S_k$ arising in a fair coin-tossing game. If $N_n$ is the number of "positive" terms among $S_1, S_2,\dots,S_n$ then the quantity $P(N_{2n}=2r)$ takes an elegant…
The universal scheme of clusters of sections is an adaption of Kleiman's iterated blow ups (which parametrise clusters of points) to parametrise clusters of sections. They can also be constructed iteratively, but the iterative step is not…
We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…
Our aim in this note is to show that, for any $\epsilon>0$, there exists a union-closed family $\mathcal F$ with (unique) smallest set $S$ such that no element of $S$ belongs to more than a fraction $\epsilon$ of the sets in $\mathcal F$.…