中文
相关论文

相关论文: A Proof of Talagrand's Creating Large Sets Conject…

200 篇论文

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…

离散数学 · 计算机科学 2012-07-17 Filip Marić , Miodrag Živković , Bojan Vučković

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

组合数学 · 数学 2009-11-02 Donald M. Davis

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

数论 · 数学 2023-12-14 Robert J. Lemke Oliver

We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1,…

组合数学 · 数学 2026-01-29 Jiangdong Ai , Ming Chen , Seokbeom Kim , Hyunwoo Lee

The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…

综合数学 · 数学 2023-03-13 Giulio Morpurgo

It was recently proven that, in contrast to their matrix analogues, the moments of a real Gaussian tensor of size N do not in general factorize over their connected components in the asymptotic large N limit. While the original proof of…

数学物理 · 物理学 2026-05-13 Sylvain Carrozza , Johann Chevrier , Luca Lionni

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…

组合数学 · 数学 2015-08-25 Zsolt Lángi , Márton Naszódi , János Pach , Gábor Tardos , Géza Tóth

We show that the spectral set conjecture by Fuglede holds in the setting of cyclic groups of order $p^n q$, where $p$, $q$ are distinct primes and $n\geq1$. This means that a subset $E$ of such a group $G$ tiles the group by translation…

经典分析与常微分方程 · 数学 2020-05-04 Romanos-Diogenes Malikiosis , Mihail N. Kolountzakis

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

逻辑 · 数学 2016-09-06 Apoloniusz Tyszka

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

代数几何 · 数学 2013-05-28 Eric Edo , Arno van den Essen

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…

计算机科学中的逻辑 · 计算机科学 2019-02-26 Filip Marić , Bojan Vučković , Miodrag Živković

K. Harada conjectured for any finite group $G$, the product of sizes of all conjugacy classes is divisible by the product of degrees of all irreducible characters. We study this conjecture when $G$ is the general linear group over a finite…

群论 · 数学 2024-11-19 Masahiro Sugimoto

We call a family G of subsets of [n] a k-generator of (\mathbb{P}[n]) if every (x \subset [n]) can be expressed as a union of at most k disjoint sets in (\mathcal{G}). Frein, Leveque and Sebo conjectured that for any (n \geq k), such a…

组合数学 · 数学 2008-11-21 David Ellis

We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…

群论 · 数学 2025-08-04 Sean Eberhard , Brendan Murphy , László Pyber , Endre Szabó

A family of sets is intersecting if every pair of its members has an element in common. Such a family of sets is called a star if some element is in every set of the family. Given a graph $G$, let $\mu(G)$ denote the size of the smallest…

组合数学 · 数学 2025-06-10 Glenn Hurlbert

The families $\mathcal F_0,\ldots,\mathcal F_s$ of $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ are called cross-union if there is no choice of $F_0\in \mathcal F_0, \ldots, F_s\in \mathcal F_s$ such that $F_0\cup\ldots\cup F_s=[n]$. A…

组合数学 · 数学 2023-04-25 Stijn Cambie , Jaehoon Kim , Hong Liu , Tuan Tran

We present strong versions of Marstrand's projection theorems and other related theorems. For example, if E is a plane set of positive and finite s-dimensional Hausdorff measure, there is a set X of directions of Lebesgue measure 0, such…

度量几何 · 数学 2015-11-19 Kenneth Falconer , Pertti Mattila

We propose a counting dimension for subsets of Z and prove that, under certain conditions on two such subsets E and F, for Lebesgue almost every real \lambda\ the counting dimension of E+[\lambda F] is at least the minimum between 1 and the…

动力系统 · 数学 2020-04-21 Yuri Lima , Carlos Gustavo Moreira

A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of…

组合数学 · 数学 2012-10-09 David Ellis , Yuval Filmus , Ehud Friedgut

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

组合数学 · 数学 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof