Sciweavers

7758 search results - page 5 / 1552
» On the Number of Distributive Lattices
Sort
View
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 8 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
MOC
2000
132views more  MOC 2000»
13 years 8 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
13 years 8 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
Arvind Ayyer, Doron Zeilberger
ANTSW
2008
Springer
13 years 10 months ago
Lattice Formation in Space for a Swarm of Pico Satellites
We present a distributed control strategy that lets a swarm of satellites autonomously form a lattice in orbit around a planet. The system, based on the artificial potential field ...
Carlo Pinciroli, Mauro Birattari, Elio Tuci, Marco...
DCG
2008
90views more  DCG 2008»
13 years 8 months ago
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan