Related papers: Chv\'{a}tal's Conjecture and Correlation Inequalit…

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?…

In a 2019 paper, Barnard and Steinerberger show that for $f\in L^1(\mathbf{R})$, the following autocorrelation inequality holds: \begin{equation*} \min_{0 \leq t \leq 1} \int_\mathbf{R} f(x) f(x+t)\ \mathrm{d}x \ \leq\ 0.411 ||f||_{L^1}^2,…

For independent random variables $(X_i)_{1\leq i\leq n}$, we consider the maximal correlation coefficient $R=R(\min_{i:1\leq i\leq m}X_i,\min_{j:\ell+1\leq j\leq n}X_j)$. If $X_1,X_2,\ldots,X_n$ are identically distributed with the same…

In 1965, Paul Erd\H{o}s asked about the largest family $Y$ of $k$-sets in $\{ 1, \ldots, n \}$ such that $Y$ does not contain $s+1$ pairwise disjoint sets. This problem is commonly known as the Erd\H{o}s Matching Conjecture. We investigate…

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

The Torsion Anomalous Conjecture states that an irreducible variety $V$ embedded in a semi-abelian variety contains only finitely many maximal $V$-torsion anomalous varieties. In this paper we consider an irreducible variety embedded in a…

A theorem of Dolfi, Herzog, Kaplan, and Lev \cite[Thm.~C]{DHKL} asserts that in a finite group with trivial Fitting subgroup, the size of the soluble residual of the group is bounded from below by a certain power of the group order, and…

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

We find previously unknown families of sets which ensure Frankl's conjecture holds for all families that contain them using an algorithmic framework. The conjecture states that for any nonempty union-closed (UC) family there exists an…

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

Recently Conrey, Farmer and Zirnbauer conjectured formulas for the averages over a family of ratios of products of shifted L-functions. Their L-functions Ratios Conjecture predicts both the main and lower order terms for many problems,…

We make a comparative study of chiral-boson theories in the Florenani-Jackiw (FJ) and linear constraint formulations. A special attention is given to the case with an improved way of implementing the linear constraint. We show that it has…

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…

The study of intersecting structures is central to extremal combinatorics. A family of permutations $\mathcal{F} \subset S_n$ is \emph{$t$-intersecting} if any two permutations in $\mathcal{F}$ agree on some $t$ indices, and is…

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…

A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal{F} \subseteq 2^{[n]}$ such that $\mathcal{F} \neq…

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$,…

We consider a decision network on an undirected graph in which each node corresponds to a decision variable, and each node and edge of the graph is associated with a reward function whose value depends only on the variables of the…

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…