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 ...
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 ...
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, ...
: 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 ...
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...