Related papers: Arithmetic constants for symplectic variances of t…
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…
We suggest a new approach to Artin's constant that leads to its representation as an infinite sum divided by another infinite sum. The same approach works well for Stephens' constant and higher rank Artin's constants. The main results are…
We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…
In this paper, we consider sums related the floor function. We can improve some previous results for some special arithmetic functions considered by Bordell\'es [3], Stucky[9] and Liu-Wu-Yang [6]. We can also give a refined result for…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
We introduce discrepancy values, quantities inspired by the notion of the spectral spread of Hermitian matrices. We define them as the discrepancy between two consecutive Ky-Fan-like seminorms. As a result, discrepancy values share many…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…
An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.
Let $ \mathbb{F}_q[T]$\, be the ring of polynomials over a finite field $ \mathbb{F}_q $. Let $ g: \mathbb{F}_q[T] \rightarrow \mathbb{R} $ be a multiplicative function such that for any irreducible polynomial $ P $ over $ \mathbb{F}_q $…
In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…
In this paper, we study the sum of the divisor function over sets with digit restrictions.
We study matrix integrals of the form $$\int_{\mathrm{USp(2n)}}\prod_{j=1}^k\mathrm{tr}(U^j)^{a_j}\mathrm d U,$$ where $a_1,\ldots,a_r$ are natural numbers and integration is with respect to the Haar probability measure. We obtain a compact…
This is a short summary of main results of our paper arXiv:0811.2435 where the concept of motivic Donaldson-Thomas invariant was introduced. It also contains a discussion of some open questions from the loc.cit., in particular, the geometry…
Ordinary differential equations have an arithmetic analogue in which functions are replaced by numbers and the derivation operator is replaced by a Fermat quotient operator. In this survey we explain the main motivations, constructions,…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
Recently Ruckle \cite{RuckleArithmeticalSummability} introduced the theory of arithmetical summability suggested by the sum $ \sum_{k|m}f(k) $ as $ k $ ranges over the divisors of $m$ including $ 1 $ and $ m .$ Following Ruckle…
The summation arithmetic functions with asymptotically independent summands are studied in the paper. We prove statements about the condition under which the summation arithmetic functions have asymptotically independent summands. It is…
The main purpose of this work is to ascertain when arithmetic operations with periodic functions whose domains may not coincide with the whole real line preserve periodicity.
We prove that the the discrepancy of arithmetic progressions in the $d$-dimensional grid $\{1, \dots, N\}^d$ is within a constant factor depending only on $d$ of $N^{\frac{d}{2d+2}}$. This extends the case $d=1$, which is a celebrated…