The following pages link to (Q4341774):
Displaying 50 items.
- Algebras of Finite Global Dimension (Q5261554) (← links)
- Graph Logics with Rational Relations (Q5278208) (← links)
- Random graph languages (Q5347254) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- Watson-Crick Conjugate and Commutative Words (Q5452701) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- Schwinger–Dyson operators as invariant vector fields on a matrix model analog of the group of loops (Q5504946) (← links)
- Two-Dimensional Palindromes and Their Properties (Q5738994) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
- (Q5874500) (← links)
- (Q5887816) (← links)
- Reducing the ambiguity of Parikh matrices (Q5918142) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Equations enforcing repetitions under permutations (Q5918930) (← links)
- Generalized Lyndon factorizations of infinite words (Q5919346) (← links)
- Substitutions and interval exchange transformations of rotation class (Q5941075) (← links)
- Automatic sequences: from rational bases to trees (Q6045415) (← links)
- Down-step statistics in generalized Dyck paths (Q6045418) (← links)
- Asymptotic behavior of some factorizations of random words (Q6052484) (← links)
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity (Q6070008) (← links)
- A simple homological characterization of string algebras of finite representation type (Q6070274) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Rooted quasi-Stirling permutations of general multisets (Q6098012) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)
- Binary codes that do not preserve primitivity (Q6111526) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
- HV-Palindromes in Two-Dimensional Words (Q6114875) (← links)
- A Lie bracket for the momentum kernel (Q6116792) (← links)
- Lie structure of the Heisenberg-Weyl algebra (Q6118373) (← links)
- Decidable problems in substitution shifts (Q6126479) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)
- Tree-level amplitudes from the pure spinor superstring (Q6155503) (← links)
- Rich words in the block reversal of a word (Q6157425) (← links)
- On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino (Q6160796) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- A unified framework for double sweep methods for the Helmholtz equation (Q6173336) (← links)
- On forced periodicity of perfect colorings (Q6174652) (← links)
- Combinatorial approach of unified Apostol-type polynomials using \(\alpha \)-distanced words (Q6180562) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Braided shuffle algebras and Lyndon words (Q6203875) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms (Q6559402) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- Smirnov words and the delta conjectures (Q6608707) (← links)
- The Frobenius transform of a symmetric function (Q6614048) (← links)
- A note on the maximum number of \(k\)-powers in a finite word (Q6614167) (← links)
- Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) (Q6614621) (← links)
