On the public citation graph

Gray codes for reflection groups

https://doi.org/10.1007/bf01788686
0 signed · 87 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1958.tb03887.xopenalex-snapshot
Gray Codes and Paths on the n-Cube
inferredcites →https://doi.org/10.1007/978-0-387-78835-7_1openalex-snapshot
Finite Reflection Groups
inferredcites →https://doi.org/10.1007/978-1-4757-1869-0openalex-snapshot
Finite Reflection Groups
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-662-21943-0openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1007/978-3-662-21946-1openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1007/bf01932689openalex-snapshot
A simplified loop-free algorithm for generating permutations
inferredcites →https://doi.org/10.1007/bf02941878openalex-snapshot
Gray-Codes
inferredcites →https://doi.org/10.1016/0012-365x(77)90143-1openalex-snapshot
Bounds on the number of Hamiltonian circuits in the n-cube
inferredcites →https://doi.org/10.1016/0012-365x(80)90169-7openalex-snapshot
Gray codes in graphs of subsets
inferredcites →https://doi.org/10.1016/0012-365x(83)90027-4openalex-snapshot
Non-repetitive sequences and gray code
inferredcites →https://doi.org/10.1016/0012-365x(84)90179-1openalex-snapshot
Gray codes with restricted density
inferredcites →https://doi.org/10.1016/0020-0190(76)90014-4openalex-snapshot
A gray code for set partitions
inferredcites →https://doi.org/10.1016/0020-0255(78)90020-8openalex-snapshot
On m-ary Gray codes
inferredcites →https://doi.org/10.1016/0167-8191(88)90087-7openalex-snapshot
Gray codes, Fast Fourier Transforms and hypercubes
inferredcites →https://doi.org/10.1016/0196-6774(82)90006-2openalex-snapshot
A Gray code for compositions
inferredcites →https://doi.org/10.1016/0196-6774(85)90040-9openalex-snapshot
Binary tree gray codes
inferredcites →https://doi.org/10.1016/0378-3758(81)90027-6openalex-snapshot
A technique for generating Gray codes
inferredcites →https://doi.org/10.1016/s0019-9958(63)90119-0openalex-snapshot
Affine m-ary gray codes
inferredcites →https://doi.org/10.1016/s0019-9958(84)80038-8openalex-snapshot
An approach for generating different types of gray codes
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7063-xopenalex-snapshot
Graphs, Groups and Surfaces
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/s0025557200055005openalex-snapshot
Generators and Relations for Discrete Groups. By H. S. M. Coxeter and W O. Moser. Pp. ix, 161. DM. 32. (Second Edition; Springer-Verlag)
inferredcites →https://doi.org/10.1017/s030500410002394xopenalex-snapshot
A campanological problem in group theory
inferredcites →https://doi.org/10.1017/s0305004100061053openalex-snapshot
Ringing the changes
inferredcites →https://doi.org/10.1038/scientificamerican0872-106openalex-snapshot
Mathematical Games
inferredcites →https://doi.org/10.1080/00029890.1987.12000711openalex-snapshot
Ringing the Cosets
inferredcites →https://doi.org/10.1080/02522667.1985.10698822openalex-snapshot
Two Recursive Algorithms for Generating the Binary Reflected Gray Code
inferredcites →https://doi.org/10.1080/03772063.1986.11436568openalex-snapshot
Reduced Look-Up Table for Gray to Binary Conversion
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0151950-2openalex-snapshot
Some complete cycles on the 𝑛-cube
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0369157-0openalex-snapshot
On the Number of Hamiltonian Circuits in the n-Cube
inferredcites →https://doi.org/10.1090/s0025-5718-1963-0159764-2openalex-snapshot
Generation of Permutations by Adjacent Transposition
inferredcites →https://doi.org/10.1109/pgec.1966.264389openalex-snapshot
Note on Finite-Memory Sequential Machines
inferredcites →https://doi.org/10.1109/pgec.1966.264390openalex-snapshot
An Algorithm for Gray-to-Binary Conversion
inferredcites →https://doi.org/10.1109/proc.1977.10754openalex-snapshot
A fast analog to gray code converter
inferredcites →https://doi.org/10.1109/t-c.1969.222736openalex-snapshot
A Gray Code Counter
inferredcites →https://doi.org/10.1109/t-c.1973.223681openalex-snapshot
Distance-2 Cyclic Chaining of Constant-Weight Codes
inferredcites →https://doi.org/10.1109/t-c.1974.224004openalex-snapshot
A New Explanation of the Reflected Binary Code
inferredcites →https://doi.org/10.1109/tc.1976.1674648openalex-snapshot
Signed Modified Reflected Binary Code
inferredcites →https://doi.org/10.1109/tc.1980.1675573openalex-snapshot
A Technique for Generating Specialized Gray Codes
inferredcites →https://doi.org/10.1109/tc.1984.5009360openalex-snapshot
On Generating the N-ary Reflected Gray Codes
inferredcites →https://doi.org/10.1109/tec.1956.5219803openalex-snapshot
Reflected Number Systems
inferredcites →https://doi.org/10.1109/tec.1959.5222057openalex-snapshot
Arithmetic Operations for Digital Computers Using a Modified Reflected Binary Code
inferredcites →https://doi.org/10.1109/tit.1974.1055275openalex-snapshot
The separability of Gray code (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055424openalex-snapshot
An upper bound associated with errors in Gray code (Corresp.)
inferredcites →https://doi.org/10.1137/0209013openalex-snapshot
Combinatorial Gray Codes
inferredcites →https://doi.org/10.1145/321765.321781openalex-snapshot
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
inferredcites →https://doi.org/10.1145/360336.360343openalex-snapshot
Efficient generation of the binary reflected gray code and its applications
inferredcites →https://doi.org/10.1145/368637.368660openalex-snapshot
Algorithm 115: Perm
inferredcites →https://doi.org/10.1145/88560.88575openalex-snapshot
Contour tracing by piecewise linear approximations
inferredcites →https://doi.org/10.2307/2308050openalex-snapshot
The n-Dimensional Cube and the Tower of Hanoi
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.4153/cmb-1966-068-6openalex-snapshot
Hamiltonian Circuits and Paths on the n-Cube
inferredcites →https://doi.org/10.4153/cmb-1974-137-9openalex-snapshot
Hamiltonian Circuits on the N-Cube
inferredcites →https://doi.org/10.5948/upo9780883859292openalex-snapshot
Groups and Their Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-27596-7_3openalex-snapshot
Weak order and reduced words
inferred← citeshttps://doi.org/10.1007/978-94-011-3382-1_9openalex-snapshot
Coxeter Groups and three Related Topics
inferred← citeshttps://doi.org/10.1007/bf00156752openalex-snapshot
Gray codes for randomization procedures
inferred← citeshttps://doi.org/10.1007/s10619-009-7045-8openalex-snapshot
Multi-dimensional data density estimation in P2P networks
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00072-5openalex-snapshot
Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90090-xopenalex-snapshot
Gray code enumeration of families of integer partitions
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.amc.2006.07.163openalex-snapshot
On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.017openalex-snapshot
Hamilton cycles and paths in vertex-transitive graphs—Current directions
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.003openalex-snapshot
Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.002openalex-snapshot
The odd–even invariant and Hamiltonian circuits in tope graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104367openalex-snapshot
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.021openalex-snapshot
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00516-2openalex-snapshot
Graphs induced by Gray codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00188-5openalex-snapshot
Explicit definition of the binary reflected Gray codes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00041-3openalex-snapshot
On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
inferred← citeshttps://doi.org/10.1016/s0306-4573(96)00061-1openalex-snapshot
Browsing document collections: Automatically organizing digital libraries and hypermedia using the gray code
inferred← citeshttps://doi.org/10.1080/17445760.2013.822498openalex-snapshot
Parallel binary reflected Gray code sequence generation on multicore architectures
inferred← citeshttps://doi.org/10.1088/0305-4470/38/41/007openalex-snapshot
A fractal set from the binary reflected Gray code
inferred← citeshttps://doi.org/10.1090/crmp/006/09openalex-snapshot
On groups generated by three involutions, two of which commute
inferred← citeshttps://doi.org/10.1109/icfcc.2009.41openalex-snapshot
Algorithms for Generating Binary Reflected Gray Code Sequence: Time Efficient Approaches
inferred← citeshttps://doi.org/10.1137/0406012openalex-snapshot
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
inferred← citeshttps://doi.org/10.1137/s0036144595295272openalex-snapshot
A Survey of Combinatorial Gray Codes
inferred← citeshttps://doi.org/10.1142/s0219498826500544openalex-snapshot
Hamiltonian cycles for finite Weyl groupoids
inferred← citeshttps://doi.org/10.1142/s1793830919300029openalex-snapshot
A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
inferred← citeshttps://doi.org/10.1214/aoap/1019487508openalex-snapshot
Analysis of a nonreversible Markov chain sampler
inferred← citeshttps://doi.org/10.2298/pim0578087lopenalex-snapshot
Note on Gray codes for permutation lists
inferred← citeshttps://doi.org/10.2298/pim1103037kopenalex-snapshot
A loopless implementation of a gray code for signed permutations
inferred← citeshttps://doi.org/10.24200/tjer.vol6iss2pp12-19openalex-snapshot
A Less Complex Algorithmic Procedure for Computing Gray Codes
inferred← citeshttps://doi.org/10.26493/1855-3974.509.d9dopenalex-snapshot
Hamilton paths in Cayley graphs on Coxeter groups: I
inferred← citeshttps://doi.org/10.37236/11023openalex-snapshot
Combinatorial Gray Codes — an Updated Survey
inferred← citeshttps://doi.org/10.4171/jems/96openalex-snapshot
Hamiltonicity of cubic Cayley graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.