Endo-permutation modules as sources of simple modules. [PDF]
, 2003 The source of a simple $kG$-module, for a finite $p$-solvable group $G$ and an algebraically closed field $k$ of prime characteristic $p$, is an endo-permutation module (see~\cite{Pu1} or~\cite{Th}). L.
Mazza, Nadia
core +4 more sources
Generalized permutation patterns - a short survey [PDF]
, 2010 An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p.
Steingrimsson, Einar
core +3 more sources
Permutation and sampling with maximum length CA for pseudorandom number generation [PDF]
, 2007 In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation ...
Wijaya, S, Guan, SU, Tan, SK
core +6 more sources
Novel Medical Image Encryption Scheme Based on Chaos and DNA Encoding
IEEE Access, 2019 In this paper, we propose a new chaos-based encryption scheme for medical images. It is based on a combination of chaos and DNA computing under the scenario of two encryption rounds, preceded by a key generation layer, and follows the permutation ...
Akram Belazi +3 more
doaj +1 more source
Prime order derangements in primitive permutation groups [PDF]
, 2011 Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M. +10 more
core +1 more source
Testing the role of chain connectivity on the stability and structure of dihydrofolate reductase fromE. coli: Fragment complementation and circular permutation reveal stable, alternatively folded forms [PDF]
Protein Science, 2001 AbstractThe effects of chain cleavage and circular permutation on the structure, stability, and activity of dihydrofolate reductase (DHFR) fromEscherichia coliwere investigated by various spectroscopic and biochemical methods. Cleavage of the backbone after position 86 resulted in two fragments, {1–86} and {87–159}, each of which are poorly structured ...
V F, Smith, C R, Matthews
openaire +2 more sources
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2016 A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +1 more source
Almost Self-Complementary 3-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2017 It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N. +2 more
doaj +1 more source
A note on self-complementary hypergraphs [PDF]
Opuscula Mathematica, 2005 In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj
A note on self-complementary 4-uniform hypergraphs [PDF]
Opuscula Mathematica, 2005 We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of \(\theta\) is a multiple of \(8\), (ii) \(\theta\) has \(1\), \(2\)
Artur Szymański
doaj