Cyclic arrangements with minimum modulo m winding numbers

DOI10.1007/S00373-021-02443-1MaRDI QIDQ2117515zbMATHOpenAlexFDO

Authors Chengyang Qian, Yaokun Wu, Yanzhen Xiong

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

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)

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\)

Cites work

• scientific article; zbMATH DE number 5606342 (Why is no real title available?)
• scientific article; zbMATH DE number 17941 (Why is no real title available?)
• scientific article; zbMATH DE number 3248816 (Why is no real title available?)
• scientific article; zbMATH DE number 2239558 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A bijective proof of a theorem of Knuth
• An extension of a theorem of Fulkerson and Gross
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Balanced Gray codes
• Balanced Maximum Counting Sequences
• Balancing cyclic \(R\)-ary Gray codes
• Balancing cyclic \(R\)-ary Gray codes. II.
• Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Circular-arc hypergraphs: rigidity via connectedness
• Combinatorial Configurations
• Common coordinates in consecutive addresses
• Completely uniformly distributed sequences based on de Bruijn sequences
• Counting sequences
• De Bruijn digraphs and affine transformations
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
• Incidence matrices and interval graphs
• Interval graphs: canonical representations in logspace
• Isomorphism of graph classes related to the circular-ones property
• Matrix characterizations of circular-arc graphs
• Obtaining matrices with the consecutive ones property by row deletions
• On double and multiple interval graphs
• PC trees and circular-ones arrangements.
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The maximum clique problem in multiple interval graphs
• The separability of standard cyclic N-ary Gray codes
• Twills with bounded float length

Cited in

(1)

• Asking questions to determine the product of circularly arranged numbers

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)