Results 11 to 20 of about 662 (278)
Maximal subgroups and PST-groups [PDF]
Open Mathematics, 2013 In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability ...
Ballester-Bolinches Adolfo +3 more
doaj +2 more sources
To permute or not to permute [PDF]
Bioinformatics, 2006 Abstract Permutation test is a popular technique for testing a hypothesis of no effect, when the distribution of the test statistic is unknown. To test the equality of two means, a permutation test might use a test statistic which is the difference of the two sample means in the univariate case.
Yifan Huang +3 more
openaire +2 more sources
Permutations on the Random Permutation [PDF]
The Electronic Journal of Combinatorics, 2015 The random permutation is the Fraïssé limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39 closed supergroups of the automorphism group of the random permutation, and thereby expose all symmetries of this ...
Julie Linman, Michael Pinsker
openaire +3 more sources
IEEE Transactions on Information Theory, 2023 Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure the distance a given map is from being a permutation. We prove several results concerning permutation resemblance and show how it can be used to produce low differentially ...
Li-An Chen, Robert S. Coulter
openaire +2 more sources
The Electronic Journal of Combinatorics, 2021 The concept of prolificity was previously introduced by the authors in the context of compositions of integers. We give a general interpretation of prolificity that applies across a range of relational structures defined in terms of counting embeddings.
Michael Albert 0001, Murray Tannock
openaire +1 more source
Cladistics, 1994 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/31724/1/0000662 ...
Farris, James S. +3 more
openaire +4 more sources
Non-permutability graph of subgroups
, 2021 Given a finite group $G$, the permutability graph of non-normal subgroups $\Gamma_{N}(G)$ is given by all proper non--normal subgroups of $G$ as vertex set and two vertices $H$ and $K$ are joined if $HK = KH$.
Russo F, Muhie SK, Otera DE
core +1 more source
Permutation tableaux and permutation patterns
Journal of Combinatorial Theory, Series A, 2007 Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Einar Steingrímsson, Lauren K. Williams
openaire +2 more sources
"A generalization to Sylow permutability of pronormal subgroups of finite groups" [PDF]
, 2020 In this note, we present a new subgroup embedding property that can be considered as an analogue of pronormality in the scope of permutability and Sylow permutability in finite groups.
Longobardi, P. +5 more
core +1 more source
Calculating Permutation Entropy without Permutations [PDF]
Complexity, 2020 A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the ...
openaire +3 more sources