English
Related papers

Related papers: Product representation of perfect cubes

200 papers

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

Combinatorics · Mathematics 2020-08-10 Jacob Fox , Cosmin Pohoata

Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…

Combinatorics · Mathematics 2016-11-03 Orit E. Raz , Micha Sharir , Frank de Zeeuw

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

Combinatorics · Mathematics 2021-06-21 Griffin Johnston , Michael Tait , Craig Timmons

Let $\mathcal{Q}_n$ be the $n$-dimensional hypercube: the graph with vertex set $\{0,1\}^n$ and edges between vertices that differ in exactly one coordinate. For $1\leq d\leq n$ and $F\subseteq \{0,1\}^d$ we say that $S\subseteq \{0,1\}^n$…

Combinatorics · Mathematics 2009-07-16 J. Robert Johnson , John Talbot

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

Combinatorics · Mathematics 2022-06-22 Polona Durcik , Mario Stipčić

Let $V\subset \mathbb{F}_q^d$ be a \textit{regular} variety, $k\ge 3$ is an integer and $A\subseteq V$. Covert, Koh, and Pi (2017) proved the following generalization of the Erd\H{o}s-Falconer distance problem: If $|A|\gg…

Number Theory · Mathematics 2021-09-29 Minh Quy Pham

We study the intersection statistics of affine subspaces in the hypercube $\mathbb{F}_2^n$, motivated by recent work of Alon, Axenovich, and Goldwasser on the intersection statistics of axis-aligned subcubes of an $n$-dimensional cube. Let…

Combinatorics · Mathematics 2026-04-16 Zixuan Xu

We determine the largest subset $A\subseteq \{1,\dotsc,n\}$ such that for all $a,b\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers. This resolves a…

Combinatorics · Mathematics 2025-07-04 Boris Alexeev , Dustin G. Mixon , Will Sawin

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

Combinatorics · Mathematics 2014-03-03 Kaushik Majumder

We establish dimensional thresholds for dot product sets associated with compact subsets of translated paraboloids. Specifically, we prove that when the dimension of such a subset exceeds $ \frac{5}{4} = \frac{3}{2} - \frac{1}{4} $ in…

Combinatorics · Mathematics 2025-09-16 Chun-Kai Tseng

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Combinatorics · Mathematics 2024-02-06 Oliver Janzer , Benny Sudakov

In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is $3864^2 = F_{36} + F_{12}$. In other words, they conjectured that the equation…

Number Theory · Mathematics 2023-02-17 Ingrid Vukusic , Volker Ziegler

In this paper, we prove that the bound \[ \max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}-o(1)} \] holds for all $A \subset \mathbb R$, and for all convex functions $f$ which satisfy an additional technical condition.…

Combinatorics · Mathematics 2023-04-04 Oliver Roche-Newton

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

Combinatorics · Mathematics 2022-09-13 John Goldwasser , Ryan Hansen

We study optimal dimensionless inequalities $$ \|f\|_{U^k} \leq \|f\|_{\ell^{p_{k,n}}} $$ that hold for all functions $f\colon\mathbb{Z}^d\to\mathbb{C}$ supported in $\{0,1,\ldots,n-1\}^d$ and estimates $$ \|1_A\|_{U^k}^{2^k}\leq…

Combinatorics · Mathematics 2025-06-18 Adrian Beker , Tonći Crmarić , Vjekoslav Kovač
‹ Prev 1 3 4 5 6 7 10 Next ›