Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with respect to ternary multiplication -- is defined, and it turns out that there are very few 3-primes. They correspond to imaginary quadratic fields $\mathbb{Q}(\sqrt{-n})$, $n>0$, with odd discriminant and whose ring of integers admits unique factorization. We also describe how to determine representations of numbers as ternary products and related algorithms for usual primality testing and integer factorization.
We consider the ternary Goldbach problem with two prime variables of the form $k^2+m^2+1$ and find an asymptotic formula for the number of its solutions.
The main purpose of this paper is to give an explicit formula for the volumes of indefinite ternary lattices with square free discriminant. We also consider several examples of lattices, for which the fundamental domain is well-known and make sure the results obtained by our computation coincide with the known ones.
For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of reduced residues mod k.
A positive quadratic form is $(k,\ell)$-universal if it represents all the numbers $kx+\ell$ where $x$ is a non-negative integer, and almost $(k,\ell)$-universal if it represents all but finitely many of them. We prove that for any $k,\ell$ such that $k\nmid\ell$ there exists an almost $(k,\ell)$-universal diagonal ternary form. We also conjecture that there are only finitely many primes $p$ for which a $(p,\ell)$-universal diagonal ternary form exists (for any $\ell<p$) and we show the results of computer experiments that speak in favor of the conjecture.
We show that for every fixed $A>0$ and $θ>0$ there is a $\vartheta=\vartheta(A,θ)>0$ with the following property. Let $n$ be odd and sufficiently large, and let $Q_{1}=Q_{2}:=n^{\h}(\log n)^{-\vartheta}$ and $Q_{3}:=(\log n)^θ$. Then for all $q_{3}\leq Q_{3}$, all reduced residues $a_{3}$ mod $q_{3}$, almost all $q_{2}\leq Q_{2}$, all admissible residues $a_{2}$ mod $q_{2}$, almost all $q_{1}\leq Q_{1}$ and all admissible residues $a_{1}$ mod $q_{1}$, there exists a representation $n=p_{1}+p_{2}+p_{3}$ with primes $p_{i}\equiv a_{i} (q_{i})$, $i=1,2,3$.
G.L. Watson \cite{watson1, watson2} introduced a set of transformations, called Watson transformations by most recent authors, in his study of the arithmetic of integral quadratic forms. These transformations change an integral quadratic form to another integral quadratic form with a smaller discriminants, but preserve many arithmetic properties at the same time. In this paper, we study the change of class numbers of positive definite ternary integral quadratic formula along a sequence of Watson transformations, thus providing a new and effective way to compute the class number of positive def…
Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.
In this paper, we prove that the arithmetic automorphic periods for $GL_{n}$ over a CM field factorize through the infinite places. This generalizes a conjecture of Shimura in 1983, and is predicted by the Langlands correspondence between automorphic representations and motives.
We show that the exponent of distribution of the ternary divisor function $d_3$ in arithmetic progressions to prime moduli is at least 1/2+1/46, improving results of Heath-Brown and Friedlander--Iwaniec. Furthermore, when averaging over a fixed residue class, we prove that this exponent is increased to 1/2 +1/34.
Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd n\not\equiv 1 (6), Goldbach's ternary problem n=p_1+p_2+p_3 is solvable with primes p_1,p_2 in short intervals p_i \in [X_i,X_i+Y] with X_{i}^{θ_i}=Y, i=1,2, and θ_1,θ_2\geq 0.933 such that (p_1+2)(p_2+2) has at most 9 prime factors.
In [Tha15], we looked at two (`multiplicative' and `Carlitz-Drinfeld additive') analogs each, for the well-known basic congruences of Fermat and Wilson, in the case of polynomials over finite fields. When we look at them modulo higher powers of primes, i.e. at `supercongruences', we find interesting relations linking them together, as well as linking them with arithmetic derivatives and zeta values. In the current work, we expand on the first analog and connections with arithmetic derivatives more systematically, giving many more equivalent conditions linking the two, now using `mixed derivati…
We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers. For example, we observe that the primes of the form $4k+1$ tend to appear an even number of times in the prime factorization of a given integer, more so than for primes of the form $4k+3$. We are led to consider variants of Pólya's conjecture, supported by extensive numerical evidence, and its relation to other conjectures.
We summarize the known useful and interesting results and formulas we have discovered so far in this collaborative article summarizing results from two related articles by Merca and Schmidt arriving at related so-termed Lambert series factorization theorems. We unify the matrix representations that underlie two of our separate papers, and which commonly arise in identities involving partition functions and other functions generated by Lambert series. We provide a number of properties and conjectures related to the inverse matrix entries defined in Schmidt's article and the Euler partition func…
Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of integers and further extend it to arithmetic progressions in unique factorization domains of characteristic zero.
Michael HARRIS defined the arithmetic automorphic periods for certain cuspidal representations of $GL_{n}$ over quadratic imaginary fields in his Crelle paper 1997. He also showed that critical values of automorphic L-functions for $GL_{n}\times GL_{1}$ can be interpreted in terms of these arithmetic automorphic periods. In the thesis, we generalize his results in two ways. Firstly, the arithmetic automorphic periods have been defined over general CM fields. We also prove that these periods factorize as products of local periods over infinity places. Secondly, we show that critical values of a…
An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an application, in Section 2, we give an interesting characterization of Mersenne numbers.
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of random permutations into cycles, we give a simple but general formula for these variances in the large $q$ limit for arithmetic functions that depend only upon factorization structure. From this we derive new estimates, quickly recover some that are already known, and make new conjectures in the setting of the integers. In particular we make the combinatorial …
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
The arithmetic of ternary diagonal equation is considered for degree d >1, with the outcome that the set of coefficients for which the equation admits a non-zero integer solution is shown to have density zero.
We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest such $k$ is $2^m$.Moreover, we generalize this result to middle-$\frac 1α$ Cantor set for $1<α<2+\sqrt{5}$ and $m$ sufficiently large.For the naturally embedded image $W$ of the Cantor dust $C\times C$ into the complex plane $\mathbb{C}$, we prove that for any integer $m\ge 3$, every element in the closed unit disk in $\mathbb C$ can be written as the sum of at…
In this paper, we create a systematic and automatic procedure for transforming the integer factorization problem into the problem of solving a system of Boolean equations. Surprisingly, the resulting system of Boolean equations takes on a "life of its own" and becomes a new type of integer, which we call a generic integer. We then proceed to use the newly found algebraic structure of the ring of generic integers to create two new integer factoring algorithms, called respectively the Boolean factoring (BF) algorithm, and the multiplicative Boolean factoring (MBF) algorithm. Although these two a…
We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and Halter-Koch's 2006 monograph on the subject, to a non-commutative and non-cancellative setting, in the same spirit of Baeth and Smertnig's work on the factorization theory of non-commutative, but cancellative monoids [J. Algebra 441 (2015), 475-551]. Then, we bring in power monoids and, applying the abstract machinery developed in the first part, we undertake the study of their arithmetic. More in particular, let $H$ be a multiplicatively written monoid. The set $\mathcal P_…
In 1977, Strassen presented a deterministic and rigorous algorithm for solving the problem of computing the prime factorization of natural numbers $N$. His method is based on fast polynomial arithmetic techniques and runs in time $\widetilde{O}(N^{1/4})$, which has been state of the art for the last forty years. In this paper, we will combine Strassen's approach with a babystep-giantstep method to improve the currently best known bound by a superpolynomial factor. The runtime complexity of our algorithm is of the form \[ \widetilde{O}\left(N^{1/4}\exp(-C\log N/\log\log N)\right). \]
In this paper, we determine all primitive solutions to the equation $(x+r)^2 +(x+2r)^2 +\cdots +(x+dr)^2 = y^n$ for $2\leq d\leq 10$ and for $1\leq r\leq 10^4$. We make use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication when we compute 2P+Q from given points P, Q on the curve. We give applications to simultaneous multiple scalar multiplication and to the Elliptic Curve Method of factorization. We show how this improvement together with another idea can speed the computation of the Weil and Tate pairings by up to 7.8 %.
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by Ø. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.
A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as large as possible. We study this problem in the function field setting, and prove for a wide class of arithmetic functions (namely factorization functions), that such an asymptotic result holds, allowing the size of the short interval to be as small as a square-root of the size of the full interval, and analogously for arithmetic progressions. For instance, …
Let $H$ be a multiplicatively written monoid with identity $1_H$ (in particular, a group). We denote by $\mathcal P_{\rm fin,\times}(H)$ the monoid obtained by endowing the collection of all finite subsets of $H$ containing a unit with the operation of setwise multiplication $(X,Y) \mapsto \{xy: x \in X, y \in Y\}$; and study fundamental features of the arithmetic of this and related structures, with a focus on the submonoid, $\mathcal P_{\text{fin},1}(H)$, of $\mathcal P_{\text{fin},\times}(H)$ consisting of all finite subsets $X$ of $H$ with $1_H \in X$. Among others, we prove that $\mathcal…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of exponential running time complexity O(N^(1/5)). This note proposes a new deterministic integer factorization algorithm of deterministic exponential time complexity O(N^(1/6)). Furthermore, an algorithm for decomposing composite integers that have factor differences of the form q - p = (r - 1)N^(1/2) + u, where r > 1 is a fixed parameter, and | u | < N^(1/3),…
