Related papers: Smooth permutations and polynomials revisited

Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…

Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…

We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…

The smoothed analysis of algorithms is concerned with the expected running time of an algorithm under slight random perturbations of arbitrary inputs. Spielman and Teng proved that the shadow-vertex simplex method has polynomial smoothed…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

Shor's factoring algorithm guarantees a success probability of at least one half for any fixed modulus N = pq with distinct primes p and q. We show that this guarantee does not extend to the asymptotic regime. As N -> infinity, the…

In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity. In this work, we study the widely used Mallows mixture model. In the high-dimensional setting, we…

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…

Permutation polynomials over a ring of modulo $2^w$ are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general,…

In this paper, we describe randomized Shellsort--a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and, as we show, succeeds in sorting any given input permutation with very high…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Fix integers a_1,...,a_d satisfying a_1 + ... + a_d = 0. Suppose that f : Z_N -> [0,1], where N is prime. We show that if f is ``smooth enough'' then we can bound from below the sum of f(x_1)...f(x_d) over all solutions (x_1,...,x_d) in Z_N…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…

We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the…

Let $x\ge y>0$ be integers. A positive integer is $y$-smooth if all its prime divisors are at most $y$. Let $\Psi(x,y)$ count the number of $y$-smooth integers up to $x$. We present several algorithms that will generate an integer $n\le x$…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…