Sciweavers

5227 search results - page 331 / 1046
» Constructing New Media
Sort
View
179
Voted
DM
2010
85views more  DM 2010»
15 years 7 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Robert F. Bailey, Brett Stevens
AML
2006
85views more  AML 2006»
15 years 7 months ago
Arithmetical Sacks Forcing
Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical ...
Rod Downey, Liang Yu
APAL
2006
51views more  APAL 2006»
15 years 7 months ago
Models of real-valued measurability
Abstract. Solovay's random-real forcing ([1]) is the standard way of producing real-valued measurable cardinals. Following questions of Fremlin, by giving a new construction, ...
Sakaé Fuchino, Noam Greenberg, Saharon Shel...
181
Voted
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
15 years 7 months ago
State and unknown input estimation for linear discrete-time systems
: This paper deals with a new type of estimator for discrete-time linear systems with unknown inputs. A constructive algorithm is given in order to analyze the state observability ...
Thierry Floquet, Jean-Pierre Barbot
177
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 7 months ago
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families...
David Eppstein