Related papers: Chv\'{a}tal's Conjecture and Correlation Inequalit…
We consider the hypothesis testing problem of deciding whether an observed high-dimensional vector has independent normal components or, alternatively, if it has a small subset of correlated components. The correlated components may have a…
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 $0 \leq k \leq n$, let ${[n] \choose \leq…
We prove an analogue of Jacquet's conjecture on the local converse theorem for \ell-adic families of co-Whittaker representations of GL_n(F), where F is a finite extension of Q_p and \ell does not equal p. We also prove an analogue of…
Gaussian correlation conjecture states that the Gaussian measure of the intersection of two symmetric convex sets is greater or equal to the product of the measures.
A complete theory ${\mathcal T}$ of partial order is an FLD$_1$-theory iff some (equivalently, any) of its models ${\mathbb X}$ admits a finite lexicographic decomposition ${\mathbb X} =\sum _{{\mathbb I}}{\mathbb X} _i$, where ${\mathbb…
The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…
We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families. We prove a conclusive version of Frankl's theorem on…
To study how balanced or unbalanced a maximal intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{\Delta(\mathcal{F})}{\delta(\mathcal{F})}$ of its maximum and minimum degree.…
We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…
The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…
This work provides calculus for the Fr\'echet and limiting subdifferential of the pointwise supremum given by an arbitrary family of lower semicontinuous functions. We start our study showing fuzzy results about the Fr\'echet…
Causal questions are omnipresent in many scientific problems. While much progress has been made in the analysis of causal relationships between random variables, these methods are not well suited if the causal mechanisms only manifest…
We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…
A deep conjecture on torsion anomalous varieties states that if $V$ is a weak-transverse variety in an abelian variety, then the complement $V^{ta}$ of all $V$-torsion anomalous varieties is open and dense in $V$. We prove some cases of…
We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the essential content of these proofs in a way that…
The existence of extremal functions for the Sobolev trace inequalities is studied using the concentration compactness theorem. The conjectured extremal, the function of conformal factor, is considered and is proved to be an actual extremal…
The Union-Closed Sets Conjecture, also known as Frankl's conjecture, asks whether, for any union-closed set family $\mathcal{F}$ with $m$ sets, there is an element that lies in at least $\frac{1}{2}\cdot m$ sets in $\mathcal{F}$. In 2022,…
Intersecting families and blocking sets feature prominently in extremal combinatorics. We examine the following generalization of an intersecting family investigated by Hajnal, Rothschild, and others. If $s \geq 1$, $k \geq 2$, and $u \geq…
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain intersection constraints are equivalent to that with the union…