Related papers: Arithmetic functions in short intervals and the sy…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…
Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…
We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used…
For a finite group $G$ and a sufficiently large (but fixed) prime power $q$ coprime to $G$ we obtain asymptotics for the number of regular Galois extensions $L/ \mathbb{F}_q(t)$, with $\mathrm{Gal}(L/\mathbb{F}_q(t)) \cong G$, ramified at a…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…
In this paper we study the variance of the Euler totient function (normalized to $\varphi(n)/n$) in the integers $\mathbb{Z}$ and in the polynomial ring $\mathbb{F}_q[T]$ over a finite field $\mathbb{F}_q$. It turns out that in…
Let $\mathbb{A}=\mathbb{F}_{q}[T]$ be the polynomial ring over finite field $\mathbb{F}_{q}$, and $\mathbb{A}_{+}$ be the set of monic polynomials in $\mathbb{A}$. In this paper, we show that a large class of arithmetic functions in…
Gross and Smith have put forward generalizations of Hardy - Littlewood twin prime conjectures for algebraic number fields. We estimate the behavior of sums of a singular series that arises in these conjectures, up to lower order terms. More…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
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…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We give a new heuristic for all of the main terms in the integral moments of various families of primitive L-functions. The results agree with previous conjectures for the leading order terms. Our conjectures also have an almost identical…
Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing…
A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not…
An aperiodic (low frequency) spectrum may originate from the error term in the mean value of an arithmetical function such as M\"obius function or Mangoldt function, which are coding sequences for prime numbers. In the discrete Fourier…