1215 search results - page 113 / 243 » Combinatorics |
117
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R−1} for all R ≥ 3, n ≥ 2. These codes have the property that the distribution of the digit changes (transi...
124
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
119
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
114
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
123
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...