Results 61 to 70 of about 825,768 (324)
Vincular pattern avoidance on cyclic permutations
Enumerative Combinatorics and Applications, 2021 Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition, cyclic permutations, i.e., permutations written in a circle rather than a line, have been frequently studied, including in the context of pattern avoidance.
openaire +3 more sources
Erdős–Szekeres theorem for cyclic permutations [PDF]
Involve, a Journal of Mathematics, 2019 8 pages, 2 ...
Czabarka, Éva, Wang, Zhiyu
openaire +5 more sources
Congruences involving generalized Frobenius partitions
International Journal of Mathematics and Mathematical Sciences, 1993 The goal of this paper is to discuss congruences involving the function cϕm¯(n), which denotes the number of generalized Frobenius partitions of n with m colors whose order is m under cyclic permutation of the m colors.
James Sellers
doaj +1 more source
On the permutation groups of cyclic codes [PDF]
Journal of Algebraic Combinatorics, 2012 We classify the permutation groups of cyclic codes over a finite field. As a special case, we find the permutation groups of non-primitive BCH codes of prime length. In addition, the Sylow p-subgroup of the permutation group is given for many cyclic codes of length p m . Several examples are given to illustrate the results.
T. Aaron Gulliver, Kenza Guenda
openaire +2 more sources
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem [PDF]
, 2001 In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden
Ivanyos, Gabor +2 more
core +2 more sources
Digraph Representations of 2-closed Permutation Groups with a Normal Regular Cyclic Subgroup
Electronic Journal of Combinatorics, 2015 In this paper, we classify 2-closed (in Wielandt's sense) permutation groups which contain a normal regular cyclic subgroup and prove that for each such group $G$, there exists a circulant $\Gamma$ such that $\mathrm{Aut} (\Gamma)=G$.
Jing Xu
openalex +2 more sources
On QF-rings with cyclic Nakayama permutations [PDF]
Osaka Journal of Mathematics, 1997 Let \(R\) be a basic quasi-Frobenius ring and \(P(R)=\{P_1,\dots,P_n\}\) a maximal system of non-isomorphic indecomposable projective \(R\)-modules. The Nakayama-permutation \(\pi\in S_n\) of \(R\) is defined by \(\text{Soc }P_i\simeq P_{\pi(i)}/\text{rad }P_{\pi(i)}\), \(i=1,\dots,n\).
Rim, Seog Hoon, Oshiro, Kiyoichi
openaire +4 more sources
Brauer relations in finite groups [PDF]
, 2015 If G is a non-cyclic finite group, non-isomorphic G-sets X, Y may give rise to isomorphic permutation representations C[X] and C[Y]. Equivalently, the map from the Burnside ring to the representation ring of G has a kernel. Its elements are called Brauer
Bartel, Alex, Dokchitser, Tim
core +3 more sources
Encrypting Multiple Images With an Enhanced Chaotic Map
IEEE Access, 2022 A multiple-image encryption scheme based on an enhanced chaotic map is proposed. This scheme combines multiple grayscale images into three planes. An amplified sine map is used to generate a dynamic permutation table and a chaotic sequence.
Dolendro Singh Laiphrakpam +3 more
doaj +1 more source
The cyclic structure of unimodal permutations
Discrete Mathematics, 2001 10 pages, plain ...
openaire +4 more sources