English
Related papers

Related papers: Size-4 Counterexamples to the Sidon-Extension Conj…

200 papers

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ć

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…

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…

Number Theory · Mathematics 2015-10-26 Yufei Zhao

We present a complete computational tabulation of all 961,619,972 P-positions in 4xn Chomp for n <= 3000, obtained via a new O(n^4) shadow-array sieve that replaces the O(n^5) hash-set approach of prior work. Three structural results are…

General Mathematics · Mathematics 2026-05-22 Arnav Garg

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

We prove that for any $\epsilon>0$ and any trigonometric polynomial $f$ with frequencies in the set $\{n^3: N \leq n\leq N+N^{2/3-\epsilon}\}$, one has $$ \|f\|_4 \ll \epsilon^{-1/4}\|f\|_2 $$ with implied constant being absolute. We also…

Classical Analysis and ODEs · Mathematics 2024-03-12 Mikhail R. Gabdullin , Sergei V. Konyagin

In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…

Classical Analysis and ODEs · Mathematics 2007-05-23 Nets Hawk Katz , Terence Tao

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

A subset $E$ of a discrete abelian group is called $\epsilon $-Kronecker if all $E$-functions of modulus one can be approximated to within $\epsilon$ by characters. $E$ is called a Sidon set if all bounded $E$-functions can be interpolated…

Classical Analysis and ODEs · Mathematics 2016-01-27 Kathryn Hare , L. Thomas Ramsey

We investigate the relationship between the sizes of the sum and difference sets of the Dicyclic Group $\mathrm{Dic}_{4n}$. We first determine the exact numbers of MSTD (more sums than differences), MDTS (more differences than sums), and…

General Mathematics · Mathematics 2026-02-11 Sagar Mandal , Neetu

In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…

Number Theory · Mathematics 2025-05-29 Alexander Kalmynin

A set of integers $A$ is non-averaging if there is no element $a$ in $A$ which can be written as an average of a subset of $A$ not containing $a$. We show that the largest non-averaging subset of $\{1, \ldots, n\}$ has size $n^{1/4+o(1)}$,…

Combinatorics · Mathematics 2025-09-11 Huy Tuan Pham , Dmitrii Zakharov

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss

Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos-Ko-Rado from 1961 says that any such system has size at most ${n-1 \choose k-1}$. A natural question, which…

Combinatorics · Mathematics 2013-05-30 Shagnik Das , Wenying Gan , Benny Sudakov

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…

Rings and Algebras · Mathematics 2025-05-19 M. A. Khrystik

The classical Aronszajn-Donoghue theorem states that for a rank one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As…

Functional Analysis · Mathematics 2022-05-20 Constanze Liaw , Sergei Treil , Alexander Volberg

Denniston constructed partial difference sets (PDSs) with the parameters $(2^{3m}, (2^{m+r} - 2^m + 2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m \geq 2,…

Combinatorics · Mathematics 2024-10-08 James A. Davis , Sophie Huczynska , Laura Johnson , John Polhill

Let $f$ be a nonnegative function supported on $(-1/4, 1/4)$. We show $$ \sup_{x \in \mathbb{R}}{\int_{\mathbb{R}}{f(t)f(x-t)dt}} \geq 1.28\left(\int_{-1/4}^{1/4}{f(x)dx} \right)^2,$$ where 1.28 improves on a series of earlier results. The…

Combinatorics · Mathematics 2016-04-26 Alexander Cloninger , Stefan Steinerberger

For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k…

Combinatorics · Mathematics 2008-02-24 Boris Bukh

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

Combinatorics · Mathematics 2025-07-11 Jeck Lim , Jiaxi Nie , Ji Zeng