相关论文: Chv\'{a}tal's Conjecture and Correlation Inequalit…
This paper considers estimation and inference about tail features when the observations beyond some threshold are censored. We first show that ignoring such tail censoring could lead to substantial bias and size distortion, even if the…
The Forrelation problem is a central problem that demonstrates an exponential separation between quantum and classical capabilities. In this problem, given query access to $n$-bit Boolean functions $f$ and $g$, the goal is to estimate the…
A family of subsets of $[n]$ is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combinatorics. Frankl-Kupavskii and Balogh-Das-Liu-Sharifzadeh-Tran…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
We take an $L_1$-dense class of functions $\Cal F$ on a measurable space $(X,\Cal X)$ and a sequence of i.i.d. $X$-valued random variables $\xi_1,\dots,\xi_n$, and give a good estimate on the tail behaviour of $\sup\limits_{f\in\Cal…
In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…
In this paper, we prove that most of the boolean functions, $f : \{-1,1\}^n \rightarrow \{-1,1\}$ satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (Proc. AMS'96). The conjecture says that the Entropy of a…
Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when $\c < {\aleph}_{\omega}$, we construct a weakly tight family under the hypothesis $\s \leq \b < {\aleph}_{\omega}$. The case when…
We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…
A number of mathematical methods have been shown to model the zeroes of $L$-functions with remarkable success, including the Ratios Conjecture and Random Matrix Theory. In order to understand the structure of convolutions of families of…
Variational inference has recently emerged as a popular alternative to the classical Markov chain Monte Carlo (MCMC) in large-scale Bayesian inference. The core idea is to trade statistical accuracy for computational efficiency. In this…
In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.
A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…
The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…
In this paper, we first prove the coefficient conjecture of Clunie and Sheil-Small for a class of univalent harmonic functions which includes functions convex in some direction. Next, we prove growth and covering theorems and some related…
In this paper we establish some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. We then use these ideas to prove the Hanna Neumann Conjecture of the 1950's; in fact,…
The paper is to prove the Gaussian correlation conjecture stating that, under the standard Gaussian measure, the measure of the intersection of any two symmetric convex sets is greater than or equal to the product of their measures.…
The fractional list packing number $\chi_{\ell}^{\bullet}(G)$ of a graph $G$ is a graph invariant that has recently arisen from the study of disjoint list-colourings. It measures how large the lists of a list-assignment $L:V(G)\rightarrow…
A fundamental result in extremal set theory is Katona's shadow intersection theorem, which extends the Kruskal-Katona theorem by giving a lower bound on the size of the shadow of an intersecting family of $k$-sets in terms of its size. We…