Periods of strongly connected multivariate digraphs

DOI10.1016/J.JCTA.2025.106156MaRDI QIDQ6844352zbMATH OpenFDO

Authors Chengyang Qian, Yaokun Wu, Yinfeng Zhu

Publication date 14 March 2026

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2025.106156

zbMATH Keywords

\(t\)-difference setcyclic decompositiondeflation setdiagonal positiondiscrete boxheight

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An expansion property of Boolean linear maps
• Binary de Bruijn partial words with one hole
• Combinatorial Matrix Theory
• Cyclic arrangements with minimum modulo \(m\) winding numbers
• De Bruijn digraphs and affine transformations
• Finite algebras of finite complexity
• Highly arc transitive digraphs
• scientific article; zbMATH DE number 1687034 (Why is no real title available?)
• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• scientific article; zbMATH DE number 1834684 (Why is no real title available?)
• Kleitman and combinatorics
• Maximal state complexity and generalized de Bruijn words
• Minimal partitions of a box into boxes
• Numerical semigroups and applications
• Numerical semigroups.
• Numerical semigroups. Proceedings of the INdAM international meeting on numerical semigroups, IMNS 2018, Cortona, Italy, September 3--7, 2018
• On 2-colored graphs and partitions of boxes
• On a Problem of Partitions
• On Hierarchies of Balanced Sequences
• On partitions of discrete boxes
• On partitions of two-dimensional discrete boxes
• On shortening u-cycles and u-words for permutations
• On the existence of balanced generalized de Bruijn sequences
• On universal partial words
• On universal partial words
• On universal partial words for word-patterns and set partitions
• Partial words and a theorem of Fine and Wilf
• Partition problems in high dimensional boxes
• Polyboxes, cube tilings and rigidity
• Query complexity of sampling and small geometric partitions
• Shortened universal cycles for permutations
• Some characterizations for the wrapped butterfly
• Square-free partial words with many wildcards
• Strongly connected multivariate digraphs
• The complexity of computing the period and the exponent of a digraph
• Universal cycles for combinatorial structures
• Universal Lyndon words
• Universal partial words over non-binary alphabets
• Using alternating de Bruijn sequences to construct de Bruijn tori

This page was built for publication: Periods of strongly connected multivariate digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844352)