English
Related papers

Related papers: A note on cube-free problems

200 papers

In the Boolean lattice, Sperner's, Erd\H{o}s's, Kleitman's and Samotij's theorems state that families that do not contain many chains must have a very specific layered structure. We show that if instead of $\mathbb{Z}_2^n$ we work in…

Combinatorics · Mathematics 2018-10-03 Jason Long , Adam Zsolt Wagner

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any $C >0$ and $n$ large enough that $A$ contains a sum-free subset of size at least $n/3 +C$. We study this problem and find an alternate proof of Bourgain's result…

Number Theory · Mathematics 2022-07-29 George Shakan

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

Combinatorics · Mathematics 2025-06-24 Zichao Dong , Zijian Xu

We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…

Combinatorics · Mathematics 2026-05-06 Alexandre Bailleul , Robin Riblet

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

Combinatorics · Mathematics 2014-02-26 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Maria Axenovich , John Goldwasser

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

Combinatorics · Mathematics 2020-07-15 Dániel Gerbner , Dániel Nagy , Balázs Patkós , Máté Vizer

A collection of $k$ sets is said to form a $k$-sunflower, or $\Delta$-system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal{F}$ sunflower-free if it contains no sunflowers.…

Combinatorics · Mathematics 2023-03-13 Eric Naslund , William F. Sawin

A Hilbert cube of dimension $d$ is the set of integers \[ H(a_{0}; a_{1}, \ldots, a_{d})=a_{0}+\{0, a_{1}\}+\cdots+\{0, a_{d}\}=\left\{a_{0}+\sum_{i=1}^{d}\varepsilon_{i}a_{i}:\;\varepsilon_{i}\in\{0,1\}\right\}. \] Brown, Erd\H{o}s and…

Number Theory · Mathematics 2026-04-08 Andrew Bremner , Christian Elsholtz , Maciej Ulas

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Group Theory · Mathematics 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

In Ellenberg and Gijswijt's groundbreaking work, the authors show that a subset of $\mathbb{Z}_3^{n}$ with no arithmetic progression of length 3 must be of size at most $2.755^n$ (no prior upper bound was known of $(3-\epsilon)^n)$), and…

Combinatorics · Mathematics 2018-07-06 Luke Pebody

Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1<a_2<\ldots<a_k\] has no solution with $a_1,a_2,\ldots,a_k\in {A}$ and integer $x$. Erd\H{o}s, S\'ark\"ozy and T. S\'os…

Let $3\le d\le k$ and $\nu\ge 0$ be fixed and $\mathcal{F}\subset\binom{[n]}{k}$. The matching number of $\mathcal{F}$, denoted by $\nu(\mathcal{F})$, is the maximum number of pairwise disjoint sets in $\mathcal{F}$, and $\mathcal{F}$ is…

Combinatorics · Mathematics 2019-11-11 Xizhi Liu

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Computational Geometry · Computer Science 2017-11-16 Jakub Sosnovec

The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is…

Combinatorics · Mathematics 2020-11-17 Pablo Candela , Diego González-Sánchez , David J. Grynkiewicz

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

Combinatorics · Mathematics 2026-01-14 Andrew Suk , Ji Zeng

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

History and Overview · Mathematics 2019-12-19 Onno M. Cain

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie
‹ Prev 1 2 3 10 Next ›