English
Related papers

Related papers: A note on the Erd\H{o}s distinct subset sums probl…

200 papers

Let $R_s(n)$ denote the number of representations of the positive number $n$ as the sum of two squares and $s$ biquadrates. When $s=3$ or $4$, it is established that the anticipated asymptotic formula for $R_s(n)$ holds for all $n\le X$…

Number Theory · Mathematics 2014-02-14 Lilu Zhao

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Combinatorics · Mathematics 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu

We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-R\'{e}nyi model, where it settles a conjecture of Hajek [IEEE…

Probability · Mathematics 2016-01-08 Venkat Anantharam , Justin Salez

Let A be an asymptotic basis for N_0 of some order. By an essentiality of A one means a subset P such that A\P is no longer an asymptotic basis of any order and such that P is minimal among all subsets of A with this property. A finite…

Number Theory · Mathematics 2008-04-15 Peter Hegarty

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

Combinatorics · Mathematics 2023-10-19 Jürgen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Erd\H{o}s asked for the largest size $f(n)$ of a subset of $\{1,\dots,n\}$ with no element dividing two others. We show that $f(n)=c_2\,n+o(n)$ for an effectively computable constant $c_2$, and moreover that the number $q(n)$ of such…

Combinatorics · Mathematics 2026-04-21 Damek Davis

Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…

Combinatorics · Mathematics 2020-06-30 Lisa Sauermann

We show that if $A\subset \mathbb{Z}$ is a finite set of integers in which every integer is divisible by $O(1)$ many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lvert A\rvert^{12/7-o(1)}\] and, for any $m\geq 2$,…

Number Theory · Mathematics 2026-01-07 Rishika Agrawal , Thomas F. Bloom , Giorgis Petridis

Let $R$ be a finite commutative unitary ring. An idempotent in $R$ is an element $e\in R$ with $e^2=e$. The Erd\H{o}s-Burgess constant associated with the ring $R$ is the smallest positive integer $\ell$ such that for any given $\ell$…

Combinatorics · Mathematics 2020-05-12 Guoqing Wang

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Dynamical Systems · Mathematics 2026-01-21 Ioannis Kousek

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Classical Analysis and ODEs · Mathematics 2024-06-17 Paige Bright , Caleb Marshall

In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…

Probability · Mathematics 2022-05-18 L. Bayón , P. Fortuny , J. M. Grau , A. M. Oller-Marcén , M. M. Ruiz

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Metric Geometry · Mathematics 2023-03-07 Alexander Barg , Peter Boyvalenkov , Maya Stoyanova

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

Number Theory · Mathematics 2018-10-08 Jagannath Bhanja , Ram Krishna Pandey

In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain partitions of order-type homogeneous sets and use a…

Combinatorics · Mathematics 2016-06-09 Natalia García-Colín , Miguel Raggi , Edgardo Roldán-Pensado

We derive the local and central limit theorems for the Stirling numbers of the second kind by elementary means, obtaining as corollaries effective asymptotic estimates for the Bell numbers and for the moments of the distribution. We also…

Combinatorics · Mathematics 2026-05-29 Hsien-Kuei Hwang , Chong-Yi Li , Vytas Zacharovas

Let $Q_n$ be the $n$-dimensional Hamming cube and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically \[2n2^{N/4},\] as was conjectured by Ilinca and the first author in connection with a question of…

Combinatorics · Mathematics 2019-09-12 Jeff Kahn , Jinyoung Park

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

Algebraic Geometry · Mathematics 2007-05-23 Alexey Glutsyuk

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

Probability · Mathematics 2020-12-07 Hugh Entwistle , Christopher Lustri , Georgy Sofronov