Results 11 to 20 of about 14,426,649 (305)

New refiners for permutation group search [PDF]

open access: yesJournal of symbolic computation, 2016
We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems.
Christopher Jefferson   +2 more
semanticscholar   +1 more source

Some codes and designs invariant under the groups $S_7$ and $S_8$ [PDF]

open access: yesJournal 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

A class of symmetric difference-closed sets related to commuting involutions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
To appear in Volume 19 of DMTCS.
John Campbell
doaj   +1 more source

Permutation-based group sequential analyses for cognitive neuroscience

open access: yesNeuroImage, 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

Series with Commuting Terms in Topologized Semigroups

open access: yesAxioms, 2021
We show that the following general version of the Riemann–Dirichlet theorem is true: if every rearrangement of a series with pairwise commuting terms in a Hausdorff topologized semigroup converges, then its sum range is a singleton.
Alberto Castejón   +2 more
doaj   +1 more source

Quasi-permutation Representations of Borel and Parabolic Subgroups of Steinberg's triality groups [PDF]

open access: yesIranian Journal of Numerical Analysis and Optimization, 2009
If G is a finite linear group of degree n, that is, a finite group of automor-phisms of an n-dimensional complex vector space, or equivalently, a finite group of non-singular matrices of order n with complex coefficients, we shall say that G is a quasi ...
M. Ghorbany
doaj   +1 more source

Four-point functions and the permutation group S 4 [PDF]

open access: yes, 2015
Four-point functions are at the heart of many interesting physical processes. A prime example is the light-by-light scattering amplitude, which plays an important role in the calculation of hadronic contributions to the anomalous magnetic moment of the ...
G. Eichmann, C. Fischer, Walter Heupel
semanticscholar   +1 more source

Generation modulo the action of a permutation group [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism.
Nicolas Borie
doaj   +1 more source

Cutoff for conjugacy-invariant random walks on the permutation group [PDF]

open access: yes, 2014
We prove a conjecture raised by the work of Diaconis and Shahshahani (Z Wahrscheinlichkeitstheorie Verwandte Geb 57(2):159–179, 1981) about the mixing time of random walks on the permutation group induced by a given conjugacy class. To do this we exploit
N. Berestycki, Batı Şengül
semanticscholar   +1 more source

3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs

open access: yesMathematical and Computational Applications, 2017
The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block ...
Xiaolian Liao, Guohua Chen, Shangzhao Li
doaj   +1 more source

Home - About - Disclaimer - Privacy