English
Related papers

Related papers: On a problem of M. Talagrand

200 papers

Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family $F$ on a finite set $X$ that $p_c (F) =O( q_f (F) \log \ell(F))$, where…

Combinatorics · Mathematics 2019-12-11 Keith Frankston , Jeff Kahn , Bhargav Narayanan , Jinyoung Park

A conjecture of Talagrand (2010) states that the so-called expectation and fractional expectation thresholds are always within at most some constant factor from each other. Expectation (resp. fractional expectation) threshold $q$ (resp.…

Combinatorics · Mathematics 2023-11-15 Thomas Fischer , Yury Person

Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of…

Combinatorics · Mathematics 2024-12-05 Huy Tuan Pham

Talagrand conjectured that if a family of sets $\mathcal{F}$ over $X = \{ 1,2,\cdots, N \}$ is of large measure, then constant times of unions of sets in $\mathcal{F}$ will cover a large portion of the power set of $X$. This conjecture is a…

Combinatorics · Mathematics 2025-12-08 Xuan Fang , Tianyu Wang

We show that a restricted version of a conjecture of M. Talagrand on the relation between "expectation thresholds" and "fractional expectation thresholds" follows easily from a strong version of a second conjecture of Talagrand, on…

Combinatorics · Mathematics 2024-12-03 Quentin Dubroff , Jeff Kahn , Jinyoung Park

A conjecture of Talagrand (2010) states that the so-called expectation and fractional expectation thresholds are always within at most some constant factor from each other. We prove for the unweighted case that this is a.a.s. true when the…

Combinatorics · Mathematics 2025-10-22 Thomas Fischer , Yury Person

Proving the ``expectation-threshold'' conjecture of Kahn and Kalai, we show that for any increasing property $\mathcal{F}$ on a finite set $X$, $$p_c(\mathcal{F})=O(q(\mathcal{F})\log \ell(\mathcal{F})),$$ where $p_c(\mathcal{F})$ and…

Combinatorics · Mathematics 2023-04-14 Jinyoung Park , Huy Tuan Pham

Let $p_\mathrm{c}$ and $q_\mathrm{c}$ be the threshold and the expectation threshold, respectively, of an increasing family $\mathcal{F}$ of subsets of a finite set $X$, and let $l$ be the size of a largest minimal element of $\mathcal{F}$.…

Combinatorics · Mathematics 2026-01-19 Tomasz Przybyłowski , Oliver Riordan

A conjecture of Talagrand (2010) states that the so-called expectation and fractional expectation thresholds are always within at most some constant factor from each other. In this note we generalize a method of DeMarco and Kahn and settle…

Combinatorics · Mathematics 2025-05-29 Thomas Fischer , Yury Person

Harris's correlation inequality states that any two monotone functions on the Boolean hypercube are positively correlated. Talagrand \cite{Talcorr} started a line of works in search of quantitative versions of this fact by providing a lower…

Combinatorics · Mathematics 2019-12-30 Ronen Eldan

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian, denoted by $\lambda_r(m)$, among all $r$-uniform hypergraphs of fixed size $m$ is achieved by the minimum hypergraph $C_{r,m}$ under the colexicographic order. We say $m$…

Combinatorics · Mathematics 2018-07-02 Hui Lei , Linyuan Lu

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

Combinatorics · Mathematics 2023-06-07 Dmitry Krachun , Fedor Petrov

The classical correlation inequality of Harris asserts that any two monotone increasing families on the discrete cube are nonnegatively correlated. In 1996, Talagrand established a lower bound on the correlation in terms of how much the two…

Combinatorics · Mathematics 2015-11-17 Gil Kalai , Nathan Keller , Elchanan Mossel

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…

Combinatorics · Mathematics 2017-10-11 Mykhaylo Tyomkyn

We prove existence of solutions $(\phi,\lambda)$ of a family of of Feigenbaum-like equations \label{family} \phi(x)={1+\eps \over \lambda} \phi(\phi(\lambda x)) -\eps x +\tau(x), where $\eps$ is a small real number and $\tau$ is analytic…

Dynamical Systems · Mathematics 2010-09-28 Denis Gaidashev

For a complex simple Lie algebra $\mathfrak{g}$ or rank $r$, let $\rho$ be the half sum of positive roots and $P(2\rho)\subset \mathbb{R}^r$ be the convex hull of all dominant weights $\lambda$ of the form $\lambda=2\rho-\sum_{i=1}^r…

Representation Theory · Mathematics 2024-03-05 Arzu Boysal

Let $L/K$ be a Galois extension of number fields and let $G=\mathrm{Gal}(L/K)$. We show that under certain hypotheses on $G$, for a fixed prime number $p$, Leopoldt's conjecture at $p$ for certain proper intermediate fields of $L/K$ implies…

Number Theory · Mathematics 2026-03-24 Fabio Ferri , Henri Johnston

Gilmer has recently shown that in any nonempty union-closed family $\mathcal F$ of subsets of a finite set, there exists an element contained in at least a proportion $.01$ of the sets of $\mathcal F$. We improve the proportion from $.01$…

Combinatorics · Mathematics 2023-06-21 Will Sawin

We consider the swampland distance and de Sitter conjectures, of respective order one parameters $\lambda$ and $c$. Inspired by the recent Trans-Planckian Censorship conjecture (TCC), we propose a generalization of the distance conjecture,…

High Energy Physics - Theory · Physics 2020-08-26 David Andriot , Niccolò Cribiori , David Erkinger

An old and well-known conjecture of Frankl and F\"{u}redi states that the Lagrangian of an $r$-uniform hypergraph with $m$ edges is maximised by an initial segment of colex. In this paper we disprove this conjecture by finding an infinite…

Combinatorics · Mathematics 2020-03-03 Vytautas Gruslys , Shoham Letzter , Natasha Morrison
‹ Prev 1 2 3 10 Next ›