Sciweavers

7840 search results - page 13 / 1568
» On generalized Ramsey numbers
Sort
View
MOC
2002
109views more  MOC 2002»
13 years 7 months ago
Distribution of generalized Fermat prime numbers
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
Harvey Dubner, Yves Gallot
ENDM
2008
101views more  ENDM 2008»
13 years 8 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
EJC
2011
13 years 2 months ago
Bounds on generalized Frobenius numbers
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
Lenny Fukshansky, Achill Schürmann
DCG
2010
93views more  DCG 2010»
13 years 8 months ago
The Number of Generalized Balanced Lines
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
David Orden, Pedro Ramos, Gelasio Salazar
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 2 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin