13 citations · 45 across the 24 of their papers we have counts for
30 papers
Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
John M. Neuberger, Nándor Sieben, James W. Swift
In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a ma…
A Bifurcation Lemma for Invariant Subspaces
John M. Neuberger, Nándor Sieben, James W. Swift
The Bifurcation from a Simple Eigenvalue (BSE) Theorem is the foundation of steady-state bifurcation theory for one-parameter families of functions. When eigenvalues of multiplicit…
Impartial geodetic building games on graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the set. The convex hull of a set of vertices…
Invariant Synchrony and Anti-Synchrony Subspaces of Weighted Networks
Eddie Nijholt, Nándor Sieben, James W. Swift
The internal state of a cell in a coupled cell network is often described by an element of a vector space. Synchrony or anti-synchrony occurs when some of the cells are in the same…
Impartial Achievement Games on Convex Geometries
Stephanie McCoy, Nándor Sieben
We study a game where two players take turns selecting points of a convex geometry until the convex closure of the jointly selected points contains all the points of a given winnin…
The spectrum of nim-values for achievement games for generating finite groups
Bret J. Benesh, Dana C. Ernst, Nandor Sieben
We study an impartial achievement game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group.…