Related papers: Smooth permutations and polynomials revisited

We prove an Erd\H{o}s-Kac type of theorem for the set $S(x,y)=\{n\leq x: p|n \Rightarrow p\leq y \}$. If $\omega (n)$ is the number of prime factors of $n$, we prove that the distribution of $\omega(n)$ for $n \in S(x,y)$ is Gaussian for a…

We study the decay of convolution powers of probability measures without second moment but satisfying some weaker finite moment condition. For any locally compact unimodular group G and any positive function $\rho:G \rightarrow…

We derive new explicit bounds for the total variation distance between two convolution products of $n$ probability distributions, one of which having identical convolution factors. Approximations by finite signed measures of arbitrary order…

In part I of this paper we studied additive decomposability of the set $\F_y$ of th $y$-smooth numbers and the multiplicative decomposability of the shifted set $\g_y=\F_y+\{1\}$. In this paper, focusing on the case of 'large' functions…

All arithmetical functions $F$ satisfying Ramanujan Conjecture, i.e., $F(n)\ll_{\varepsilon}n^{\varepsilon}$, and with $Q-$smooth divisors, i.e., with Eratosthenes transform $F':=F\ast \mu$ supported in $Q-$smooth numbers, have a kind of…

We consider the distribution of the binomial probability mass function (pmf) among arithmetic progressions and obtain an average-type theorem. As applications, we consider the possible visits to a kind of sieved sets of integers or lattice…

We consider a particular class of n-dimensional homogeneous diffusions all of which have an identity diffusion matrix and a drift function that is piecewise constant and scale invariant. Abstract stochastic calculus immediately gives us…

We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…

A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact…

The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…

We study the complexity of smoothed agnostic learning of halfspaces on $\{\pm 1\}^n$ under uniform marginals in the model of~\cite{KM25}, where each input coordinate is independently flipped with probability $\sigma \in (0, {1}/{2})$. We…

We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…

We prove a Poincare lemma for a set of r smooth functions on a 2n-dimensional smooth manifold satisfying a commutation relation determined by r singular vector fields associated to a Cartan subalgebra of $\frak{sp}(2r,\mathbb R)$. This…

We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…

Inspired by some iterative algorithms useful for proving the real analyticity (or the Gevrey regularity) of a solution of a linear partial differential equation with real-analytic coefficients, we consider the following question. Given a…

Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…