Sciweavers

690 search results - page 1 / 138
» Dense Admissible Sets
Sort
View
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
13 years 11 months ago
Dense Admissible Sets
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
Daniel M. Gordon, Eugene R. Rodemich
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
13 years 7 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta
COMBINATORICS
2007
83views more  COMBINATORICS 2007»
13 years 7 months ago
On Small Dense Sets in Galois Planes
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
Massimo Giulietti
APAL
1998
88views more  APAL 1998»
13 years 7 months ago
The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
Peter Cholak
CCCG
2010
13 years 8 months ago
Approximate euclidean ramsey theorems
According to a classical result of Szemer
Adrian Dumitrescu