Coordinate sum and difference sets of d-dimensional modular hyperbolas

MaRDI QIDQ2855609zbMATH OpenFDO

Authors Amanda Bower, Victor Luo, Steven J. Miller, Ron Evans

Publication date 25 October 2013

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.2930, http://www.emis.de/journals/INTEGERS/papers/n31/n31.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

modular hyperbolasum-dominant set

Mathematics Subject Classification ID

Geometry of numbers (11H99) Additive number theory; partitions (11P99) Other character sums and Gauss sums (11T24)

Abstract: Many problems in additive number theory, such as Fermat's last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set $AsubsetmathbbZ$ is considered sum-dominant if $|A+A|>|A-A|$. If we consider all subsets of $0,1,\mathrm{...},n-1$, as $noinfty$ it is natural to expect that almost all subsets should be difference-dominant, as addition is commutative but subtraction is not; however, Martin and O'Bryant in 2007 proved that a positive percentage are sum-dominant as $noinfty$. This motivates the study of "coordinate sum dominance". Given $$, we call $S:=x+y:(x,y)inV$ a coordinate sumset and $D:=x-y:(x,y)inV$ a coordinate difference set, and we say $V$ is coordinate sum dominant if $|S|>|D|$. An arithmetically interesting choice of $V$ is $$, which is the reduction modulo $n$ of the modular hyperbola $$. In 2009, Eichhorn, Khan, Stein, and Yankov determined the sizes of $S$ and $D$ for $$ and investigated conditions for coordinate sum dominance. We extend their results to reduced $d$-dimensional modular hyperbolas $$ with $a$ coprime to $n$.

Review text

The authors of the present paper investigate subsets of modular hyperbolas that are sum- or difference-dominant. In particular, they estimate the sum- to difference-dominance ratio.NEWLINENEWLINELet \(d\) be a positive integer. The \(d\)-dimensional modular hyperbola \(H_d(a,n)\) is defined by NEWLINE\[NEWLINEH_d(a;n):=\{(x_1,\ldots,x_d)\in\{1,\ldots,n-1\}^d: x_1\cdots x_d\equiv a\pmod n\},NEWLINE\]NEWLINE where \((a,n)=1\). Furthermore let \(\overline{S}_d(m;a;n)\) be the generalized signed sumset, i.e., NEWLINE\[NEWLINE\overline{S}_d(m;a;n)=\{x_1+\cdots+x_m-\cdots-x_d\pmod n: (x_1,\ldots,x_d)\in H_d(a;n)\},NEWLINE\]NEWLINE where \(m\) is the number of plus signs. The sumset to difference sets ratio \(c_2(a;n)\) is defined by NEWLINE\[NEWLINEc_2(a;n)=\#\overline{S}_2(2;a;n)/\#\overline{S}_2(1;a;n).NEWLINE\]NEWLINENEWLINENEWLINEAmong other results they show for the \(2\)-dimensional case that if \(N_k=\prod_{i=1}^kp_i\), where \(p_i\) is the \(i\){th} prime that is congruent to \(3\pmod 4\), and \(a\) is a fixed perfect square relatively prime to all the \(p_i\), then NEWLINE\[NEWLINEc_2(a;N_k)\asymp\log\log N_k,NEWLINE\]NEWLINE and for any \(t\geq2\), NEWLINE\[NEWLINEc_2(a;N_k^t)\asymp(\log\log N_k)^{-1}.NEWLINE\]NEWLINE For the case of higher dimension (\(d>2\)) they show that \(\#\overline{S}_d(m;a;n)=n\) whenever all prime factors of \(n\) exceed \(7\).

Recommendations

• Sums and Differences of the Coordinates of Points on Modular Hyperbolas
• Modular Hyperbolas and the Coefficients of (x –1 + 6 + x) k
• On the distribution of points on multidimensional modular hyperbolas.
• On the number of distances between the coordinates of points on modular hyperbolas
• Modular hyperbolas

Cited in

(3)

• Generalizing the distribution of missing sums in sumsets
• Modular Hyperbolas and the Coefficients of (x –1 + 6 + x) k
• Distribution of Missing Differences in Diffsets

This page was built for publication: Coordinate sum and difference sets of \(d\)-dimensional modular hyperbolas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855609)