中文
相关论文

相关论文: Minimal weight in union-closed families

200 篇论文

The Union-Closed Sets Conjecture, often attributed to P\'eter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets $S\neq\{\emptyset\}$, if the union of any two sets in the family is…

组合数学 · 数学 2024-05-31 Kengbo Lu , Abigail Raz

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

组合数学 · 数学 2011-06-03 Igor Balla

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

组合数学 · 数学 2017-04-25 Abigail Raz

Our aim in this note is to show that, for any $\epsilon>0$, there exists a union-closed family $\mathcal F$ with (unique) smallest set $S$ such that no element of $S$ belongs to more than a fraction $\epsilon$ of the sets in $\mathcal F$.…

组合数学 · 数学 2023-01-24 David Ellis , Maria-Romina Ivan , Imre Leader

A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…

组合数学 · 数学 2012-10-16 Emanuele Rodaro

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

组合数学 · 数学 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…

最优化与控制 · 数学 2026-04-14 Jannis Halbey , Daniel Deza , Max Zimmer , Christophe Roux , Bartolomeo Stellato , Sebastian Pokutta

The union-closed sets conjecture states 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 $1/2$ of the sets of $\mathcal{F}$. Using the…

组合数学 · 数学 2023-05-24 Lei Yu

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

组合数学 · 数学 2022-11-24 Luke Pebody

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

组合数学 · 数学 2015-08-26 Jens Maßberg

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

组合数学 · 数学 2022-11-29 Justin Gilmer

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

组合数学 · 数学 2023-06-21 Will Sawin

A set system is called union closed if for any two sets in the set system their union is also in the set system. Gilmer recently proved that in any union closed set system some element belongs to at least a $0.01$ fraction of sets, and…

组合数学 · 数学 2022-11-22 Zachary Chase , Shachar Lovett

Let $w$ be a permutation of $\{1,2,\ldots,n \}$, and let $D(w)$ be the Rothe diagram of $w$. The Schubert polynomial $\mathfrak{S}_w(x)$ can be realized as the dual character of the flagged Weyl module associated to $D(w)$. This implies a…

组合数学 · 数学 2020-08-18 Neil J. Y. Fan , Peter L. Guo

In this paper, we study the minimality of the boundary of a Coxeter system. We show that for a Coxeter system $(W,S)$ if there exist a maximal spherical subset $T$ of $S$ and an element $s_0\in S$ such that $m(s_0,t)\ge 3$ for each $t\in T$…

群论 · 数学 2007-05-23 Tetsuya Hosaka

In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider…

概率论 · 数学 2012-06-08 Omer Angel , Abraham D. Flaxman , David B. Wilson

We verify an explicit inequality conjectured recently by Gilmer, thus proving that for any nonempty union-closed family $F \subseteq 2^{[n]}$, some $i\in [n]$ is contained in at least a $\frac{3-\sqrt{5}}{2} \approx 0.38$ fraction of the…

组合数学 · 数学 2024-07-09 Ryan Alweiss , Brice Huang , Mark Sellke

Let $\Omega$ be a smooth bounded domain in $\mahbb R^N$ with $N\ge 3$ and let $\Sigma_k$ be a closed smooth submanifold of $\delta \Omega$ of dimension $1\le k\le N-2$. In this paper we study the weighted Hardy inequality with weight…

偏微分方程分析 · 数学 2012-10-01 Mouhamed Moustapha Fall , Fethi Mahmoudi

In this article, we study the summatory function \begin{equation*} W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}, \end{equation*} where $\Omega(n)$ counts the number of prime factors of $n$, with multiplicity. We prove $W(x)=O(x)$, and in particular,…

数论 · 数学 2024-09-10 Daniel R. Johnston , Nicol Leong , Sebastian Tudzi

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

经典分析与常微分方程 · 数学 2014-08-12 Tuomas Orponen
‹ 上一页 1 2 3 10 下一页 ›