547 search results - page 70 / 110 » dm 2008 |
90
Voted
DM
2007
15 years 23 days ago
2007
The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
115
Voted
DM
2007
15 years 23 days ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
108
Voted
DM
2007
15 years 23 days ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
89
Voted
DM
2007
15 years 23 days ago
2007
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
75
Voted
DM
2000
15 years 18 days ago
2000
Let exq(G; n) be the maximum number of points in a rank-n geometry (simple matroid) that is representable over GF(q) and that has no restriction isomorphic to the geometry G. We fi...