Lincoln Durst
Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
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.
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 f…
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.
We use partial zeta functions to analyse the asymptotic behaviour of certain smooth arithmetical sums over smooth k-free integers.
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…
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.
I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum of reciprocals of its elements diverges then the sequence contains an arithmetic progression of length three.
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of this article.
By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.
A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division. The algorithm is implemented.
In this article we study the arithmetic mean value $Σ(n)$ of the square roots of the first $n$ integers. For this quantity, we develop an asymptotic expression, and derive a formula for its integer part which has been conjectured recently in the work of M. Merca. Furthermore, we address the numerical evaluation of $Σ(n)$ for large $n\gg 1$.
We use topological ideas to show that, assuming the conjecture of Erd\"(o)s on subsets of positive integers having no $p$ terms in arithmetic progression (A. P.), there must exist a subset $M_p$ of positive integers with no $p$ terms in A. P. with the property that among all such subsets, $M_p$ maximizes the sum of the reciprocals of its elements.
We investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over $(\mathbb{Z}/q\mathbb{Z})^{\times}$ which considerably improves upon earlier work of Blomer.
This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer factorization to a specific instance of the multiple-choice subset-sum problem. As an application, we will improve upon special purpose factorization algorithms for integers composed of divisors with small difference. In particular, we will refine the runtime complexity of Fermat's factorization algorithm by a large subexponential factor. Our first procedure is deter…
We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed version of a conjecture of Erdös, Odlyzko, and Sárközy.
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+ε})$. Strassen's well known factoring approach is a special case of our method. We will also consider a possibility to improve upon the complexity bound.
For every prime integer $p$, an explicit factorization of the principal ideal $p\z_K$ into prime ideals of $\z_K$ is given, where $K$ is a quartic number field defined by an irreducible polynomial $X^4+aX+b\in\z[X]$.
On other two representations of the C-recursive integer sequences by terms in modular arithmetic
本文研究了C-递归整数序列的模算术表示，提出了两种新表示形式：对取余运算结果做除法，以及两个取余运算的复合，扩展了已有工作中仅使用除法后取余的表示方法。
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramaré and may be viewed as an abstract circle method.
The theoretical aspects of four integer factorization algorithms are discussed in details in this note. The focus is on the performances of these algorithms on the subset of hard to factor balanced integers N = pq, p < q < 2p. The running time complexity of these algorithms ranges from deterministic exponential time complexity O(N^(1/2)) to heuristic and unconditional logarithmic time complexity O((log N)^c), c > 0 constant.
In this paper, we obtain a general expression for the entries of the rth power of a certain n-square complex anti-tridiagonal matrix where if n is odd, r is integer or if n is even, r is natural number. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell numbers.
Given a subset of the integers of zero density, we define the weaker notion of fractional density of such a set. It is shown how this notion corresponds to that of the Hausdorff dimension of a compact subset of the reals. We then show that a version of a theorem of Łaba and Pramanik on 3-term arithmetic progressions in subsets of the unit interval also holds for subsets of the integers with fractional density and satisfying certain Fourier-decay conditions.
Weighted averages of arithmetic functions over regular integers modulo $n$
该研究推广了Kiuchi与Matsuoka的恒等式，建立了算术函数部分和的一般变换公式，将其应用于经典乘性函数的加权平均，得到了显式渐近公式，为推导渐近结果提供了统一框架。
Some Connections Between The Arithmetic and The Geometry of Lipschitz Integers
本文揭示了Lipschitz整数算术与几何间的联系，证明特定向量积的倍数性质，为Gordon Pall旧结果提供新算术证明，并提出与因式分解相关的几何问题。
We obtain results bounding the degree of the series $\sum_{n=1}^{\infty} 1/α_n$, where $\{α_n\}$ is a sequence of algebraic integers satisfying certain algebraic conditions and growth conditions. Our results extend results of Erdős, Hančl and Nair.
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.
Arithmetic progressions of integers that are relatively prime to their digital sums
本文研究了$b$-反尼文数等差数列的最大长度，探讨了其在不同基底下的性质和特征。
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 show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear sums of exponential sums which resemble Kloosterman sums, going beyond what can be obtained by the Polya-Vinogradov completion method.
We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a corollary, we make progress on a conjecture of Erdös, Odlyzko and Sárközy.
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992). We also estimate the smallest squarefull number in almost all residue classes modulo a prime $p$.
Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural numbers $N$ may be used to compute the prime factorization of $N$. In particular, we prove that the problem of computing the squarefree part of integers is deterministically polynomial-time reducible to modular tetration.
We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j, q)=1$ $(q \geq 3, 1\leq j\leq k)$. For any $A>0$, our result is uniform for $2\leq k\leq A\log\log x$. Moreover, we show that, there are large biases toward certain arithmetic progressions $(a_1 \bmod q, \cdots, a_k \bmod q)$, and such biases have connections with Mertens' theorem and the least prime in arithmetic progressions.
Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log x}{\log \log x}} \left( 1 + o(1) \right) \right)$, where $C=2π\sqrt{2/3}$ and $x$ is sufficiently large. This improves upon a previous result of the first author and F. Luca.
Pseudometrics and preorders on sets of integer sequences induced by arithmetic functions functions
本文探讨了由算术函数诱导的整数序列集合上的伪度量和预序，分析了其在整数集上的应用及扩展方法。
Hyperbolic summation involving certain arithmetic functions and the integer part function
本文研究带取整函数的多元双曲求和问题，在算术函数 f 满足一定条件下，对 r≥2 的情形建立了渐近公式。
Fermat's well-known factorization algorithm is based on finding a representation of natural numbers $N$ as the difference of squares. In 1895, Lawrence generalized this idea and applied it to multiples $kN$ of the original number. A systematic approach to choose suitable values for $k$ was introduced by Lehman in 1974, which resulted in the first deterministic factorization algorithm considerably faster than trial division. In this paper, we construct a time-space tradeoff for Lawrence's generalization and apply it together with Lehman's result to obtain a deterministic integer factorization a…
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…
Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $λ(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of counting integer zeros of $F$ with $|\boldsymbol{x}| \leq X$, weighted by $λ(x_1)$.
We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and lcm of the integers $m,n$. In particular, we investigate the functions $f(n)=τ(n), \log n, ω(n)$ and $Ω(n)$. We also define a common generalization of the latter three functions, and prove a corresponding result.
We derive a compact determinant formula for calculating and factorizing the hypersum polynomials S^{(L)}_k(N) \equiv \sum_{n_1=1}^N ...\sum_{n_{L+1}=1}^{n_{L}}(n_{L+1})^k expressed in the variable N(N+L+1)
The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order partial derivatives is eventually periodic. We also prove a criterion to determine when an integer has integral anti-partial derivatives. As an application, we show that there are infinitely many integers with exactly $n$ integral anti-partial derivatives for any nonnegative integer $n$.
This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption and under assumption of the abc-conjecture. Finally we prove that the explicit abc-conjecture implies the Erdős-Woods conjecture for each k>2.
Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n) = k\} \sim A_k x $$ and $$ \#\{n \leq x : f(n) = ω(n) - k\} \sim \frac{B x (\log \log x)^k}{k! \log x} , $$ as $x \to +\infty$, where $ω(n)$ is the number of prime factors of $n$ and $A_k, B > 0$ are some explicit constants. The latter asymptotic extends a result of Aktaş and Ram Murty about numbers having mutually distinct exponents in their prime factoriza…
On the tower factorization of integers
研究整数塔式分解的高度，给出高度为k的整数集合密度公式，估计平均层数，并证明存在任意长且高度任意大的连续整数序列。
Variance of square-full integers in short intervals and arithmetic progressions
本文在拟黎曼假设下给出短区间内全平方整数方差的预期阶上界，并证明等差数列中方差的渐近公式，对二次剩余与非剩余各半平均，其阶对大素数q更小。
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.
Orders and partitions of integers induced by arithmetic functions
本文研究整数按除数性质排序或划分的方法，基于整数上的伪度量探讨诱导的预序关系、等价关系及商集，分析算术函数生成的伪度量及其在整数除数性质中的应用。
Recently, there has been a sharp rise of interest in properties of digits primes. Here we study yet another question of this kind. Namely, we fix an integer base $g \ge 2$ and then for every infinite sequence $${\mathcal D} = \{d_i\}_{i=0}^\infty \in \{0, \ldots, g-1\}^\infty $$ of $g$-ary digits we consider the counting function $\varpi_{{\mathcal D},g}(N)$ of integers $n \le N$ for which $\sum_{i=0}^{n-1} d_i g^i$ is prime. We construct sequences ${\mathcal D}$ for which $\varpi_{{\mathcal D},g}(N)$ grows fast enough, and show that for some constant $\vartheta_g< g$ there are at most $O(\var…
We prove new variants of the Lambert series factorization theorems studied by Merca and Schmidt (2017) which correspond to a more general class of Lambert series expansions of the form $L_a(α, β, q) := \sum_{n \geq 1} a_n q^{αn-β} / (1-q^{αn-β})$ for integers $α, β$ defined such that $α\geq 1$ and $0 \leq β< α$. Applications of the new results in the article are given to restricted divisor sums over several classical special arithmetic functions which define the cases of well-known, so-termed "ordinary" Lambert series expansions cited in the introduction. We prove several new forms of factoriz…
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). \]
We consider weighted averages of the number of representations of an even integer as a sum of two prime numbers, where each summand lies in a given arithmetic progression modulo a common integer $q$. Our result is uniform in a suitable range for $q$.
We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of arithmetic groups.
We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic progression of length |2S|-|S|+1. This is the first result of this nature which places no unnecessary restrictions on the size of S.
Inspired by the Erdös-Turan conjecture we consider subsets of the natural numbers that contains infinitely many aritmetic progressions (APs) of any given length - such sets will be called AP-sets and we know due to the Green-Tao Theorem and Sźmeredis Theorem that the primes and all subsets of positive upper density are AP-sets. We prove that (1, 1,..., 1) is a solution to the equation Mx = 0 where M is an integer matrix whose null space has dimension at least 2, if and only if the equation has infinitely many solutions such that the coordinates of each solution are elements in the same AP. Thi…
Two theorems of elmentary arithmetic, one stating that the sum of the reciprocals of any number of consecutive positive integers is never an integer, and a generalization thereof by Trygve Nagell, are shown to be provable inside a very weak arithmetic, Richard Kaye's $PA^-$, in which there is no induction axiom whatsoever.
Integer Sets of Large Harmonic Sum Which Avoid Long Arithmetic Progressions
本研究给出数字受限整数集不含k项算术级数的条件，通过大规模搜索找到不含4项与10项算术级数且调和和优于传统贪心构造的整数集，可高效计算相关集合与调和和。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。