English
Related papers

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

200 papers

We show that the Ree unital $\mathcal{R}(q)$ has an embedding in a projective plane over a field $F$ if and only if $q=3$ and $\mathbb{F}_8$ is a subfield of $F$. In this case, the embedding is unique up to projective linear…

Combinatorics · Mathematics 2021-01-27 Gábor P. Nagy

Using standard methods for studying singularities of projections and of contacts, we classify the stable singularities of affine $\lambda$-equidistants of $n$-dimensional closed submanifolds of $\mathbb R^q$, for $q\leq 2n$, whenever…

Differential Geometry · Mathematics 2020-07-31 W. Domitrz , P. de M. Rios , M. A. S. Ruas

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

Numerical Analysis · Mathematics 2007-05-23 Miklos Bona

We study maps on the set of permutations of n generated by the R\'enyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases…

Combinatorics · Mathematics 2020-08-10 Michael LaCroix , Tom Roby

For translationally invariant one-band lattice models, we exploit the ab initio knowledge of the natural orbitals to simplify reduced density matrix functional theory (RDMFT). Striking underlying features are discovered: First, within each…

Quantum Physics · Physics 2019-01-08 Christian Schilling , Rolf Schilling

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

Symbolic Computation · Computer Science 2024-04-04 Ramachandran Anantharaman , Virendra Sule

Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…

Representation Theory · Mathematics 2020-02-28 Laura Colmenarejo , Charles F. Dunkl

Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…

Number Theory · Mathematics 2016-03-04 Gohar Kyureghyan , Michael Zieve

Let $K$ be a field of characteristic zero, $X$ and $Y$ be smooth $K$-varieties, and let $V$ be a finite dimensional $K$-vector space. For two algebraic morphisms $\varphi:X\rightarrow V$ and $\psi:Y\rightarrow V$ we define a convolution…

Algebraic Geometry · Mathematics 2020-08-05 Itay Glazer , Yotam I. Hendel

$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…

Rings and Algebras · Mathematics 2025-06-30 Varsha Jarali , Prasanna Poojary , Vadiraja Bhatta G. R

The subject of the present work is the de Rham part of non-commutative Hodge structures on the periodic cyclic homology of differential graded algebras and categories. We discuss explicit formulas for the corresponding connection on the…

Algebraic Geometry · Mathematics 2012-07-25 D. Shklyarov

We consider the differential system $y'-x^{-1}Ay-q(x)y=\rho By $ with $n\times n$ matrices $A,B, q(x)$, where $A,B$ are constant, $B$ is diagonal, $A$ and $q(x)$ are off-diagonal, $q(\cdot)\in W^1_1[0,\infty)$. Some distinguished…

Spectral Theory · Mathematics 2016-06-07 Mikhail Ignatyev

In this paper we give a convolution identity for the complete and elementary symmetric functions. This result can be used to proving and discovering some combinatorial identities involving $r$-Stirling numbers, $r$-Whitney numbers and…

Number Theory · Mathematics 2018-11-13 Mircea Merca

In this paper we propose a model of random compositions of cylinder maps, which in the simplified form is as follows: $(\theta,r)\in \mathbb T\times \mathbb R=\mathbb A$ and \begin{eqnarray} \nonumber f_{\pm 1}:…

Dynamical Systems · Mathematics 2015-01-26 O. Castejón , V. Kaloshin

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $\pi$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{\pi(i)}$ and has destination $v_i$. During each step, a disjoint set…

Combinatorics · Mathematics 2016-09-01 Junhua He , Louis A. Valentin , Xiaoyan Yin , Gexin Yu

Based on the recent developments in the irregular Riemann-Hilbert correspondence for holonomic D-modules and the Fourier-Sato transforms for enhanced ind-sheaves, we study the Fourier transforms of some irregular holonomic D-modules. For…

Algebraic Geometry · Mathematics 2025-02-11 Kiyoshi Takeuchi

We consider the Bethe ansatz integrable Russian Doll (RD) model of superconductivity with time-reversal symmetry breaking, which exhibits a cyclic renormalization group. By obtaining an exact solution for the renormalization group flows, we…

Statistical Mechanics · Physics 2026-03-19 Ilya Liubimov , Alexander Gorsky

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…

Combinatorics · Mathematics 2015-03-17 Ricky X. F. Chen , Christian M. Reidys

We characterize all permutations on even-by-even grids that maximally separate neighboring vertices. More precisely, let $n_1$, $n_2$ be positive even integers, let $I(n_1,n_2)=\{1,\dots,n_1\}\times\{1,\dots,n_2\}$ be the $n_1\times n_2$…

Combinatorics · Mathematics 2019-11-13 Mohammed Albow , Jeff Edgington , Mario Lopez , Petr Vojtěchovský

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

Information Theory · Computer Science 2020-07-30 Yuting Chen , Liqi Wang , Shixin Zhu