Related papers: Arithmetic functions and fixed points of powers of…

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,... n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible…

When studying families in the moduli space of dynamical systems, choosing an appropriate representative function for a conjugacy class can be a delicate task. The most delicate questions surround rationality of the conjugacy class compared…

We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness relation between atoms and terms can be derived from the more…

We compute exactly the generating function of a supersymmetric non-linear sigma model describ-ing random matrices belonging to the unitary class. Although an arbitrary source explicitly breaksthe supersymmetry, a careful analysis of the…

Let $G\leqslant\mathrm{Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser $H$. We say that a subgroup $K$ of $G$ is a fixer if every element of $K$ has fixed points, and we say that $K$ is large if $|K| \geqslant…

For a finite and positive measure space $(\Omega,\Sigma,\mu)$ and any weakly compact convex subset of $L\sp\infty(\Omega,\Sigma,mu)$, a fixed point theorem for a class of nonexpansive self-mappings is proved. An analogous result is obtained…

The aim of this paper is to introduce the notion of a Suzuki-Gerghaty type contractive mapping via simulation function along with $\mathcal{C}$-class functions and prove the existence of fixed point result. An example is given to show the…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

We recursively define a sequence $\{F_{n,k}\}_{n,k\in\mathbb N }$ and we prove that such sequence contains only the symbols $\{0,1\}.$ We investigate some number-theoretic properties of such sequence and of the way it can be generated. The…

For $\mathrm{O}(\mathrm{q},k)$, the orthogonal group over a field $k$ of characteristic 2 with respect to a quadratic form $\mathrm{q}$, we discuss the isomorphism classes of fixed points of involutions. When the quadratic space is either…

In this paper, we describe an algorithm for approximating functions of the form $f(x)=\int_{a}^{b} x^{\mu} \sigma(\mu) \, d \mu$ over $[0,1]$, where $\sigma(\mu)$ is some signed Radon measure, or, more generally, of the form $f(x) =…

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

For given non-negative real numbers $\alpha_k$ with $ \sum_{k=1}^{m}\alpha_k =1$ and normalized analytic functions $f_k$, $k=1,\dotsc,m$, defined on the open unit disc, let the functions $F$ and $F_n$ be defined by $…

We consider Gibbs distributions on permutations of a locally finite infinite set $X\subset\mathbb{R}$, where a permutation $\sigma$ of $X$ is assigned (formal) energy $\sum_{x\in X}V(\sigma(x)-x)$. This is motivated by Feynman's path…

The limiting distribution \mu of the normalized number of key comparisons required by the Quicksort sorting algorithm is known to be the unique fixed point of a certain distributional transformation T -- unique, that is, subject to the…

We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…