English
Related papers

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

200 papers

Given a finite group $G$ and a prime $p$, let $\mathcal{A}_p(G)$ be the poset of nontrivial elementary abelian $p$-subgroups of $G$. The group $G$ satisfies the Quillen dimension property at $p$ if $\mathcal{A}_p(G)$ has non-zero homology…

Group Theory · Mathematics 2024-06-19 Kevin Ivan Piterman

For $h \ge 2$ and an infinite set of positive integers $A$, let $R_{A,h}(n)$ denote the number of solutions of the equation $a_{1} + a_{2} + \dots{} + a_{h} = n, a_{1} \in A, \dots{} ,a_{h} \in A, a_{1} < a_{2} < \dots{} < a_{h}.$ In this…

Number Theory · Mathematics 2020-06-05 Sandor Kiss , Csaba Sandor

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

Metric Geometry · Mathematics 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang

In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of a generalized Sidon set in the first $N$ natural numbers and the optimal constant in an ``analogous'' problem concerning…

Combinatorics · Mathematics 2020-04-15 Noah Kravitz

The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is…

Combinatorics · Mathematics 2020-11-17 Pablo Candela , Diego González-Sánchez , David J. Grynkiewicz

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

Combinatorics · Mathematics 2021-05-04 Peter Frankl , Jian Wang

The Golomb-Welch conjecture states that there are no perfect $e$-error-correcting Lee codes in $\mathbb{Z}^n$ ($PL(n,e)$-codes) whenever $n\geq 3$ and $e\geq 2$. A special case of this conjecture is when $e=2$. In a recent paper of A.…

Information Theory · Computer Science 2018-04-26 Claudio Qureshi

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…

Information Theory · Computer Science 2017-05-19 Ron M. Roth , Netanel Raviv , Itzhak Tamo

The following strengthening of the Elton-Odell theorem on the existence of a $(1+\epsilon)-$separated sequences in the unit sphere $S_X$ of an infinite dimensional Banach space $X$ is proved: There exists an infinite subset $S\subseteq S_X$…

Functional Analysis · Mathematics 2019-02-19 Eftychios Glakousakis , Sophocles Mercourakis

Inspired by Cohen and te Riele~\cite{Cohen1996}, who computationally verified that for every $n \leq 400$ there exists $k$ such that $\sigma^k(n) \equiv 0 \pmod{n}$ (where $\sigma^k$ denotes the $k$-fold iteration of the sum-of-divisors…

Number Theory · Mathematics 2025-12-29 Zeraoulia Rafik , Pedro Caceres

We prove that if $A$ is an infinite multiplicative Sidon set, then $\liminf\limits_{n\to \infty}\frac{|A(n)|-\pi (n)}{\frac{n^{3/4}}{(\log n)^3}}<\infty$ and construct an infinite multiplicative Sidon set satisfying $\liminf\limits_{n\to…

Number Theory · Mathematics 2017-09-13 Péter Pál Pach , Csaba Sándor

We answer several questions of Erd\H{o}s regarding sequences of natural numbers $A$ whose translates $n+A$ intersect with the squarefree numbers in various specified ways. For instance, we show that if every translate only contains finitely…

Number Theory · Mathematics 2025-12-09 Wouter van Doorn , Terence Tao

The $\mathcal{N}$ poset consists of four distinct sets $W,X,Y,Z$ such that $W\subset X$, $Y\subset X$, and $Y\subset Z$ where $W$ is not necessarily a subset of $Z$. A family $\mathcal{F}$ as a subposet of the $n$-dimensional Boolean…

Combinatorics · Mathematics 2017-04-18 Ryan R. Martin , Shanise Walker

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

We consider the volume of the largest axis-parallel box in the $d$-dimensional torus that contains no point of a given point set $\mathcal{P}_n$ with $n$ elements. We prove that, for all natural numbers $d, n$ and every point set…

Computational Complexity · Computer Science 2019-08-15 Mario Ullrich

Let $\ell$ and $m$ be positive integers with $\ell \leq m$, and let $\mathcal{A} = (A_1, \ldots, A_m)$ be a finite sequence of finite subsets of a group $G$ (not necessarily abelian), written multiplicatively. The {\it generalized product…

Combinatorics · Mathematics 2026-02-24 Raj Kumar Mistri , Nitesh Prajapati

For a given fixed poset $\mathcal P$ we say that a family of subsets of $[n]$ is $\mathcal P$-saturated if it does not contain an induced copy of $\mathcal P$, but whenever we add to it a new set, an induced copy of $\mathcal P$ is formed.…

Combinatorics · Mathematics 2025-04-01 Maria-Romina Ivan

The commutative subgroup width of a group $G$ is the smallest $k$ such that there are abelian subgroups $A_0,A_1,\ldots,A_{k-1}\leq G$ with $G=A_0A_1\cdots A_{k-1}$. Commutative (inverse) submonoid width is defined analogously. In 2002,…

Group Theory · Mathematics 2026-05-15 Luna Elliott , Alex Levine

G. Moreno's abstract depiction of the Sedenions' normed zero-divisors, as homomorphic to the exceptional Lie group G2, is fleshed out by exploring further structures the A-D-E approach of Lie algebraic taxonomy keeps hidden. A breakdown of…

General Mathematics · Mathematics 2007-05-23 Robert P. C. de Marrais

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

Combinatorics · Mathematics 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou