Results 1 to 10 of about 2,138 (236)
Some subgroup embeddings in finite groups: A mini review [PDF]
Journal of Advanced Research, 2015 In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied.
A. Ballester-Bolinches +3 more
doaj +2 more sources
$n$-permutability and linear Datalog implies symmetric Datalog [PDF]
Logical Methods in Computer Science, 2018 We show that if $\mathbb A$ is a core relational structure such that CSP($\mathbb A$) can be solved by a linear Datalog program, and $\mathbb A$ is $n$-permutable for some $n$, then CSP($\mathbb A$) can be solved by a symmetric Datalog program (and thus ...
Alexandr Kazda
doaj +3 more sources
The Structure of EAP-Groups and Self-Autopermutable Subgroups [PDF]
The Scientific World Journal, 2014 A subgroup H of a given group G is said to be autopermutable, if HHα=HαH for all α∈AutG. We also call H a self-autopermutable subgroup of G, when HHα=HαH implies that Hα=H.
Shima Housieni +1 more
doaj +2 more sources
The Hole Argument and Some Physical and Philosophical Implications [PDF]
Living Reviews in Relativity, 2014 This is a historical-critical study of the hole argument, concentrating on the interface between historical, philosophical and physical issues. Although it includes a review of its history, its primary aim is a discussion of the contemporary implications
John Stachel
doaj +2 more sources
Cladistics, 1994 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/31724/1/0000662 ...
Farris, James S. +3 more
openaire +4 more sources
Permutabitity of principal MS-algebras
AIMS Mathematics, 2023 In this paper, we continue to introduce new properties of principal $ MS $-algebras deal with congruence relations via $ MS $-congruence pairs. Necessary and sufficient conditions for a pair of congruences $ (\theta_{1}, \theta_{2})\in Con(L^{\circ\circ})
Abd El-Mohsen Badawy, Alaa Helmy
doaj +1 more source
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 ...
Linman, Julie, Pinsker, Michael
openaire +3 more sources
Seminormal, Non-Normal Maximal Subgroups and Soluble PST-Groups [PDF]
Advances in Group Theory and Applications, 2016 All groups in this paper are finite. Let G be a group. Maximal subgroups of G are used to establish several new characterisations of soluble PST-groups.
J.C. Beidleman
doaj +1 more source
Finite Groups whose Cyclic Subnormal Subgroups Satisfy Certain Permutability Conditions [PDF]
Advances in Group Theory and Applications, 2016 Finite groups in which each cyclic subnormal subgroup is semipermutable, S-semipermutable or seminormal are investigated.
A. Ballester-Bolinches +2 more
doaj +1 more source
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