On Burnside's Problem
From MaRDI portal
Publication:5831360
DOI10.2307/1990868zbMATH Open0058.01702OpenAlexW4250249241WikidataQ56030659 ScholiaQ56030659MaRDI QIDQ5831360FDOQ5831360
Authors: Roger C. Lyndon
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
Cited In (80)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- New results on Nyldon words and Nyldon-like sets
- Longest Lyndon Substring After Edit
- Gröbner-Shirshov bases for Vinberg-Koszul-Gerstenhaber right-symmetric algebras
- A probabilistic spatial distribution model for wire faults in parallel network-on-chip links
- The Collatz conjecture and de Bruijn graphs
- Lyndon words formalized in Isabelle/HOL
- On interpolation functions for the number of \(k\)-ary Lyndon words associated with the Apostol-Euler numbers and their applications
- Asymptotic behavior of some factorizations of random words
- Algorithms for pixelwise shape deformations preserving digital convexity
- On the Lyndon dynamical system
- Quantizations \(U_q (\mathfrak{sl}_{n + 1}^+)\) and \(U_q (\mathfrak{so}_{2n + 1}^+)\) as quadratic-linear algebras
- Shuffle-compatible total orders
- Inferring strings from Lyndon factorization
- \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams
- Harmonic sums, polylogarithms, special numbers, and their generalizations
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- BPS operators in \( \mathcal{N}=4 \) SO(\(N\)) super Yang-Mills theory: plethysms, dominoes and words
- Binomial species and combinatorial exponentiation
- Computation of maximal determinants of binary circulant matrices
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- On generalized Lyndon words
- Analysis of generating functions for special words and numbers and algorithms for computation
- The standard factorization of Lyndon words: an average point of view
- Gröbner-Shirshov bases and their calculation
- Gröbner–Shirshov bases of the Lie algebra $D^{+}_{n}$
- Dynamic and internal longest common substring
- Combinatorics of Hall trees and Hall words
- Gröbner-Shirshov bases of the Lie algebra \(B_n^+\)
- The origins of combinatorics on words
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Gröbner-Shirshov bases for some Lie algebras
- On Hurwitz multizeta functions
- Average cost of Duval's algorithm for generating Lyndon words
- Analytic computing methods for precision calculations in quantum field theory
- Almost linear time computation of maximal repetitions in run length encoded strings
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
- Shuffle and Faà di Bruno Hopf algebras in the center problem for ordinary differential equations
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Algebraic relations between harmonic sums and associated quantities.
- Counting Lyndon factors
- From Lie algebra crossed modules to tensor hierarchies
- The ``runs theorem
- Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras.
- Computing longest (common) Lyndon subsequences
- \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Period recovery of strings over the Hamming and edit distances
- Gröbner-Shirshov bases for Lie algebras over a commutative algebra
- A basis for iterated stochastic integrals
- Reprint of: ``Generalized Lyndon factorizations of infinite words
- Lyndon-like and V-order factorizations of strings
- Computation of k-ary Lyndon words using generating functions and their differential equations
- Growth of structure constants of free Lie algebras relative to Hall bases
- 2D Lyndon words and applications
- A right normed basis for free Lie algebras and Lyndon-Shirshov words
- Root multiplicities for Borcherds algebras and graph coloring
- Title not available (Why is that?)
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Transfinite Lyndon words
- Longest common substring made fully dynamic
- Indexing the bijective BWT
- Normal amenable subgroups of the automorphism group of sofic shifts
- On the size of the smallest alphabet for Lyndon trees
- Torsion in Engel Modules
- Title not available (Why is that?)
- Analytic integration methods in quantum field theory: an introduction
- Indeterminate string factorizations and degenerate text transformations
- Schur Multipliers of Some Finite Nilpotent Groups
- Internal pattern matching queries in a text and applications
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches
- Word-representable graphs from a word's perspective
- Braided shuffle algebras and Lyndon words
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions
- Transfinite Lyndon words
- Linear construction of a left Lyndon tree
- Lyndon pairs and the lexicographically greatest perfect necklace
- On longest common property preserved substring queries
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
This page was built for publication: On Burnside's Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5831360)