Sciweavers

365 search results - page 26 / 73
» On the combinatorics of Galois numbers
Sort
View
COMBINATORICS
2006
108views more  COMBINATORICS 2006»
14 years 12 months ago
Dynamic Single-Pile Nim Using Multiple Bases
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...
Arthur Holshouser, Harold Reiter
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
14 years 12 months ago
Asymptotics for Incidence Matrix Classes
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of th...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
COCOON
2005
Springer
15 years 1 months ago
Solovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
Robert Rettinger, Xizhong Zheng
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 12 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
DCG
2008
88views more  DCG 2008»
14 years 12 months ago
On the Number of Birch Partitions
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
Stephan Hell