Related papers: The smallest invariant factor of the multiplicativ…
Let $E$ be the union of two real intervals not containing zero. Then $L_n^r(E)$ denotes the supremum norm of that polynomial $P_n$ of degree less than or equal to $n$, which is minimal with respect to the supremum norm provided that…
An elementary approach for computing the values at negative integers of the Riemann zeta function is presented. The approach is based on a new method for ordering the integers and a new method for summation of divergent series. We show that…
The asymptotic form of the number of n-quasigroups of order 4 is $3^{n+1} 2^{2^n +1} (1+o(1))$. Keywords: n-quasigroups, MDS codes, decomposability, reducibility.
Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…
Let $M$ be a compact Riemannian manifold with smooth boundary, and let $R(\lambda)$ be the Dirichlet-to-Neumann operator at frequency $\lambda$. We obtain a leading asymptotic for the spectral counting function for $\lambda^{-1}R(\lambda)$…
This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series…
For a fixed integer $k$, we define the multiplicative function \[D_{k,\omega}(n) := \frac{d(n)}{k^{\omega(n)}}, \]where $d(n)$ is the divisor function and $\omega (n)$ is the number of distinct prime divisors of $n$. The main purpose of…
In this paper, we study the derivatives of an integer-valued polynomial of a given degree. Denoting by $E_n$ the set of the integer-valued polynomials with degree $\leq n$, we show that the smallest positive integer $c_n$ satisfying the…
The asymptotic form of the average probability to count $N$ indistinguishable identical particles in a small number $r \ll N$ of binned-together output ports of a $M$-port Haar-random unitary network, proposed recently in \textit{Scientific…
Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.
Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…
Let $\varrho$ be a complex number and let $f$ be a multiplicative arithmetic function whose Dirichlet series takes the form $\zeta(s)^\varrho G(s)$, where $G$ is associated to a multiplicative function $g$. The classical Selberg-Delange…
We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…
Let $d(n;\ell_1,M_1,\ell_2,M_2)$ denote the number of factorizations $n=n_1n_2$, where each of the factors $n_i\in\mathbb{N}$ belongs to a prescribed congruence class $\ell_i\bmod M_i\,(i=1,2)$. Let $\Delta(x;\ell_1,M_1,\ell_2,M_2)$ be the…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…
Let $x$ be a positive real number, and $\mathcal{P} \subset [2,\lambda(x)]$ be a set of primes, where $\lambda(x) \in \Omega(x^\varepsilon)$ is a monotone increasing function with $\varepsilon \in (0,1)$. We examine $Q_{\mathcal{P}}(x)$,…
Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…
We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…
Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…