On Burnside's Problem - MaRDI portal

Cited in

(91)

Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras.
Shuffle-compatible total orders
Combinatorics of Hall trees and Hall words
Average cost of Duval's algorithm for generating Lyndon words
BPS operators in $ \mathcal{N}=4 $ SO($N$) super Yang-Mills theory: plethysms, dominoes and words
Binomial species and combinatorial exponentiation
A probabilistic spatial distribution model for wire faults in parallel network-on-chip links
$k$-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials
Period recovery of strings over the Hamming and edit distances
A survey of string orderings and their application to the Burrows-Wheeler transform
Root multiplicities for Borcherds algebras and graph coloring
On interpolation functions for the number of k-ary Lyndon words associated with the Apostol-Euler numbers and their applications
The standard factorization of Lyndon words: an average point of view
Inverse Lyndon words and inverse Lyndon factorizations of words
Lyndon-like and V-order factorizations of strings
A basis for iterated stochastic integrals
Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
Growth of structure constants of free Lie algebras relative to Hall bases
\texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams
Can formal languages help pangenomics to represent and analyze multiple genomes?
Computing longest (common) Lyndon subsequences
Reprint of: ``Generalized Lyndon factorizations of infinite words
Quantizations $U_q (\mathfrak{sl}_{n + 1}^+)$ and $U_q (\mathfrak{so}_{2n + 1}^+)$ as quadratic-linear algebras
Dynamic and internal longest common substring
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
On the size of the smallest alphabet for Lyndon trees
Gröbner-Shirshov bases for some Lie algebras
Indeterminate string factorizations and degenerate text transformations
Counting Lyndon factors
Inferring strings from Lyndon factorization
On generalized Lyndon words
Gröbner-Shirshov bases for Vinberg-Koszul-Gerstenhaber right-symmetric algebras
Linear construction of a left Lyndon tree
Analysis of generating functions for special words and numbers and algorithms for computation
From Lie algebra crossed modules to tensor hierarchies
On the Lyndon dynamical system
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
Gröbner–Shirshov bases of the Lie algebra $D^{+}_{n}$
Gröbner-Shirshov bases of the Lie algebra B_n^+
Shuffle and Faà di Bruno Hopf algebras in the center problem for ordinary differential equations
Torsion in Engel Modules
Transfinite Lyndon words
scientific article; zbMATH DE number 3910655 (Why is no real title available?)
Schur Multipliers of Some Finite Nilpotent Groups
Computation of maximal determinants of binary circulant matrices
Analytic computing methods for precision calculations in quantum field theory
Normal amenable subgroups of the automorphism group of sofic shifts
Analytic integration methods in quantum field theory: an introduction
Computation of k-ary Lyndon words using generating functions and their differential equations
Longest common substring made fully dynamic
Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions
Some variations on Lyndon words (invited talk)
Indexing the bijective BWT
2D Lyndon words and applications
Almost linear time computation of maximal repetitions in run length encoded strings
Transfinite Lyndon words
Longest Lyndon Substring After Edit
Gröbner-Shirshov bases and their calculation
Harmonic sums, polylogarithms, special numbers, and their generalizations
The ``runs theorem
Asymptotic behavior of some factorizations of random words
Computing longest Lyndon subsequences and longest common Lyndon subsequences
Algorithms for pixelwise shape deformations preserving digital convexity
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
On longest common property preserved substring queries
Gröbner-Shirshov bases for Lie algebras over a commutative algebra
Internal pattern matching queries in a text and applications
Word-representable graphs from a word's perspective
Lyndon pairs and the lexicographically greatest perfect necklace
On the Nowicki conjecture for the free Lie algebra of rank 2
Certain classes of combinatorial polynomials involving (inverse) binomial coefficients with their applications
Weighted prefix normal words
De Bruijn sequences: from games to shift-rules to a proof of the Fredricksen-Kessler-Maiorana theorem
The dimension of the region of feasible tournament profiles
Generalised Nyldon words
Periodic orbits on 2-regular circulant digraphs
On quantization of the Lie algebra G2+
The dimension of the feasible region of pattern densities
Unveiling the connection between the Lyndon factorization and the canonical inverse Lyndon factorization via a border property
Edit and alphabet-ordering sensitivity of lex-parse
The Collatz conjecture and de Bruijn graphs
On Hurwitz multizeta functions
New results on Nyldon words and Nyldon-like sets
Lyndon words formalized in Isabelle/HOL
Algebraic relations between harmonic sums and associated quantities.
A right normed basis for free Lie algebras and Lyndon-Shirshov words
The origins of combinatorics on words

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)