English
Related papers

Related papers: Sharp Bounds for Sets with Distinct Subset Product…

200 papers

We find nearly the optimal size of a set $A\subset [N] := \{1,...,N\}$ so that the product set $AA$ satisfies either (i) $|AA| \sim |A|^2/2$ or (ii) $|AA| \sim |[N][N]|$. This settles problems raised in a recent article of Cilleruelo,…

Number Theory · Mathematics 2019-10-22 Kevin Ford

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

Combinatorics · Mathematics 2019-03-26 Alex Iosevich , Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

We explore variants of Erd\H os' unit distance problem concerning dot products between successive pairs of points chosen from a large finite subset of either $\mathbb F_q^d$ or $\mathbb Z_q^d,$ where $q$ is a power of an odd prime.…

Combinatorics · Mathematics 2021-09-22 Vincent Blevins , David Crosby , Ethan Lynch , Steven Senger

Let $\mathcal{A}=\{A_{1},...,A_{p}\}$ and $\mathcal{B}=\{B_{1},...,B_{q}\}$ be two families of subsets of $[n]$ such that for every $i\in [p]$ and $j\in [q]$, $|A_{i}\cap B_{j}|= \frac{c}{d}|B_{j}|$, where $\frac{c}{d}\in [0,1]$ is an…

Combinatorics · Mathematics 2019-03-06 Rogers Mathew , Ritabrata Ray , Shashank Srivastava

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

Number Theory · Mathematics 2007-07-31 Tomohiro Yamada

A Borel set $B \subset \mathbb{R}^{n}$ is visible from $x \in \mathbb{R}^{n}$, if the radial projection of $B$ with base point $x$ has positive $\mathcal{H}^{n - 1}$ measure. I prove that if $\dim B > n - 1$, then $B$ is visible from every…

Classical Analysis and ODEs · Mathematics 2017-11-15 Tuomas Orponen

We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can…

Number Theory · Mathematics 2016-11-22 Ilya D. Shkredov , Dmitrii Zhelezov

Let $A, B\subseteq \mathbb{R}^2$ be finite, nonempty subsets, let $s\geq 2$ be an integer, and let $h_1(A,B)$ denote the minimal number $t$ such that there exist $2t$ (not necessarily distinct) parallel lines,…

Combinatorics · Mathematics 2007-10-17 David J. Grynkiewicz , Oriol Serra

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

Number Theory · Mathematics 2010-05-06 Zhi-Wei Sun

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

Combinatorics · Mathematics 2018-12-27 Sara Fish , Ben Lund , Adam Sheffer

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

Number Theory · Mathematics 2012-05-22 James Maynard

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

Number Theory · Mathematics 2013-01-08 William D. Banks , Greg Martin

We prove the following variant of Marstrand's theorem about projections of cartesian products of sets: Consider the space $\Lambda_m=\set{(t,O), t\in\R, O\in SO(m)}$ with the natural measure and set…

Classical Analysis and ODEs · Mathematics 2011-06-30 Jorge Erick López Velázquez , Carlos Gustavo Moreira

We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…

Combinatorics · Mathematics 2018-12-27 Matthew Hase-Liu , Adam Sheffer

Let $A_1, \ldots ,A_m$ and $B_1, \ldots ,B_m$ be subsets of $[n]$ and let $t$ be a non-negative integer with the following property: $|A_i \cap B_i|\leq t$ for each $i$ and $|A_i\cap B_j|>t$ whenever $i< j$. Then $m\leq 2^{n-t}$. Our proof…

Combinatorics · Mathematics 2023-05-24 Gábor Hegedüs

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound…

Number Theory · Mathematics 2015-02-13 Dmitry Zhelezov

In this note, we evaluate a series for $1/\pi$ conjectured by Sun. Our proof uses the Cauchy product and hypergeometric transformations. From this result, we derive two additional analogous series for $1/\pi$ involving polynomials of degree…

Number Theory · Mathematics 2026-04-14 Roman Le Lan

It is proved that for any two subsets $A$ and $B$ of an arbitrary finite field $\Fq$ such that $|A||B|>q$ the identity $16AB=\Fq$ holds. Moreover, it is established that for every subsets $X, Y\subset \Fq$ with the property $|X||Y|\geqslant…

Number Theory · Mathematics 2008-01-15 Alexey Glibichuk

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

Combinatorics · Mathematics 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets…

Combinatorics · Mathematics 2016-09-06 Ohad Noy Feldheim , Yinon Spinka
‹ Prev 1 3 4 5 6 7 10 Next ›