Related papers: A Discontinuity in the Distribution of Fixed Point…

Let $G$ be a permutation group on $n<\infty$ objects. Let $f(g)$ be the number of fixed points of $g\in G$, and let $\{f(g):1\ne g\in G\}=\{f_1,\ldots,f_r\}$. In this expository note we give a character-free proof of a theorem of Blichfeldt…

Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…

In this paper we propose a method to define the range of stability of fixed points for a variety of discrete fractional systems of the order $0 < \alpha <2$. The method is tested on various forms of fractional generalizations of the…

Let $S_n$ be the set of permutations on $\{1,\,\dots,\,n\}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of $\{|i-\pi(i)|;\;1\le i\le n\}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

We consider iterated function systems on the interval with random perturbation. Let $Y_\epsilon$ be uniformly distributed in $[1- \epsilon, 1 + \epsilon]$ and let $f_i \in C^{1+\alpha}$ be contractions with fixpoints $a_i$. We consider the…

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

For each certain "nice" piecewise linear function $f:[0,1] \to [0,1]$, we consider a family of growing Young diagrams $\{\lambda(f,N)\}_{N=1}^{\infty}$ by enlarging the region under the graph of $f$. We compute asymptotic formulas for the…

It is investigated the existence of a separately continuous function $f:X\times Y\to \mathbb R$ with an onepoint set of discontinuity for topological spaces $X$ and $Y$ which satisfy compactness type conditions. In particular, it is shown…

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

Let $F_Q$ be the set of Farey fractions of order $Q$. Given the integers $\d\ge 2$ and $0\le \c \le \d-1$, let $F_Q(c,d)$ be the subset of $F_Q$ of those fractions whose denominators are $\equiv c \pmod d$, arranged in ascending order. The…

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes…

Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

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 describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…