中文
相关论文

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

200 篇论文

Let $2^{[n]}$ denote the power set of $[n]:=\{1,2,..., n\}$. A collection $\B\subset 2^{[n]}$ forms a $d$-dimensional {\em Boolean algebra} if there exist pairwise disjoint sets $X_0, X_1,..., X_d \subseteq [n]$, all non-empty with perhaps…

组合数学 · 数学 2013-07-15 Travis Johnston , Linyuan Lu , Kevin G. Milans

We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…

经典分析与常微分方程 · 数学 2011-03-01 Allison Lewko , Mark Lewko

In a series of papers, M.Talagrand, the second author and others investigated at length the properties and structure of pointwise compact sets of measurable functions. A number of problems, interesting in themselves and important for the…

逻辑 · 数学 2016-09-06 David H. Fremlin , Saharon Shelah

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

数论 · 数学 2011-07-15 Geoffrey Iyer , Oleg Lazarev , Steven J. Miller , Liyang Zhang

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

代数几何 · 数学 2011-11-10 J. Maurice Rojas

We prove the following conjecture of Furstenberg (1969): if $A,B\subset [0,1]$ are closed and invariant under $\times p \mod 1$ and $\times q \mod 1$, respectively, and if $\log p/\log q\notin \mathbb{Q}$, then for all real numbers $u$ and…

动力系统 · 数学 2019-02-08 Meng Wu

A conjecture due to Zassenhaus asserts that if $\ G$ is a finite group then any torsion unit in $\mathbb{Z}G$ is conjugate in $\mathbb{Q}G$ to an element of $\ G$. We present a weaker form of this conjecture for some infinite groups.

群论 · 数学 2012-10-09 S. O. Juriaans , A. De A. E Silva , A. C. Souza Filho

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

经典分析与常微分方程 · 数学 2017-08-18 Ben Krause , Pavel Zorin-Kranich

Let $N$ be a finite set and $\mathcal{F}$, an intersection-closed family of subsets. Frankl conjectured that there always exists an element in $N$ which is contained in at most half the number of sets in $\mathcal{F}$ unless $\mathcal{F}…

组合数学 · 数学 2025-01-08 Rainer Schrader

In the classical probability model, let $f(n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f(n)$ is equivalent to the problem of determining the maximum cardinality…

组合数学 · 数学 2024-05-07 Jiang Zhou

In his 1996 paper, Talagrand highlighted that the Law of Large Numbers (LLN) for independent random variables can be viewed as a geometric property of multidimensional product spaces. This phenomenon is known as the concentration of…

概率论 · 数学 2025-01-24 Haim Bar , Vladimir Pozdnyakov

We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…

In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subset of the given semigroup to countably many. In this paper,…

组合数学 · 数学 2025-02-11 Teng Zhang

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 consider finite $\beta$-ensembles $\mathcal X_{n,\beta}^{\mathbb F}$ with $n$ points on $\mathbb F$, where $\mathbb F$ denotes either the real line or the complex plane. Let $U$ be a bounded subset of $ \mathbb F$ such that $\partial U$…

概率论 · 数学 2026-05-19 Kartick Adhikari , Sitanath Majumder

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

数论 · 数学 2018-08-28 Gregory A. Freiman , Oriol Serra , Christoph Spiegel

In this paper, we introduce the notion of the universe, induced communities, and cells with their corresponding spots. Using this language, we formulate and prove the union close set conjecture by showing that for any finite universe…

综合数学 · 数学 2026-03-10 Theophilus Agama

In the additive topological group $(\mathbb{R},+)$ of real numbers, we construct families of sets for which elements are not measurable in the Lebesgue sense. The constructed families have algebraic structures of being semigroups (i.e.,…

泛函分析 · 数学 2024-08-13 Venuste Nyagahakwa , Gratien Haguma , Joseline Munyaneza

We prove that the conjecture made by Peter Frankl in the late 1970s is true. In other words for every finite union-closed family which contains a non?empty set, there is an element that belongs to at least half of its m

组合数学 · 数学 2024-05-08 Roberto Demontis

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

组合数学 · 数学 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov