scientific article; zbMATH DE number 7527483
From MaRDI portal
Publication:5076252
zbMath1499.05013MaRDI QIDQ5076252
Publication date: 16 May 2022
Full work available at URL: http://www.pphmj.com/abstract/5835.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Sets with a single binary operation (groupoids) (20N02)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-restricted rotation distance between binary trees
- From nonassociativity to solutions of the KP hierarchy
- Weak associativity and restricted rotation
- Generating binary trees by Glivenko classes on Tamari lattices
- Right-arm rotation distance between binary trees
- About nonassociativity in mathematics and physics
- Rational languages defined with a non-associative concatenation
- Quasigroups, loops, and associative laws
- Restricted rotation distance between binary trees.
- Algebra VI. Combinatorial and asymptotic methods of algebra. Non- associative structures. Transl. from the Russian by R. M. Dimitrić
- Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
- Effective splaying with restricted rotations
- Nonassociativity à la Kleene
- WEAKLY NON-ASSOCIATIVE ALGEBRAS AND THE KADOMTSEV–PETVIASHVILI HIERARCHY
- Enumerating, Ranking and Unranking Binary Trees
- A decidable word problem without equivalent canonical term rewriting system
- Lower Bounds for Accessing Binary Search Trees with Rotations
- Relaxed balance using standard rotations
This page was built for publication:
