相关论文: On the Cycle Structure of the Metacommutation Map

Let $p$ and $q$ be probability vectors with the same entropy $h$. Denote by $B(p)$ the Bernoulli shift indexed by $\Z$ with marginal distribution $p$. Suppose that $\phi$ is a measure preserving homomorphism from $B(p)$ to $B(q)$. We prove…

We investigate the occurrence of powers of tight Hamilton cycles in random hypergraphs. For every $r\ge 3$ and $k\ge 1$, we show that there exists a constant $C > 0$ such that if $p=p(n) \ge Cn^{-1/\binom{k+r-2}{r-1}}$ then asymptotically…

A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

This paper investigates asymptotic fixed point results for nonlinear contractions, with emphasis on Kirk-type theorems and their generalizations. A central difficulty in the literature has been the requirement that the mapping possesses a…

An adjacent $q$-cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent $q$-cycles in a permutation maps to the sum of occurrences of two mesh patterns under Foata's fundamental transformation. As…

In this paper, we introduce a new contraction condition that combines the framework of Singh's extension with the classical Chatterjea contraction. This generalized form, called the Singh-Chatterjea contraction, is defined on the p-th…

In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…

The coupling-constant metamorphosis is applied to modified extended Hamiltonians and sufficient conditions are found in order that the transformed high-degree first integral of the transformed Hamiltonian is determined by the same algorithm…

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…

Let $p$ be a prime number. We consider diagonal $p$-permutation functors over a (commutative, unital) ring $\mathsf{R}$ in which all prime numbers different from $p$ are invertible. We first determine the finite groups $G$ for which the…

For even $k$, the matchings connectivity matrix $\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al. (STOC 2013) showed that the rank of $\mathbf{M}_k$ over $\mathbb{Z}_2$ is…

Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

In this paper we analyze the structure of transitive permutation groups that have trivial four point stabilizers, but some nontrivial three point stabilizer. In particular we give a complete, detailed classification when the group is simple…

For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we…

Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The first author previously extended this question to ask about not only fixed points but also…

In a recent paper, Backelin, West and Xin describe a map $\phi ^*$ that recursively replaces all occurrences of the pattern $k... 21$ in a permutation $\sigma$ by occurrences of the pattern $(k-1)... 21 k$. The resulting permutation…

Classical reversible circuits, acting on $w$~bits, are represented by permutation matrices of size $2^w \times 2^w$. Those matrices form the group P($2^w$), isomorphic to the symmetric group {\bf S}$_{2^w}$. The permutation group P($n$),…

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…