Generating 2-Gray codes for ballot sequences in constant amortized time

DOI10.1016/j.disc.2022.113168zbMath1502.05014OpenAlexW4298113091MaRDI QIDQ2092396

Yanyan Li

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113168

zbMATH Keywords

gray codeCAT algorithmballot sequenceDyck wordsbinary reflected gray codeflip-swap language

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Stochastic processes (60G99)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of bidirectional ballot sequences and random walks ending in their maximum
• Direct consequences of the basic ballot theorem
• Binary bubble languages and cool-lex order
• Knights, spies, games and ballot sequences
• The ballot problem with three candidates
• Constructing MSTD sets using bidirectional ballot sequences
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Enumeration via ballot numbers
• Flip-swap languages in binary reflected Gray code order
• Lost (and Found) in Translation: André's Actual Method and Its Application to the Generalized Ballot Problem
• Four Proofs of the Ballot Theorem
• Generation of Binary Trees from Ballot Sequences
• Generation oft-ary trees with Ballot-sequences^*
• On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order
• Some Aspects of the Random Sequence

This page was built for publication: Generating 2-Gray codes for ballot sequences in constant amortized time