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

We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$…

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…

For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a…

LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

We show that for every $k \in \mathbb{N}$ there exists $C > 0$ such that if $p^k \ge C \log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\textsuperscript{th} power of a Hamilton cycle. This…

We develop a classification of the fixed points and cycles of the Kaprekar transformation in even bases. The most numerous fixed points and cycles are those we denote symmetric and almost-symmetric; the structure of the cycles of these…

We study the ``renormalization group action'' induced by cycles of cosmic expansion and contraction, within the context of a family of stochastic dynamical laws for causal sets derived earlier. We find a line of fixed points corresponding…

We extend the results and techniques from \cite{FJJK} to study the combinatorial dynamics (\emph{forcing}) and entropy of quasiperiodically forced skew-products on the cylinder. For these maps we prove that a cyclic permutation $\tau$…

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

Bifurcations of periodic orbits as an external parameter is varied are a characteristic feature of generic Hamiltonian systems. Meyer's classification of normal forms provides a powerful tool to understand the structure of phase space…

We compare the notions of essential dimension and stable cohomological dimension of a finite group G, prove that the latter is bounded by the length of any normal series with cyclic quotients for G, and show that, however, this bound is not…

We present a new method for the study of hemisystems of the Hermitian surface $\mathcal{U}_3$ of $PG(3,q^2)$. The basic idea is to represent generator-sets of $\mathcal{U}_3$ by means of a maximal curve naturally embedded in $\mathcal{U}_3$…

West's stack-sorting map involves a stack which avoids the permutation $21$ consecutively. Defant and Zheng extended this to a consecutive-pattern-avoiding stack-sorting map $SC_\sigma$, where the stack must always avoid a given permutation…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…