Results 1 to 10 of about 329,666 (328)
Modeling Quantum Behavior in the Framework of Permutation Groups
EPJ Web of Conferences, 2018 Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group.
Kornyak Vladimir
doaj +3 more sources
Permutation-Based Distances for Groups and Group-Valued Time Series [PDF]
EntropyPermutations on a set, endowed with function composition, build a group called a symmetric group. In addition to their algebraic structure, symmetric groups have two metrics that are of particular interest to us here: the Cayley distance and the Kendall ...
José M. Amigó, Roberto Dale
doaj +2 more sources
Permutations of massive vacua [PDF]
Journal of High Energy Physics, 2017 We discuss the permutation group G of massive vacua of four-dimensional gauge theories with N $$ \mathcal{N} $$ = 1 supersymmetry that arises upon tracing loops in the space of couplings. We concentrate on superconformal N $$ \mathcal{N} $$ = 4 and N $$ \
Antoine Bourget, Jan Troost
doaj +5 more sources
The character table of a sharply 5-transitive subgroup of the alternating group of degree 12 [PDF]
International Journal of Group Theory, 2021 We calculate the character table of a sharply $5$-transitive subgroup of $\alter(12)$, and of a sharply $4$-transitive subgroup of $\alter(11)$. Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu
Nick Gill, Sam Hughes
doaj +1 more source
Cubic Cayley graphs with small diameter. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper we apply Polya's Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group.
Eugene Curtin
doaj +3 more sources
Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure ...
Nicolas Thiéry
doaj +1 more source
Application of a permutation group on sasirangan pattern
Desimal, 2021 A permutation group is a group of all permutations of some set. If the set that forms a permutation group is the n-first of natural number, then a permutation group is called a symmetry group.
Na'imah Hijriati +3 more
doaj +1 more source
A class of symmetric difference-closed sets related to commuting involutions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 To appear in Volume 19 of DMTCS.
John Campbell
doaj +1 more source
Some codes and designs invariant under the groups $S_7$ and $S_8$ [PDF]
Journal of Mahani Mathematical Research, 2023 We use the Key-Moori Method 1 and examine 1-designs and codes from the representations of the alternating group $A_7$. It is shown that a self-dual symmetric 2-$(35,18,9)$ design and an optimal even binary $[21,14,4]$ LCD code are found such that they ...
Reza Kahkeshani
doaj +1 more source
Permutation-based group sequential analyses for cognitive neuroscience
NeuroImage, 2023 Cognitive neuroscientists have been grappling with two related experimental design problems. First, the complexity of neuroimaging data (e.g. often hundreds of thousands of correlated measurements) and analysis pipelines demands bespoke, non-parametric ...
John P. Veillette +2 more
doaj +1 more source