Related papers: The smallest invariant factor of the multiplicativ…

In the integer case, the Smarandache function of a positive integer $n$ is defined to be the smallest positive integer $k$ such that $n$ divides the factorial $k!$. In this paper, we first define a natural order for polynomials in…

In this paper we give an asymptotic formula for a matrix integral which plays a crucial role in the approach of Diaconis et al. to random matrix eigenvalues. The choice of parameter for the asymptotic analysis is motivated by an invariant…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

Let $\{X_n,n\ge1\}$ be a sequence of independent and identically distributed random variables, taking non-negative integer values, and call $X_n$ a $\delta$-record if $X_n>\max\{X_1,...,X_{n-1}\}+\delta$, where $\delta$ is an integer…

Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…

It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

Let $\Lambda(n)$ be the von Mangoldt function, and let $[t]$ be the integral part of real number $t$. In this note, we prove that for any $\varepsilon>0$ the asymptotic formula $$ \sum_{n\le x} \Lambda\Big(\Big[\frac{x}{n}\Big]\Big) =…

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

Asymptotic formulae are established for the number of natural numbers $m$ with largest square-free divisor not exceeding $m^{\vartheta}$, for any fixed positive parameter $\vartheta$. Related counting functions are also considered.

We provide an asymptotic expansion for the mean-value of the logarithm of the middle prime factor of an integer, defined according to multiplicity or not, thus generalising a recent study of McNew, Pollack, and Singha Roy. This yields an…

We develop an asymptotic expansion of the spectral measures on a degenerating family of hyperbolic Riemann surfaces of finite volume. As an application of our results, we study the asymptotic behavior of weighted counting functions, which,…

We consider the infinite symmetric group and its infinite index subgroup given as the stabilizer subgroup of one element under the natural action on a countable set. This inclusion of discrete groups induces a hyperfinite subfactor for each…

Let $D\in\mathbb{N}$, let $A>D+1$, and let $Q\geqslant3$. Consider the class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ such that $|\sum_{n\leqslant x}f(n)|\le x(\log Q)^{A-D-1}/(\log x)^A$ for all $x\geqslant Q$, and such that…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

We introduce a new approach to the the asymptotic iteration method (AIM) by means of which we establish the standard AIM connection with the continued fractions technique and we develop a novel termination condition in terms of the…

We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…

Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.