English
Related papers

Related papers: One conjecture about size of Sidon sets

200 papers

We prove some new bounds for the size of the maximal dissociated subset of structured (having small sumset, large energy and so on) subsets A of an abelian group.

Combinatorics · Mathematics 2015-12-30 Tomasz Schoen , Ilya D. Shkredov

Let $\mathcal{P}(n)$ denote the power set of $[n]$, ordered by inclusion, and let $\mathcal{P}(n,p)$ be obtained from $\mathcal{P}(n)$ by selecting elements from $\mathcal{P}(n)$ independently at random with probability $p$. A classical…

Combinatorics · Mathematics 2014-10-06 József Balogh , Richard Mycroft , Andrew Treglown

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Number Theory · Mathematics 2018-08-20 Apoloniusz Tyszka

We show that there are at most $O_{n,\epsilon}(H^{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973…

Number Theory · Mathematics 2014-02-26 Rainer Dietmann

We study the asymptotics of the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$ as $d$ tends to infinity. Assuming some conjectures on the sparsity of newforms of weight $2$…

Number Theory · Mathematics 2025-05-21 Maarten Derickx , Michael Stoll

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

Combinatorics · Mathematics 2016-02-09 Michael S. Payne , David R. Wood

Let n be a nonzero integer and assume that a set S of positive integers has the property that xy+n is a perfect square whenever x and y are distinct elements of S. In this paper we find some upper bounds for the size of the set S. We prove…

Number Theory · Mathematics 2021-08-30 Andrej Dujella

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…

Combinatorics · Mathematics 2013-05-06 Christine Bachoc , Imre Z. Ruzsa , Mate Matolcsi

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

The ratio of volume to crossing number of a hyperbolic knot is known to be bounded above by the volume of a regular ideal octahedron, and a similar bound is conjectured for the knot determinant per crossing. We investigate a natural…

Geometric Topology · Mathematics 2018-11-16 Abhijit Champanerkar , Ilya Kofman , Jessica S. Purcell

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection $C$ of all of them, and $|C|$ is smaller than each of the sets. A longstanding conjecture due to Erd\H{o}s and…

Combinatorics · Mathematics 2025-01-29 Dhruv Mubayi , Lujia Wang

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and…

Number Theory · Mathematics 2023-02-24 Jacques Benatar , Alon Nishry

We prove the endomorphism conjecture for graded posets whose largest Whitney number is at most 4. In particular, this implies the endomorphism conjecture is true for graded posets of width at most 4.

Combinatorics · Mathematics 2023-06-02 Miklós Bóna , Ryan R. Martin

Let $P_n$ be a Sylow $p$-subgroup of the symmetric group $S_n$. We investigate the number and sizes of the $P_n\setminus S_n\ /\ P_n$ double cosets, showing that most double cosets have maximal size when $p$ is odd, or equivalently, that…

Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…

Group Theory · Mathematics 2017-12-15 Minh Nguyen

In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main…

Number Theory · Mathematics 2026-04-13 Seoyoung Kim , Chi Hoi Yip , Semin Yoo

This chapter investigates the properties of (linear) codes in $ A_n $ lattices, the practical motivation for which is found in several communication scenarios, such as asymmetric channels, sticky-insertion channels, bit-shift channels, and…

Combinatorics · Mathematics 2019-11-18 Mladen Kovačević

What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain…

Combinatorics · Mathematics 2026-04-09 Maria-Romina Ivan , Sean Jaffe

We report new examples of Sidon sets in abelian groups arising from algebraic geometry.

Combinatorics · Mathematics 2023-02-01 Arthur Forey , Emmanuel Kowalski

A $ B_h $ set (or Sidon set of order $ h $) in an Abelian group $ G $ is any subset $ \{b_0, b_1, \ldots,b_{n}\} $ of $ G $ with the property that all the sums $ b_{i_1} + \cdots + b_{i_h} $ are different up to the order of the summands.…

Combinatorics · Mathematics 2020-08-13 Mladen Kovačević , Vincent Y. F. Tan