 IDEALS Home
 →
 College of Liberal Arts and Sciences
 →
 Dept. of Mathematics
 →
 Dissertations and Theses  Mathematics
 →
 Browse Dissertations and Theses  Mathematics by Subject
Browse Dissertations and Theses  Mathematics by Subject "Mathematics"
Now showing items 120 of 106

(1991)We determine the existence of 1factorizations of certain tensor products of graphs. The properties of these 1factorizations are of interest; to study them, we develop results about the automorphism group of tensor products ...

(1991)We determine the existence of 1factorizations of certain tensor products of graphs. The properties of these 1factorizations are of interest; to study them, we develop results about the automorphism group of tensor products ...

(1996)The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear ...

(1990)In 1983, Bhatia, Davis and McIntosh proved that if A and B are selfadjoint with dist($\sigma(A),\sigma(B)) \geq \delta$ then there is some $c\sb{sa} < 2$ (independent of A and B) such that $c\sb{sa}\vert\vert\vert AQ  ...

(1994)Much of the work in algebraic Ktheory today is devoted to the search for "motivic cohomology." This hopedfor cohomology theory of algebraic geometry should be analogous to the known singular homology groups of topology. ...

(1989)We use R. Knorr's theory of virtually irreducible lattices to study the blocks of a finite group.

(1989)In this paper the Boolean valued method is used to develop a theory closely resembling the theory of probabilistic metric spaces. In this development the complete Boolean algebra used must have the form of the quotient ...

(1989)A family of polytopes in E$\sp{d}$ is called nearly neighborly if, for every two members of the family, there is a hyperplane which separates them and contains a facet of each. Such a family is called neighborly if every ...

(1994)Suppose X is a submartingale that is continuous on the right with limits from the left and H is a predictable process bounded by 1 in absolute value. Let $Y = (Y\sb{t})\sb{t\ge 0}$ where$$Y\sb{t} = H\sb0X\sb0 + ...

(1994)If X is a class of groups, the class of counterX groups is defined to consist of all groups having no nontrivial Xquotients. Countercounterfinite groups are studied here; any nontrivial quotient of such a group has ...

(1990)Given a semisimple linear algebraic group G over an algebraically closed field K, we fix a Borel subgroup B and a maximal torus T. This determines a root system $\Phi$, and a set of simple roots $\Delta$. The subgroups ...

(1994)Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.

(1992)An attempt is made to study the mathematical strength of the weak second order theories of Bounded Arithmetic U$\sbsp{2}{i}$ and V$\sbsp{2}{i}$, i $\geq$ 0, introduced by S. Buss. It is first shown that U$\sbsp{2}{1}$ can ...

(1991)Let $\lbrack n\rbrack = \{1,2,\..., n\},A$ and let $2\sp{\lbrack n\rbrack}$ represent the subset lattice of (n) with sets ordered by inclusion. A collection I of subsets of (n) is called an ideal if every subset of a member ...

(1995)The Banach envelope of $weakL\sp1$ (denoted $wL\sb{\1})$ is a sort of universal Banach space for separable Banach spaces. In this paper, we can see the complemented Banach subspaces of $wL\sb{\1}.$ In particular, the space ...

(1990)We derive upper and lower bounds on the computational complexity of prefix classes of several logical theories. The general method for obtaining lower bounds on the complexity of logical theories developed by Compton and ...

(1995)Various topics related to the work of Ramanujan are discussed in this thesis. In Chapter 2, we give a new proof of Ramanujan's famous partition identity modulo 5 (see (1.1)). This proof is an improvement of W. N. Bailey's ...

(1995)This thesis deals with three main extremal problems on convex lattice polygons in the plane. A convex lattice polygon is the intersection of a compact convex set with the integer lattice (the set of all points with integer ...

(1992)A theory T admits elimination of imaginaries (EI) if every definable equivalence relation $\sim$ is the kernel of a definable map f. (I.e., $\vec{x}\sim\vec{y}\Longleftrightarrow f(\vec{x})=f(\vec{y}).)$ This term was ...

(1989)A notion of dinatural transformation more restrictive than that in the literature is presented. Canonical dinatural transformations are defined, and shown to have desirable properties not shared by dinaturals in general. ...
Now showing items 120 of 106