3 citations · 5 across the 6 of their papers we have counts for
7 papers
Symmetry Implies Isomorphism for Certain Maximum Length Circuit Codes
Kevin M. Byrnes
A classic result due to Douglas establishes that, for odd spread and dimension , all maximum length circuit codes are isomorphic. Using a recent re…
The Maximum Length and Isomorphism of Circuit Codes with Long Bit Runs
Kevin M. Byrnes
Recently, Byrnes presented a formula for the maximum length of a symmetric circuit code that has a long bit run and odd spread. Here we show that the formula is also valid when the…
On the Asymptotic Order of Circuit Codes
Kevin M. Byrnes, Florin Spinu
In this note we prove that the maximum length of a -dimensional circuit code of spread equals , with the implied constant depending only on .
The Maximum Length of Circuit Codes With Long Bit Runs and a New Characterization Theorem
Kevin M. Byrnes
We study circuit codes with long bit runs (sequences of distinct transitions) and derive a formula for the maximum length for an infinite class of symmetric circuit codes with long…
A New Method for Constructing Circuit Codes
Kevin M. Byrnes
Circuit codes are constructed from induced cycles in the graph of the dimensional hypercube. They are both theoretically and practically important, as circuit codes can be used…
A Non-Degenerate Perturbation of the Assignment Polytope and its Application to Graph Matching
Kevin M. Byrnes
We consider maximizing a continuous convex function over the assignment polytope. Such problems arise in Graph Matching (the optimization version of Graph Isomorphism) and Quadrati…
Maximizing General Set Functions by Submodular Decomposition
Kevin Byrnes
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut functio…