Cyclic arrangements with minimum modulo m winding numbers

DOI10.1007/S00373-021-02443-1zbMATH Open1485.05019OpenAlexW4220755810MaRDI QIDQ2117515FDOQ2117515

Yanzhen Xiong, Chengyang Qian, Yaokun Wu

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02443-1

Recommendations

• On cyclic compositions of positive integers
• scientific article; zbMATH DE number 468876
• On a problem of Molluzzo concerning Steinhaus triangles in finite cyclic groups
• A type of special circular sequence: \((k,q)\)-flat sequence
• Sum sequences modulo \(n\)

zbMATH Keywords

gray codewinding numbercircular-ones propertyconsecutive-ones property

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics on words (68R15) Other types of codes (94B60)

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• Interval Graphs: Canonical Representations in Logspace
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
• De Bruijn digraphs and affine transformations
• Title not available (Why is that?)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• PC trees and circular-ones arrangements.
• Matrix characterizations of circular-arc graphs
• Balanced Gray codes
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• A Bijective Proof of a Theorem of Knuth
• On double and multiple interval graphs
• Circular-arc hypergraphs: rigidity via connectedness
• Balancing cyclic \(R\)-ary Gray codes. II.
• Balancing cyclic \(R\)-ary Gray codes
• An extension of a theorem of Fulkerson and Gross
• The maximum clique problem in multiple interval graphs
• Combinatorial Configurations
• Counting sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• The separability of standard cyclic N-ary Gray codes
• Balanced Maximum Counting Sequences
• Title not available (Why is that?)
• Completely uniformly distributed sequences based on de Bruijn sequences
• Obtaining matrices with the consecutive ones property by row deletions
• Common coordinates in consecutive addresses
• Twills with bounded float length
• Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property

This page was built for publication: Cyclic arrangements with minimum modulo \(m\) winding numbers

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