English
Related papers

Related papers: R\'edei permutations with the same cycle structure

200 papers

Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over $\mathbb F_{q^2}$, whose numerators are so-called $q$-quadratic…

Number Theory · Mathematics 2024-01-25 Ruikai Chen , Sihem Mesnager

We prove a uniqueness result for limit cycles of the second order ODE $\ddot x + \dot x \phi(x,\dot x) + g(x) = 0$. Under mild additional conditions, we show that such a limit cycle attracts every non-constant solution. As a special case,…

Dynamical Systems · Mathematics 2015-05-19 Marco Sabatini

Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(\gamma,\Delta)$-cyclic codes over a class of finite non-chain commutative rings…

Information Theory · Computer Science 2025-02-25 Om Prakash , Shikha Patel , Habibul Islam

The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…

Combinatorics · Mathematics 2016-10-13 Miklos Bona , Boris Pittel

The $(p,q,n)$-dipole problem is a map enumeration problem, arising in perturbative Yang-Mills theory, in which the parameters $p$ and $q$, at each vertex, specify the number of edges separating of two distinguished edges. Combinatorially,…

Combinatorics · Mathematics 2011-08-23 David M. Jackson , Craig A. Sloss

We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…

Combinatorics · Mathematics 2024-07-11 John Bamberg , Jesse Lansdown

Fendley, Schoutens and van Eerten [Fendley et al., J. Phys. A: Math. Gen., 38 (2005), pp. 315-322] studied the hard square model at negative activity. They found analytical and numerical evidence that the eigenvalues of the transfer matrix…

Combinatorics · Mathematics 2008-12-08 Johan Thapper

We study a perturbed variant of Hofstadter's $Q$-recursion \[ Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n, \qquad Q(1)=Q(2)=1 . \] Numerical experiments indicate that the sequence remains well defined for very large values of $n$ and exhibits an…

Combinatorics · Mathematics 2026-03-18 Marco Mantovanelli

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

Combinatorics · Mathematics 2019-02-20 Olivier Bernardi , Alejandro H. Morales , Richard P. Stanley , Rosena R. X. Du

We present general links between statistics of non-Hermitian random matrices and the distribution of the number of cycles of some specific random permutations. In particular, we derive explicit formulas for the generating functions of the…

Probability · Mathematics 2021-11-12 Guillaume Dubach

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…

Combinatorics · Mathematics 2020-03-09 Bernard Mans , Min Sha , Jeffrey Smith , Daniel Sutantyo

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T;R) of V(R) such that T is the sum of the topes of Q(T;R). If…

Combinatorics · Mathematics 2017-03-14 Andrey O. Matveev

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…

Probability · Mathematics 2018-01-30 Enes Ozel

We consider a planar differential system $\dot{x}= P(x,y)$, $\dot{y} = Q(x,y)$, where $P$ and $Q$ are $\mathcal{C}^1$ functions in some open set $\mathcal{U} \subseteq \mathbb{R}^2$, and $\dot{}=\frac{d}{dt}$. Let $\gamma$ be a periodic…

Dynamical Systems · Mathematics 2007-05-23 Hector Giacomini , Maite Grau

Let $\Lambda$ be a set and $\mathbb{F}$ a field. Suppose that $K,Q:\Lambda^2\to\mathbb{F}$ are two functions such that for any $n\in\mathbb{N}$ and $x_1,x_2,\ldots,x_n\in\Lambda$, the determinants of matrices $(K(x_i,x_j))_{1\leq i,j\leq…

Combinatorics · Mathematics 2026-05-12 Harry Sapranidis Mantelos

We study isolated quotient singularities by finite and linearly reductive group schemes (lrq singularities for short) and show that they satisfy many, but not all, of the known properties of finite quotient singularities in characteristic…

Algebraic Geometry · Mathematics 2025-12-17 Christian Liedtke , Gebhard Martin , Yuya Matsumoto

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

Combinatorics · Mathematics 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

Combinatorics · Mathematics 2026-03-17 Andrew Fulcher

We prove bijectively that the total number of cycles of all even permutations of $[n]=\{1,2,...,n\}$ and the total number of cycles of all odd permutations of $[n]$ differ by $(-1)^n(n-2)!$, which was stated as an open problem by Mikl\'{o}s…

Combinatorics · Mathematics 2010-04-07 Jang Soo Kim
‹ Prev 1 3 4 5 6 7 10 Next ›