 IDEALS Home
 →
 College of Liberal Arts and Sciences
 →
 Dept. of Mathematics
 →
 Browse Dept. of Mathematics by Title
Browse Dept. of Mathematics by Title
Now showing items 526545 of 1135

(1972)
application/pdf
PDF (2MB) 
(20160706)A central result in algebraic combinatorics is the LittlewoodRichardson rule that governs products in the cohomology of Grassmannians. A major theme of the modern Schubert calculus is to extend this rule and its associated ...
application/pdf
PDF (6MB) 
application/pdf
PDF (2MB) 
(2000)We also study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded if there is an mincomplete computably ...
application/pdf
PDF (5MB) 
(1969)
application/pdf
PDF (2MB) 
application/pdf
PDF (2MB) 
(20130203)Let P be a lattice polytope in R^d, the convex hull of a finite set in Z^d, and let L(P) = P intersection Z^d = {v1,..., vN}, where N = L(P). We call P a distinct pairsum or dps polytope if L(P)+L(P) contains N + N ...
application/pdf
PDF (2MB) 
(1988)Since Lorentz introduced Lorentz space, there have been several generalizations of this space. Hunt and Cwikel studied Lorentz L$\sb{\rm p,q}$ spaces and showed some basic properties such as the characterization of the ...
application/pdf
PDF (3MB) 
application/pdf
PDF (2MB) 
(1970)
application/pdf
PDF (5MB) 
(2008)Instead of focusing on the application, we are also interested in more theoretical setting. We discuss the conditions on density of the set of invertible (resp.: noninvertible) N x P matrices. Lastly we study the generalized ...
application/pdf
PDF (1MB) 
(2008)For free random variables, we obtain even stronger version of the Law of the Iterated Logarithm: limsupn→infinity 1n i=1nxi≤ bau2s .
application/pdf
PDF (1MB) 
application/pdf
PDF (3MB) 
Least Square Methods for Solving Systems of Inequalities With Application to an Assignment Problem (1992)This research addresses algorithmic approaches for solving two different, but related, types of optimization problems. Firstly, the research considers the solution of a specific type of assignment problem using continuous ...
application/pdf
PDF (3MB) 
(1999)The thesis obtains the LefschetzReidemeister trace of a selfmap as the image under a map of spaces whose domain is the Ktheory of a ring with a bimodule and whose range is the Hochschild homology of the ring with the ...
application/pdf
PDF (5MB) 
(1973)
application/pdf
PDF (4MB) 
(20130822)This dissertation is concerned with equivalence relations on homotopy classes of curves coming from various spaces of at metrics on a genus g >1 surface. We prove an analog of a result of Randol (building on work of ...
application/pdf
PDF (358kB) 
(2004)For each pair of linear orderings (L, M), the representability number reprM(L) of L in M is the least ordinal alpha such that L can be orderembedded into the lexicographic power Malex . The case M = R is relevant ...
application/pdf
PDF (7MB) 
(1980)A central extension of finite groups e: 0 (>) A (>) E (>) G (>)1 is said to be a stem extension of G if A is contained in the commutator subgroup E' of E. Schur showed that A must be isomorphic to ...
application/pdf
PDF (2MB) 
application/pdf
PDF (2MB)
Now showing items 526545 of 1135