Related papers: The largest and the smallest fixed points of permu…
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…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
We give a survey, known and new results on the beingness of fixed points of the maximal operator in the more general settings of metric measure space. In particular, we prove that the fixed points of the uncentered one must be the constant…
We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…
We investigate fixed points and cycle types of permutation polynomials and complete permutation polynomials arising from reversed Dickson polynomials of the first kind and second kind over $\mathbb{F}_p$. We also study the permutation…
We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is…
The Danzer--Gr\"unbaum acute angles problem asks for the largest size of a set of points in ${\mathbb R}^d$ that determines only acute angles. Recently, the problem was essentially solved thanks to the results of the second author and of…
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 present a constructive proof of Brouwer's fixed point theorem for uniformly continuous and sequentially locally non-constant functions based on the existence of approximate fixed points. And we will show that Brouwer's fixed point…
Answering a question of Donald Knuth, we find the bivariate exponential generating function for "up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\cdots…
We introduce, and partially resolve, a conjecture that brings a three-centuries-old derangements phenomenon and its much younger two-decades-old analogue under the same umbrella. Through a graph-theoretic lens, a derangement is a perfect…
This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving…
In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…
We characterize all permutations on even-by-even grids that maximally separate neighboring vertices. More precisely, let $n_1$, $n_2$ be positive even integers, let $I(n_1,n_2)=\{1,\dots,n_1\}\times\{1,\dots,n_2\}$ be the $n_1\times n_2$…
We show that the usual fixed point for 3-d rigid string with topological term appears to be a trivial one, consisting of two decoupled conformal field theories. We further argue that by involving an additional term allowed by symmetries and…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
Let $\sigma$ be a permutation of a nonempty finite or countably infinite set $X$ and let $F_X\left( \sigma^k\right)$ count the number of fixed points of the $k$th power of $\sigma$. This paper explains how the arithmetic function $k \mapsto…
The main results of this paper are the construction, both rigourous and intuitive, of "the" intrinsic extension of the set of non negative integers N and the smallest over-field of R set which is continue (according to R.Dedekind). The aim…
We characterize finite sets $S$ of nonwandering points for generic diffeomorphisms $f$ as those which are {\em uniformly bounded}, i.e., there is an uniform bound for small perturbations of the derivative of $f$ along the points in $S$ up…
It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.