Numerical studies of Stone's symmetric factorization and the iteration parameters, and [tau].

Thesis (M.S.)--University of Illinois.

Parallel methods and bounds of evaluating polynomials.

Bibliography: p. 24.

On the existence of non-static plane symmetric space-times /

"July 30, 1958"

Determination of symmetric VL1 formulas : algorithm and program SYM4 /

Mode of access: Internet.

The use of Chebyshev matrix polynomials in the iterative solution of linear equations compared to the method of successive overrelaxtion /

"(This is being submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics, June 1959.)"

Hardness of the axially-symmetric magnetic piston.

"Prepared for the Air Force Ballistic Missile Division, Headquarters Air Research and Development Command, under Contract AF 04(647)-309, Advanced Propulsion Systems."

Spreading of supersonic jets from axially symmetric nozzles

Mode of access: Internet.

Stark energy levels of symmetric top molecules.

At head of title: NBS Project 8440-11-84141.

Some new symmetric function tables.

"Reprinted from the Transactions of the Royal Society of Canada, 3d ser., 1908-1909, v.2, sect.3."

Lectiones evangeliorvm & epistolarvm, anniversariae : Ebraicè cum radice, literis servilibus, & Latina lectione. Graecè, Latinè & Germanicè. Harmonicè & Symmetricè, pro verbi Dei & Linguarum Studiosis /

Title within double ruled border; text within single rule border on every page, with double rule at top and bottom of page. The texts are arranged in six columns, along two pages.

Aspects of Markov Chains and Particle Systems

Thesis (Ph.D.)--University of Washington, 2016-06

Formal group laws and hypergraph colorings

Thesis (Ph.D.)--University of Washington, 2016-06

Mode Localization in a Nearly Cyclic Symmetric System

Thesis (Ph.D.)--University of Washington, 2016-06

On the completion of Latin rectangles to symmetric Latin squares

We find necessary and sufficient conditions for completing an arbitrary 2 by n latin rectangle to an n by n symmetric latin square, for completing an arbitrary 2 by n latin rectangle to an n by n unipotent symmetric latin square, and for completing an arbitrary 1 by n latin rectangle to an n by n idempotent symmetric latin square. Equivalently, we prove necessary and sufficient conditions for the existence of an (n - 1)-edge colouring of K-n (n even), and for an n-edge colouring of K-n (n odd) in which the colours assigned to the edges incident with two vertices are specified in advance.

On decomposition of sub-linearised polynomials

We give a detailed exposition of the theory of decompositions of linearised polynomials, using a well-known connection with skew-polynomial rings with zero derivative. It is known that there is a one-to-one correspondence between decompositions of linearised polynomials and sub-linearised polynomials. This correspondence leads to a formula for the number of indecomposable sub-linearised polynomials of given degree over a finite field. We also show how to extend existing factorisation algorithms over skew-polynomial rings to decompose sub-linearised polynomials without asymptotic cost.