Sciweavers

492 search results - page 49 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2006
83views more  COMBINATORICS 2006»
14 years 9 months ago
Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series
We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutati...
Murray Elder
COMBINATORICS
2006
158views more  COMBINATORICS 2006»
14 years 9 months ago
Reduced Canonical Forms of Stoppers
The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel pro...
Aaron N. Siegel
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 9 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
COMBINATORICS
2006
114views more  COMBINATORICS 2006»
14 years 9 months ago
The Maximum Distinguishing Number of a Group
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring...
Melody Chan
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
14 years 9 months ago
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families...
David Eppstein