English
Related papers

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

200 papers

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. FC-families are families for which it is proved that every…

Discrete Mathematics · Computer Science 2012-07-17 Filip Marić , Miodrag Živković , Bojan Vučković

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

Combinatorics · Mathematics 2020-11-17 George M. Bergman

For a set $L$ of positive proper fractions and a positive integer $r \geq 2$, a fractional $r$-closed $L$-intersecting family is a collection $\mathcal{F} \subset \mathcal{P}([n])$ with the property that for any $2 \leq t \leq r$ and $A_1,…

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

Combinatorics · Mathematics 2024-08-16 Bryce Alan Christopherson , Darian Colgrove

A family of vectors $A \subset [k]^n$ is said to be intersecting if any two elements of $A$ agree on at least one coordinate. We prove, for fixed $k \ge 3$, that the size of a symmetric intersecting subfamily of $[k]^n$ is $o(k^n)$, which…

Combinatorics · Mathematics 2021-07-01 Sean Eberhard , Jeff Kahn , Bhargav Narayanan , Sophie Spirkl

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

Combinatorics · Mathematics 2024-12-02 Yan zilong , Peng Yuejian

For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be expressed as $F\setminus G$, where $F,G\in \mathcal F$. A family $\mathcal F$ is intersecting if any two sets from the family have…

Combinatorics · Mathematics 2022-08-12 Peter Frankl , Sergei Kiselev , Andrey Kupavskii

Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…

Combinatorics · Mathematics 2025-04-21 Masahiro Hachimori , Kenji Kashiwabara

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

Combinatorics · Mathematics 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

We say that a family $\mathcal F$ of $k$-element sets is a {\it $j$-junta} if there is a set $J$ of size $j$ such that, for any $F$, its presence in $\mathcal F$ depends on its intersection with $J$ only. Approximating arbitrary families by…

Combinatorics · Mathematics 2020-09-07 Peter Frankl , Andrey Kupavskii

Let $L = \{\frac{a_1}{b_1}, \ldots , \frac{a_s}{b_s}\}$, where for every $i \in [s]$, $\frac{a_i}{b_i} \in [0,1)$ is an irreducible fraction. Let $\mathcal{F} = \{A_1, \ldots , A_m\}$ be a family of subsets of $[n]$. We say $\mathcal{F}$ is…

Combinatorics · Mathematics 2018-03-14 Niranjan Balachandran , Rogers Mathew , Tapas Kumar Mishra

Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a…

Quantum Physics · Physics 2014-01-30 Adan Cabello , Simone Severini , Andreas Winter

A family $\mathcal{F}$ is $t$-$\it{intersecting}$ if any two members have at least $t$ common elements. Erd\H os, Ko, and Rado proved that the maximum size of a $t$-intersecting family of subsets of size $k$ is equal to $ {{n-t} \choose…

Combinatorics · Mathematics 2014-11-19 Dong Yeap Kang , Jaehoon Kim , Younjin Kim

Given a family $S$ of $k$--subsets of $[n]$, its lower shadow $\Delta(S)$ is the family of $(k-1)$--subsets which are contained in at least one set in $S$. The celebrated Kruskal--Katona theorem gives the minimum cardinality of $\Delta(S)$…

Combinatorics · Mathematics 2023-04-12 Oriol Serra , Lluís Vena

In this paper, we first prove relation between analytic and co-analytic part of the class harmonic univalent functions S_H(S):={f = h+\overline g|h is element of S} by means of second dilatation is constant. Next, we verify the coefficient…

Complex Variables · Mathematics 2019-03-01 Yaşar Polatoğlu , Oya Mert , Asena Çetinkaya

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

The Torsion Anomalous Conjecture (TAC) states that a subvariety V of an abelian variety A has only finitely many maximal torsion anomalous subvarieties. In this work we prove, with an effective method, some cases of the TAC when the ambient…

Number Theory · Mathematics 2016-05-16 Sara Checcoli , Evelina Viada

We are interested in investigating the statistical properties of extreme values for strongly correlated variables. The starting motivation is to understand how the strong-correlation properties of power-law distributed processes affect the…

Computational Physics · Physics 2024-05-21 Salvatore Miccichè

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

Combinatorics · Mathematics 2022-11-23 Jagannath Bhanja , Sayan Goswami

Classical Kolmogorov's and Rosenthal's inequalities for the maximum partial sums of random variables are basic tools for studying the strong laws of large numbers. In this paper, motived by the notion of independent and identically…

Probability · Mathematics 2019-03-06 Li-Xin Zhang