✦ LIBER ✦

A bound on the number of integrators needed to linearize a control system

✍ Scribed by W.M. Sluis; D.M. Tilbury

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 479 KB
Volume: 29
Category: Article
ISSN: 0167-6911
DOI: 10.1016/0167-6911(96)00046-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Number of Solutions of Bounded Heigh

The Number of Solutions of Bounded Height to a System of Linear Equations

✍ J.L. Thunder 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 593 KB

We count the number of solutions with height less than or equal to $B$ to a system of linear equations over a number field. We give explicit asymptotic estimates for the number of such solutions as $B$ goes to infinity, where the constants involved depend on the classical invariants of the numbe

A Novel Parameter to Estimate the Minimu

A Novel Parameter to Estimate the Minimum Number of Bound Ligands Needed to Activate an Ion Channel

✍ Tiziana Castrignanò; Filippo Aluffi-Pentini; Valerio Parisi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 136 KB

We consider the Hill coe$cient obtained from concentration}response curves and we stress the di!erences between the use of binding and the use of current for the response. We "rst show that in order to estimate the cooperativity of binding sites one must use the coe$cient obtained from the binding c

Adaptive suboptimal control of a linear

Adaptive suboptimal control of a linear system with bounded disturbance

✍ V.F. Sokolov 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A bound on the number of periodic orbits

A bound on the number of periodic orbits of certain piecewise linear maps

✍ Manny Scarowsky; Abraham Boyarsky 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A lower bound on the number of Semi-Bool

A lower bound on the number of Semi-Boolean quadruple systems

✍ Marco Buratti; Alberto Del Fra 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract A Steiner quadruple system of order 2^__n__^ is __Semi‐Boolean__ (SBQS(2^__n__^) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry __PG__(__n__−1, 2). We prove by means of explicit constructions that for any __n__

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.