On Burnside's Problem
From MaRDI portal
Publication:5831360
DOI10.2307/1990868zbMath0058.01702OpenAlexW4250249241WikidataQ56030659 ScholiaQ56030659MaRDI QIDQ5831360
Publication date: 1954
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1990868
Related Items (77)
New results on Nyldon words and Nyldon-like sets ⋮ Gröbner-Shirshov bases for some Lie algebras ⋮ Indeterminate string factorizations and degenerate text transformations ⋮ On the Lyndon dynamical system ⋮ Average cost of Duval's algorithm for generating Lyndon words ⋮ \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams ⋮ Lyndon words formalized in Isabelle/HOL ⋮ Transfinite Lyndon Words ⋮ BPS operators in \( \mathcal{N}=4 \) SO(\(N\)) super Yang-Mills theory: plethysms, dominoes and words ⋮ Binomial species and combinatorial exponentiation ⋮ Shuffle and Faà di Bruno Hopf algebras in the center problem for ordinary differential equations ⋮ A basis for iterated stochastic integrals ⋮ Algebraic relations between harmonic sums and associated quantities. ⋮ Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids ⋮ A right normed basis for free Lie algebras and Lyndon-Shirshov words ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ Counting Lyndon factors ⋮ Analytic computing methods for precision calculations in quantum field theory ⋮ A probabilistic spatial distribution model for wire faults in parallel network-on-chip links ⋮ Inferring strings from Lyndon factorization ⋮ Computing longest (common) Lyndon subsequences ⋮ The origins of combinatorics on words ⋮ Shuffle-compatible total orders ⋮ Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions ⋮ Linear construction of a left Lyndon tree ⋮ Asymptotic behavior of some factorizations of random words ⋮ On generalized Lyndon words ⋮ Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ Analysis of generating functions for special words and numbers and algorithms for computation ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials ⋮ The “Runs” Theorem ⋮ Algorithms for pixelwise shape deformations preserving digital convexity ⋮ Period recovery of strings over the Hamming and edit distances ⋮ A survey of string orderings and their application to the Burrows-Wheeler transform ⋮ From Lie algebra crossed modules to tensor hierarchies ⋮ Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches ⋮ Braided shuffle algebras and Lyndon words ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ Quantizations \(U_q (\mathfrak{sl}_{n + 1}^+)\) and \(U_q (\mathfrak{so}_{2n + 1}^+)\) as quadratic-linear algebras ⋮ Root multiplicities for Borcherds algebras and graph coloring ⋮ Dynamic and internal longest common substring ⋮ Gröbner-Shirshov bases for Lie algebras over a commutative algebra ⋮ Gröbner-Shirshov bases for Vinberg-Koszul-Gerstenhaber right-symmetric algebras ⋮ On interpolation functions for the number of \(k\)-ary Lyndon words associated with the Apostol-Euler numbers and their applications ⋮ Combinatorics of Hall trees and Hall words ⋮ 2D Lyndon words and applications ⋮ Gröbner–Shirshov bases of the Lie algebra $D^{+}_{n}$ ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Unnamed Item ⋮ Gröbner–Shirshov bases and their calculation ⋮ Computation of Maximal Determinants of Binary Circulant Matrices ⋮ The standard factorization of Lyndon words: an average point of view ⋮ Unnamed Item ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ The Collatz conjecture and de Bruijn graphs ⋮ Normal amenable subgroups of the automorphism group of sofic shifts ⋮ Gröbner–Shirshov bases of the Lie algebra $B_n^+$ ⋮ Longest common substring made fully dynamic ⋮ On Hurwitz multizeta functions ⋮ Generalized Lyndon factorizations of infinite words ⋮ Indexing the bijective BWT ⋮ Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Lyndon-like and V-order factorizations of strings ⋮ Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras. ⋮ Unnamed Item ⋮ On the size of the smallest alphabet for Lyndon trees ⋮ Torsion in Engel Modules ⋮ Harmonic Sums, Polylogarithms,Special Numbers, and Their Generalizations ⋮ Growth of structure constants of free Lie algebras relative to Hall bases ⋮ Schur Multipliers of Some Finite Nilpotent Groups ⋮ Analytic Integration Methods in Quantum Field Theory: An Introduction ⋮ Almost linear time computation of maximal repetitions in run length encoded strings ⋮ Longest Lyndon Substring After Edit ⋮ Computation of k-ary Lyndon words using generating functions and their differential equations
This page was built for publication: On Burnside's Problem
