中文
相关论文

相关论文: On Asymptotic Approximate Groups of Integers

200 篇论文

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

数论 · 数学 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

组合数学 · 数学 2025-05-27 Oleg Pikhurko , Oleg Verbitsky , Maksim Zhukovskii

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

组合数学 · 数学 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

It is known that the asymptotic density of states of a 2d CFT in an irreducible representation $\rho$ of a finite symmetry group $G$ is proportional to $(\dim\rho)^2$. We show how this statement can be generalized when the symmetry can be…

高能物理 - 理论 · 物理学 2023-05-02 Ying-Hsuan Lin , Masaki Okada , Sahand Seifnashri , Yuji Tachikawa

We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…

群论 · 数学 2015-05-18 Stanislav Safin

We prove an asymptotically tight lower bound on $|A+\lambda A|$ for $A\subset \mathbb{C}$ and algebraic integer $\lambda$. The proof combines strong version of Freiman's theorem, structural theorem on dense subsets of a hypercubic lattice…

组合数学 · 数学 2023-11-17 D. Krachun , F. Petrov

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

数论 · 数学 2020-12-15 Carlo Sanna , Emanuele Tron

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

数论 · 数学 2014-01-03 Emilio A. Lauret

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

数论 · 数学 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

数论 · 数学 2018-12-31 Carlos Esparza , Lukas Gehring

We use Nathanson's $g$-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets $S$ to problems in additive number theory. If $S$ consists of all powers of…

几何拓扑 · 数学 2019-01-21 Greg Bell , Austin Lawson , Neil Pritchard , Dan Yasaki

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

组合数学 · 数学 2007-05-23 Ben Green , Imre Z. Ruzsa

We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only…

数论 · 数学 2025-10-31 Dayoon Park , Robin Visser , Pavlo Yatsyna , Jongheun Yoon

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

组合数学 · 数学 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

Let $n,r,k,s$ be positive integers with $n,k\ge 2$. The generalized Ramsey number $R(n,r;k,s)$ is the smallest positive integer $p$ such that for every graph $G$ of order $p$, either $G$ contains a subgraph induced by $n$ vertices with at…

组合数学 · 数学 2014-11-06 Zhi-Hong Sun

Given a graph $H$, the maximal anti-Ramsey function $f(n,e,H)$ denotes the minimum integer $f$ for which there exists an $n$-vertex graph $G$ with at least $e$ edges admitting an edge-coloring with $f$ colors in which each copy of $H$ in…

组合数学 · 数学 2026-03-20 Matija Bucic , Kaizhe Chen , Jie Ma

A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…

经典分析与常微分方程 · 数学 2020-06-23 De-Jun FENG , Yu-Feng WU

For a set $A\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\in A\times A$ such that $a+a'=n$. The celebrated Erd\H{o}s-Tur\'{a}n conjecture says that, if $R_A(n)\ge 1$ for all…

数论 · 数学 2016-12-28 Csaba Sándor , Quan-Hui Yang

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

计算复杂性 · 计算机科学 2024-11-26 Matthias Christandl , Koen Hoeberechts , Harold Nieuwboer , Péter Vrana , Jeroen Zuiddam

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

组合数学 · 数学 2025-08-27 David Conlon , Jeck Lim