37 research outputs found
Generating strings for bipartite Steinhaus graphs
AbstractLet b(n) be the number of bipartite Steinhaus graphs with n vertices. We show that b(n) satisfies the recurrence, b(2) = 2, b(3) = 4, and for k ⩾ 2, b(2k + 1) = 2b(k + 1) + 1, b(2k) = b(k) + b(k + 1). Thus b(n) ⩽ 52n − 72 with equality when n is one more than a power of two. To prove this recurrence, we describe the possible generating strings for these bipartite graphs
Regular Steinhaus graphs of odd degree
A Steinhaus matrix is a binary square matrix of size which is symmetric,
with diagonal of zeros, and whose upper-triangular coefficients satisfy
for all . Steinhaus matrices
are determined by their first row. A Steinhaus graph is a simple graph whose
adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem,
due to Dymacek, which states that even Steinhaus graphs, i.e. those with all
vertex degrees even, have doubly-symmetric Steinhaus matrices. In 1979 Dymacek
conjectured that the complete graph on two vertices is the only regular
Steinhaus graph of odd degree. Using Dymacek's theorem, we prove that if
is a Steinhaus matrix associated with a regular
Steinhaus graph of odd degree then its sub-matrix is a multi-symmetric matrix, that is a doubly-symmetric matrix where each
row of its upper-triangular part is a symmetric sequence. We prove that the
multi-symmetric Steinhaus matrices of size whose Steinhaus graphs are
regular modulo 4, i.e. where all vertex degrees are equal modulo 4, only depend
on parameters for all even numbers , and on
parameters in the odd case. This result permits us
to verify the Dymacek's conjecture up to 1500 vertices in the odd case.Comment: 16 page
Balanced simplices
An additive cellular automaton is a linear map on the set of infinite
multidimensional arrays of elements in a finite cyclic group
. In this paper, we consider simplices appearing in the
orbits generated from arithmetic arrays by additive cellular automata. We prove
that they are a source of balanced simplices, that are simplices containing all
the elements of with the same multiplicity. For any
additive cellular automaton of dimension or higher, the existence of
infinitely many balanced simplices of appearing in
such orbits is shown, and this, for an infinite number of values . The
special case of the Pascal cellular automata, the cellular automata generating
the Pascal simplices, that are a generalization of the Pascal triangle into
arbitrary dimension, is studied in detail.Comment: 33 pages ; 11 figures ; 1 tabl
Recommended from our members
Cycles and Cliques in Steinhaus Graphs
In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian
Combinatorial generation via permutation languages
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations.
This approach provides a unified view on many known results and allows us to prove many new ones.
In particular, we obtain the following four classical Gray codes as special cases: the Steinhaus-Johnson-Trotter algorithm to generate all permutations of an -element set by adjacent transpositions; the binary reflected Gray code to generate all -bit strings by flipping a single bit in each step; the Gray code for generating all -vertex binary trees by rotations due to Lucas, van Baronaigien, and Ruskey; the Gray code for generating all partitions of an -element ground set by element exchanges due to Kaye.
We present two distinct applications for our new framework:
The first main application is the generation of pattern-avoiding permutations, yielding new Gray codes for different families of permutations that are characterized by the avoidance of certain classical patterns, (bi)vincular patterns, barred patterns, Bruhat-restricted patterns, mesh patterns, monotone and geometric grid classes, and many others.
We thus also obtain new Gray code algorithms for the combinatorial objects that are in bijection to these permutations, in particular for five different types of geometric rectangulations, also known as floorplans, which are divisions of a square into rectangles subject to certain restrictions.
The second main application of our framework are lattice congruences of the weak order on the symmetric group~.
Recently, Pilaud and Santos realized all those lattice congruences as -dimensional polytopes, called quotientopes, which generalize hypercubes, associahedra, permutahedra etc.
Our algorithm generates the equivalence classes of each of those lattice congruences, by producing a Hamilton path on the skeleton of the corresponding quotientope, yielding a constructive proof that each of these highly symmetric graphs is Hamiltonian.
We thus also obtain a provable notion of optimality for the Gray codes obtained from our framework: They translate into walks along the edges of a polytope
Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs
52 pages, 24 figures.A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule than the Pascal triangle modulo 2. A binary Steinhaus triangle is said to be rotationally symmetric, horizontally symmetric or dihedrally symmetric if it is invariant under the 120 degrees rotation, the horizontal reflection or both, respectively. The first part of this paper is devoted to the study of linear subspaces of rotationally symmetric, horizontally symmetric and dihedrally symmetric binary Steinhaus triangles. We obtain simple explicit bases for each of them by using elementary properties of the binomial coefficients. A Steinhaus graph is a simple graph with an adjacency matrix whose upper-triangular part is a binary Steinhaus triangle. A Steinhaus graph is said to be even or odd if all its vertex degrees are even or odd, respectively. One of the main results of this paper is the existence of an isomorphism between the linear subspace of even Steinhaus graphs and a certain linear subspace of dihedrally symmetric binary Steinhaus triangles. This permits us to give, in the second part of this paper, an explicit basis for even Steinhaus graphs and for the vector space of parity-regular Steinhaus graphs, that is the linear subspace of Steinhaus graphs that are even or odd. Finally, in the last part of this paper, we consider the generalized Pascal triangles, that are triangles of zeroes and ones, that point up now, and always with the same local rule than the Pascal triangle modulo 2. New simple bases for each linear subspace of symmetric generalized Pascal triangles are deduced from the results of the first part
Efficient generation of elimination trees and graph associahedra
An elimination tree for a connected graph~ is a rooted tree on the vertices of~ obtained by choosing a root~ and recursing on the connected components of~ to produce the subtrees of~.
Elimination trees appear in many guises in computer science and discrete mathematics, and they encode many interesting combinatorial objects, such as bitstrings, permutations and binary trees.
We apply the recent Hartung-Hoang-M\"utze-Williams combinatorial generation framework to elimination trees, and prove that all elimination trees for a chordal graph~ can be generated by tree rotations using a simple greedy algorithm.
This yields a short proof for the existence of Hamilton paths on graph associahedra of chordal graphs.
Graph associahedra are a general class of high-dimensional polytopes introduced by Carr, Devadoss, and Postnikov, whose vertices correspond to elimination trees and whose edges correspond to tree rotations.
As special cases of our results, we recover several classical Gray codes for bitstrings, permutations and binary trees, and we obtain a new Gray code for partial permutations.
Our algorithm for generating all elimination trees for a chordal graph~ can be implemented in time~\cO(m+n) per generated elimination tree, where and~ are the number of edges and vertices of~, respectively.
If is a tree, we improve this to a loopless algorithm running in time~\cO(1) per generated elimination tree.
We also prove that our algorithm produces a Hamilton cycle on the graph associahedron of~, rather than just Hamilton path, if the graph~ is chordal and 2-connected.
Moreover, our algorithm characterizes chordality, i.e., it computes a Hamilton path on the graph associahedron of~ if and only if is chordal
Combinatorial generation via permutation languages. I. Fundamentals
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations.
This approach provides a unified view on many known results and allows us to prove many new ones.
In particular, we obtain the following four classical Gray codes as special cases: the Steinhaus-Johnson-Trotter algorithm to generate all permutations of an -element set by adjacent transpositions; the binary reflected Gray code to generate all -bit strings by flipping a single bit in each step; the Gray code for generating all -vertex binary trees by rotations due to Lucas, van Baronaigien, and Ruskey; the Gray code for generating all partitions of an -element ground set by element exchanges due to Kaye.
We present two distinct applications for our new framework:
The first main application is the generation of pattern-avoiding permutations, yielding new Gray codes for different families of permutations that are characterized by the avoidance of certain classical patterns, (bi)vincular patterns, barred patterns, boxed patterns, Bruhat-restricted patterns, mesh patterns, monotone and geometric grid classes, and many others.
We also obtain new Gray codes for all the combinatorial objects that are in bijection to these permutations, in particular for five different types of geometric rectangulations, also known as floorplans, which are divisions of a square into rectangles subject to certain restrictions.
The second main application of our framework are lattice congruences of the weak order on the symmetric group~.
Recently, Pilaud and Santos realized all those lattice congruences as -dimensional polytopes, called quotientopes, which generalize hypercubes, associahedra, permutahedra etc.
Our algorithm generates the equivalence classes of each of those lattice congruences, by producing a Hamilton path on the skeleton of the corresponding quotientope, yielding a constructive proof that each of these highly symmetric graphs is Hamiltonian.
We thus also obtain a provable notion of optimality for the Gray codes obtained from our framework: They translate into walks along the edges of a polytope
Traversing combinatorial 0/1-polytopes via optimization
In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, posets and polytopes.
Our method relies on a simple and versatile algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope \conv(X), where X\seq \{0,1\}^n.
The algorithm uses as a black box any algorithm that solves a variant of the classical linear optimization problem~, and the resulting delay, i.e., the running time per visited vertex on the Hamilton path, is only by a factor of larger than the running time of the optimization algorithm.
When encodes a particular class of combinatorial objects, then traversing the skeleton of the polytope~\conv(X) along a Hamilton path corresponds to listing the combinatorial objects by local change operations, i.e., we obtain Gray code listings.
As concrete results of our general framework, we obtain efficient algorithms for generating all (-optimal) bases and independent sets in a matroid; (-optimal) spanning trees, forests, matchings, maximum matchings, and -optimal matchings in a general graph; vertex covers, minimum vertex covers, -optimal vertex covers, stable sets, maximum stable sets and -optimal stable sets in a bipartite graph; as well as antichains, maximum antichains, -optimal antichains, and -optimal ideals of a poset.
Specifically, the delay and space required by these algorithms are polynomial in the size of the matroid ground set, graph, or poset, respectively.
Furthermore, all of these listings correspond to Hamilton paths on the corresponding combinatorial polytopes, namely the base polytope, matching polytope, vertex cover polytope, stable set polytope, chain polytope and order polytope, respectively.
As another corollary from our framework, we obtain an \cO(t_{\upright{LP}} \log n) delay algorithm for the vertex enumeration problem on 0/1-polytopes , where and~, and t_{\upright{LP}} is the time needed to solve the linear program .
This improves upon the 25-year old \cO(t_{\upright{LP}}\,n) delay algorithm due to Bussieck and L\"ubbecke