Related papers: Smooth permutations and polynomials revisited

We revisit the problem of a two-dimensional polymer ring subject to an inflating pressure differential. The ring is modeled as a freely jointed closed chain of N monomers. Using a Flory argument, mean-field calculation and Monte Carlo…

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

The well-known result states that the square-free counting function up to $N$ is $N/\zeta(2)+O(N^{1/2})$. This corresponds to the identity polynomial $\text{Id}(x)$. It is expected that the error term in question is…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We use a probabilistic approach to describe the behavior as $n -> \infty$ of the Laplace transforms of $P^n$, where $P$ a fixed complex polynomial. As a consequence we obtain a new elementary proof of an result of Gillis-Ismail-Offer in the…

We discuss the generalization of a classical problem involving an $N$-step ideal polymer adsorption at a sticky boundary (potential well of depth $U$). It is known that as $N$ approaches infinity, the path undergoes a 2nd-order localization…

We prove that permutations with few inversions exhibit a local-global dichotomy in the following sense. Suppose ${\boldsymbol\sigma}$ is a permutation chosen uniformly at random from the set of all permutations of $[n]$ with exactly…

We present a new class of particle methods with deformable shapes that converge in the uniform norm without requiring remappings, extended overlapping or vanishing moments for the particles. The crux of the method is to use polynomial…

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers…

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…

A class of solid-on-solid growth models with short range interactions and sequential updates is studied. The models exhibit both smooth and rough phases in dimension d=1. Some of the features of the roughening transition which takes place…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

Let $\mu$ be a non-trivial probability measure on the unit circle $\partial\bbD$, $w$ the density of its absolutely continuous part, $\alpha_n$ its Verblunsky coefficients, and $\Phi_n$ its monic orthogonal polynomials. In this paper we…

Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

The problem of counting derangements was initiated by Pierre Remonde de Motmort in 1708. A derangement is a permutation that has no fixed points and the derangement number Dn is the number of fixed point free permutations on an n element…