Factorisations courtes dans un groupe fini. (Short factorizations in a finite group) (Q1823315): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4166775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4121925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of connectivity theory in graphs to factorizations of elements in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quelques problèmes de connexite dans les graphes orientes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über den Zusammenhang symmetrischer Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Eigenschaft der Atome endlicher Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of Menger's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Number of Vertices of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank

Latest revision as of 10:38, 20 June 2024

scientific article
Language Label Description Also known as
English
Factorisations courtes dans un groupe fini. (Short factorizations in a finite group)
scientific article

    Statements

    Factorisations courtes dans un groupe fini. (Short factorizations in a finite group) (English)
    0 references
    1989
    0 references
    Given a finite group with a generating subset, exact upper bounds for the minimum length of a sequence of generators whose product is a given element are obtained.
    0 references
    finite group
    0 references
    length
    0 references
    generators
    0 references

    Identifiers