Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Computer Simplification Of Engineering Systems Formulas, J. W. Helton, Mark Stankus, John Wavrik Dec 1994

Computer Simplification Of Engineering Systems Formulas, J. W. Helton, Mark Stankus, John Wavrik

Mathematics

Currently, the three most popular commercial computer algebra systems are Mathematica, Maple, and MACSYMA (the 3 M’s). These systems provide a wide variety of symbolic computation facilities for commutative algebra and contain implementations of powerful algorithms in that domain. The Gröbner Basis Algorithm, for example, is an important tool used in computation with commutative algebras and in solving systems of polynomial equations.

On the other hand, most of the computation involved in linear control theory is performed on matrices and these do not commute. A typical issue of IEEE TAC is full of A B C D type linear systems …


Minimax-Optimal Strategies For The Best-Choice Problem When A Bound Is Known For The Expected Number Of Objects, Theodore P. Hill, D. P. Kennedy Jul 1994

Minimax-Optimal Strategies For The Best-Choice Problem When A Bound Is Known For The Expected Number Of Objects, Theodore P. Hill, D. P. Kennedy

Research Scholars in Residence

For the best-choice (or secretary) problem with an unknown number N of objects, minimax-optimal strategies for the observer and minimax distributions for N are derived under the assumption that N is a random variable with expected value at most M, where M is known. The solution is derived as a special case of the situation where N is constrained by Ef(N)M, where f is increasing with f(i)-f(i-1) convex.


Pinching Theorems For Teardrops And Footballs Of Revolution, Joseph E. Borzellino Jun 1994

Pinching Theorems For Teardrops And Footballs Of Revolution, Joseph E. Borzellino

Mathematics

We give explicit optimal curvature pinching constants for the Riemannian (p, q)- football orbifolds under the assumption that they are realised as surfaces of revolution in 3. We show that sufficiently pinched sectional curvature assumptions imply that a (p, q)-football must be good.


Monads And Realcompactness, Sergio Salbany, Todor D. Todorov Mar 1994

Monads And Realcompactness, Sergio Salbany, Todor D. Todorov

Mathematics

We give a quantifier free characterization of realcompactness and ordered realcompactness in terms of monads. We also present simple proofs of some topological facts concerning realcompact spaces.


The Splitting Theorem For Orbifolds, Joseph Borzellino, Shun-Hui Zhu Jan 1994

The Splitting Theorem For Orbifolds, Joseph Borzellino, Shun-Hui Zhu

Mathematics

In this paper we wish to examine a generalization of the splitting theorem of Cheeger–Gromoll [CG] to Riemannian orbifolds. Roughly speaking, a Riemannian orbifold is a metric space locally modelled on quotients of Rie- mannian manifolds by finite groups of isometries. The term orbifold was coined by W. Thurston [T] sometime around the year 1976–77. The term is meant to suggest the orbit space of a group action on a manifold. A similar concept was introduced by I. Satake in 1956, where he used the term V–manifold (See [S1]). The “V” was meant to suggest a cone–like singularity. Since then, …