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

Physical Sciences and Mathematics Commons

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

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 25591 - 25620 of 27387

Full-Text Articles in Physical Sciences and Mathematics

Weak Confluence And W-Sets, Van C. Nall Jan 1983

Weak Confluence And W-Sets, Van C. Nall

Department of Math & Statistics Faculty Publications

A mapping between continua is weakly confluent if for each subcontinuum K of the range some component of the preimage of K maps onto K. Class [W] is the class of all continua which are the images of weakly confluent maps only. The notion of Class [W] was introduced by Andrej Lelek in 1972. Since then it has been widely explored and some characterizations of these continua have been given. J. Grispolakis and E. D. Tymchatyn have given a characterization in terms of hyperspaces [4]. J. Davis has shown that acyclic atriodic continua are in Class [W]i therefore, atriodic tree-like …


Fortran Program Is For Single States Of Para Helium Singlets, Donald Greenspan Jan 1983

Fortran Program Is For Single States Of Para Helium Singlets, Donald Greenspan

Mathematics Technical Papers

No abstract provided.


Energy States Of Two-Electron Systems Via Bohr Determinism, Donald Greenspan Jan 1983

Energy States Of Two-Electron Systems Via Bohr Determinism, Donald Greenspan

Mathematics Technical Papers

Correct ground, ionization, and excited states for two-electron systems are deduced deterministically by a direct extension of Bohr's method for hydrogen. The theory incorporates a classical interpretation of electron pairing and requires computer methodology to solve the resulting mathematical equations.


Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston Jan 1983

Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The ηx-sets of Hausdorff have large compactifications (of cardinality ≽ exp(α); and of cardinality ≽ exp(exp(2<α)) in the Stone-Čech case). If Qα denotes the unique (when it exists) ηα -set of cardinality α, then Qα can be decomposed (= partitioned) into homeomorphs of any prescribed nonempty subspace; moreover the subspaces of Qα can be characterized as those which arc regular T1, of cardinality and weight ≼ α, whose topologies are closed under < α intersections.


Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston Jan 1983

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.


Algebraic Knots Are Algebraically Dependent, Charles Livingston, Paul Melvin Jan 1983

Algebraic Knots Are Algebraically Dependent, Charles Livingston, Paul Melvin

Mathematics Faculty Research and Scholarship

Algebraic knots are lineraly dependent on G_, the algebraic knot concordance group. An example of a linear relation between four algebraic knots is constructed.


A Comparison Of Processor Technologies, Eddie R. Wachter Jan 1983

A Comparison Of Processor Technologies, Eddie R. Wachter

Theses and Dissertations

The purpose of this paper is to present a discussion of the technology implementation and design of four very high performance mainframe computer systems. The systems evaluated are:

Amdahl 580 Series

CDC 170 Series 800

IBM 308x Series

Univac 1100/90 Series

Included in this evaluation is a survey of the technology used, its characteristics, packaging and performance. Each system component is evaluated on the basis of design philosophy, technology, and the total system design with regards to reliability, availability, and performance.


On The First Passage Time Distribution For A Class Of Markov Chains, Mark Brown, Narasinga Rao Chaganty Jan 1983

On The First Passage Time Distribution For A Class Of Markov Chains, Mark Brown, Narasinga Rao Chaganty

Mathematics & Statistics Faculty Publications

Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S. Let C be an increasing subset of S with finite complement. Then the first passage-time from i S to C is shown to be IFRA (increasing failure rate on the,av;rage). Several applications are presented including coherent systems, shock models, and convolutions of IFRA distributions.


Quantitative Estimates For Lp Approximation With Positive Linear Operators, J. J. Swetits, B. Wood Jan 1983

Quantitative Estimates For Lp Approximation With Positive Linear Operators, J. J. Swetits, B. Wood

Mathematics & Statistics Faculty Publications

Quantitative estimates for approximation with positive linear operators are derived. The results are in the same vein as recent results of Berens and DeVore. Two examples are provided.


Asymptotic Integration Of $Y^(N) +P(T)Y^Gamma =F(T)$ Under Mild Integral Smallness Conditions, William F. Trench Dec 1982

Asymptotic Integration Of $Y^(N) +P(T)Y^Gamma =F(T)$ Under Mild Integral Smallness Conditions, William F. Trench

William F. Trench

No abstract provided.


Zeta Matrices Of Elliptic Curves, Goro Kato, Saul Lubkin Dec 1982

Zeta Matrices Of Elliptic Curves, Goro Kato, Saul Lubkin

Mathematics

Let O=limnZ/pnZ, , let A=O[g2,g3] Δ, where g2 and g3 are coefficients of the elliptic curve: Y2 = 4X3 − g2X − g3 over a finite field and Δ = g23 − 27g32 and let B=A[X,Y]/(Y2-4X3+g2X+g3). Then the p-adic cohomology theory will be applied to compute explicitly the zeta matrices of the elliptic curves, induced by the pth power map on the free AzQ -module H1(X, AzQ). Main results are; Theorem 1.1: X …


Computer-Oriented, N-Body Modelling Of Minimal Surfaces, Donald Greenspan Dec 1982

Computer-Oriented, N-Body Modelling Of Minimal Surfaces, Donald Greenspan

Mathematics Technical Papers

In this paper a new approach to the modeling of minimal surfaces is described and applied. Rather than use a continuous model, we develop a discrete n-body model with basic tensile interactions derived from classical molecular force formulas. Computer results area described and discussed.


A Monte Carlo Study Of Robustness Of Preliminary Test Estimators In Pooling Means, Chien-Pai Han, T. A. Bancroft Dec 1982

A Monte Carlo Study Of Robustness Of Preliminary Test Estimators In Pooling Means, Chien-Pai Han, T. A. Bancroft

Mathematics Technical Papers

Pooling data, when justified, for estimating the target mean is advantageous when the sample size is small from the target population. In case it is doubtful whether two sets of data have the same mean, a normal test or a t test can be used for testing the equality of the two means depending on variance known or unknown. A preliminary test estimator is then constructed for estimating the population mean. We study the robustness of the preliminary test estimators when certain populations are not normal. The result of a Monte Carlo study is given, when the populations are either …


Scs 75: Distributive Semilattices, Heyting Algebras, And V-Homomorphisms, Hans Dobbertin Nov 1982

Scs 75: Distributive Semilattices, Heyting Algebras, And V-Homomorphisms, Hans Dobbertin

Seminar on Continuity in Semilattices

Source: University archive of the Technische Universität Darmstadt.


Scs 74: Distributive Semilattices, Hans Dobbertin Nov 1982

Scs 74: Distributive Semilattices, Hans Dobbertin

Seminar on Continuity in Semilattices

No abstract provided.


India's External Debts: Growth, Determinants And Impact, Sanjib Pohit Dr. Oct 1982

India's External Debts: Growth, Determinants And Impact, Sanjib Pohit Dr.

Doctoral Theses

In the post-World War Il era, the world saw the birth of many new nations. Primarily, they were the colonies of the industrialized countries and were developed only to supply raw materials to the colonizing country. Rightly, attention was focused to develop the economies of these countries. The ear- lier studies of the economic problems of developing countries has focused on a lack of capital, both physical and human. Rapid progress in solving these problems is scen to be hindered by a number of constrainte-domestic savings, foreign exchange and human skills. In this setup, external finance can further growth by …


Ideals And Centralizing Mappings In Prime Rings, Joseph H. Mayne Oct 1982

Ideals And Centralizing Mappings In Prime Rings, Joseph H. Mayne

Mathematics and Statistics: Faculty Publications and Other Works

Let H be a prime ring and U be a nonzero ideal of R. If T is a nontrivial automorphism or derivation of Ft such that uuT — uTu is in the center of R and uT is in U for every u in U, then R is commutative. If R does not have characteristic equal to two, then U need only be a nonzero Jordan ideal.


Scs 73: Meet-Continuous Lattices In Which Meet Is Not Continuous, Marcel Erné, Hartmut Gatzke Sep 1982

Scs 73: Meet-Continuous Lattices In Which Meet Is Not Continuous, Marcel Erné, Hartmut Gatzke

Seminar on Continuity in Semilattices

Source: University archive of the Technische Universität Darmstadt.


Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science Sep 1982

Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science

WKU Archives Records

Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.


On The Existence Of Periodic Quasi Solutions For First Order Systems, A. S. Vatsala Sep 1982

On The Existence Of Periodic Quasi Solutions For First Order Systems, A. S. Vatsala

Mathematics Technical Papers

Recently the method of upper and lower solutions and Lyapunov-Schmitt method have been fruitfully employed to prove the existence of periodic solutions for scalar first and second order equations in [2,4]. In this paper we shall use this technique to prove the existence of periodic solutions for first order systems which is the generalisation of Müller's result [3] for periodic case. We shall also develop monotone iterative technique to obtain coupled minimal and maximal periodic quasisoltions for system of first order equations. Further, under a uniqueness assumption, our results yield a unique periodic solution for the first order system.


Scs 72: Algebraic Posets And Compactly Generated Posets, Marcel Erné Aug 1982

Scs 72: Algebraic Posets And Compactly Generated Posets, Marcel Erné

Seminar on Continuity in Semilattices

Source: University archive of the Technische Universität Darmstadt.


Conditional Generalizations Of Strong Laws Which Conclude The Partial Sums Converge Almost Surely, Theodore P. Hill Aug 1982

Conditional Generalizations Of Strong Laws Which Conclude The Partial Sums Converge Almost Surely, Theodore P. Hill

Research Scholars in Residence

Suppose that for every independent sequence of random variables satisfying some hypothesis condition H, it follows that the partial sums converge almost surely. Then it is shown that for every arbitrarily-dependent sequence of random variables, the partial sums converge almost surely on the event where the conditional distributions (given the past) satisfy precisely the same condition H. Thus many strong laws for independent sequences may be immediately generalized into conditional results for arbitrarily-dependent sequences.


Hardy And Lipschitz Spaces On Unit Spheres, Leonardo Colzani Aug 1982

Hardy And Lipschitz Spaces On Unit Spheres, Leonardo Colzani

Arts & Sciences Electronic Theses and Dissertations

The main objective of this work is to develop a theory of Hardy spaces on the surface (SIGMA)(,N) of the unit ball B(,N+1) in (//R)('N+1), analogous to the maximal and atomic theory of Hardy spaces on (//R)('N), and to characterize the duals of these spaces as spaces of Lipschitz functions.


Random Factors And Isofactors In Graphs And Digraphs, John Frederick Fink Aug 1982

Random Factors And Isofactors In Graphs And Digraphs, John Frederick Fink

Dissertations

A factor is a spanning sub(di)graph of a (di)graph. Factors that are generated by an algorithm that incorporates an element of randomness are often called random factors. An isofactor is essentially a factor G that is either empty or for which there exists a connected regular (di)graph H having a nontrivial G-factorization. Several topics, each concerning random factors or isofactors, are investigated in this dissertation. An historical introduction to these topics is given in Chapter I.

In Chapter II we define an antipath and say that a digraph is randomly antitraceable if every nonspanning antipath can be extended (at its …


Scs 71: Two Remarkable Continuous Posets And An Appendix To "The Cl-Compactification And The Injective Hull Of A Continuous Poset", Rudolf-Eberhard Hoffmann Jul 1982

Scs 71: Two Remarkable Continuous Posets And An Appendix To "The Cl-Compactification And The Injective Hull Of A Continuous Poset", Rudolf-Eberhard Hoffmann

Seminar on Continuity in Semilattices

No abstract provided.


Scs 70: Freedom For Completely Distributive Lattices (Over Continuous Posets), Marcel Erné Jul 1982

Scs 70: Freedom For Completely Distributive Lattices (Over Continuous Posets), Marcel Erné

Seminar on Continuity in Semilattices

No abstract provided.


Scs 69: Order Generation And Distributive Laws In Complete Lattices, Marcel Erné Jul 1982

Scs 69: Order Generation And Distributive Laws In Complete Lattices, Marcel Erné

Seminar on Continuity in Semilattices

No abstract provided.


Scs 68: A Remark On The Complete Distributivity Of Algebraic Lattices, Karl Heinrich Hofmann Jul 1982

Scs 68: A Remark On The Complete Distributivity Of Algebraic Lattices, Karl Heinrich Hofmann

Seminar on Continuity in Semilattices

No abstract provided.


Scs 67: A Strict Extension Of Previous Results On Essential Extensions, Jimmie D. Lawson Jul 1982

Scs 67: A Strict Extension Of Previous Results On Essential Extensions, Jimmie D. Lawson

Seminar on Continuity in Semilattices

No abstract provided.


Computer Simulation Of A Dynamical Model Of The Water Molecule, Donald Greenspan Jul 1982

Computer Simulation Of A Dynamical Model Of The Water Molecule, Donald Greenspan

Mathematics Technical Papers

A new computer-orlented theory for molecular dynamics is applied to modeling the water molecule. The dynamical equations are derived from molecular stability properties and from aspects of modern particle theory, especially as it relates to the structure of the electron. Computer studies are described and discussed.