## You limited your search to:

**Partner:**UNT Libraries

**Decade:**2000-2009

**Degree Discipline:**Mathematics

**Collection:**UNT Theses and Dissertations

### Generic Algebras and Kazhdan-Lusztig Theory for Monomial Groups

**Access:**Use of this item is restricted to the UNT Community.

**Date:**May 2006

**Creator:**Alhaddad, Shemsi I.

**Description:**The Iwahori-Hecke algebras of Coxeter groups play a central role in the study of representations of semisimple Lie-type groups. An important tool is the combinatorial approach to representations of Iwahori-Hecke algebras introduced by Kazhdan and Lusztig in 1979. In this dissertation, I discuss a generalization of the Iwahori-Hecke algebra of the symmetric group that is instead based on the complex reflection group G(r,1,n). Using the analogues of Kazhdan and Lusztig's R-polynomials, I show that this algebra determines a partial order on G(r,1,n) that generalizes the Chevalley-Bruhat order on the symmetric group. I also consider possible analogues of Kazhdan-Lusztig polynomials.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc5235/

### Understanding Ancient Math Through Kepler: A Few Geometric Ideas from The Harmony of the World

**Date:**August 2002

**Creator:**Arthur, Christopher

**Description:**Euclid's geometry is well-known for its theorems concerning triangles and circles. Less popular are the contents of the tenth book, in which geometry is a means to study quantity in general. Commensurability and rational quantities are first principles, and from them are derived at least eight species of irrationals. A recently republished work by Johannes Kepler contains examples using polygons to illustrate these species. In addition, figures having these quantities in their construction form solid shapes (polyhedra) having origins though Platonic philosophy and Archimedean works. Kepler gives two additional polyhedra, and a simple means for constructing the “divine” proportion is given.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3269/

### Uniqueness Results for the Infinite Unitary, Orthogonal and Associated Groups

**Date:**May 2008

**Creator:**Atim, Alexandru Gabriel

**Description:**Let H be a separable infinite dimensional complex Hilbert space, let U(H) be the Polish topological group of unitary operators on H, let G be a Polish topological group and φ:G→U(H) an algebraic isomorphism. Then φ is a topological isomorphism. The same theorem holds for the projective unitary group, for the group of *-automorphisms of L(H) and for the complex isometry group. If H is a separable real Hilbert space with dim(H)≥3, the theorem is also true for the orthogonal group O(H), for the projective orthogonal group and for the real isometry group. The theorem fails for U(H) if H is finite dimensional complex Hilbert space.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc6136/

### Infinite Planar Graphs

**Date:**May 2000

**Creator:**Aurand, Eric William

**Description:**How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of geodesic fibers for graphs in this extended class and that for any graph in this extended class the only bounded automorphism is the identity automorphism.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc2545/

### Complemented Subspaces of Bounded Linear Operators

**Date:**August 2003

**Creator:**Bahreini Esfahani, Manijeh

**Description:**For many years mathematicians have been interested in the problem of whether an operator ideal is complemented in the space of all bounded linear operators. In this dissertation the complementation of various classes of operators in the space of all bounded linear operators is considered. This paper begins with a preliminary discussion of linear bounded operators as well as operator ideals. Let L(X, Y ) be a Banach space of all bounded linear operator between Banach spaces X and Y , K(X, Y ) be the space of all compact operators, and W(X, Y ) be the space of all weakly compact operators. We denote space all operator ideals by O.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4349/

### Level Curves of the Angle Function of a Positive Definite Symmetric Matrix

**Access:**Use of this item is restricted to the UNT Community.

**Date:**December 2009

**Creator:**Bajracharya, Neeraj

**Description:**Given a real N by N matrix A, write p(A) for the maximum angle by which A rotates any unit vector. Suppose that A and B are positive definite symmetric (PDS) N by N matrices. Then their Jordan product {A, B} := AB + BA is also symmetric, but not necessarily positive definite. If p(A) + p(B) is obtuse, then there exists a special orthogonal matrix S such that {A, SBS^(-1)} is indefinite. Of course, if A and B commute, then {A, B} is positive definite. Our work grows from the following question: if A and B are commuting positive definite symmetric matrices such that p(A) + p(B) is obtuse, what is the minimal p(S) such that {A, SBS^(-1)} indefinite? In this dissertation we will describe the level curves of the angle function mapping a unit vector x to the angle between x and Ax for a 3 by 3 PDS matrix A, and discuss their interaction with those of a second such matrix.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc28376/

### Dimensions in random constructions.

**Date:**May 2002

**Creator:**Berlinkov, Artemi

**Description:**We consider random fractals generated by random recursive constructions, prove zero-one laws concerning their dimensions and find their packing and Minkowski dimensions. Also we investigate the packing measure in corresponding dimension. For a class of random distribution functions we prove that their packing and Hausdorff dimensions coincide.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3160/

### The Study of Translation Equivalence on Integer Lattices

**Date:**August 2003

**Creator:**Boykin, Charles Martin

**Description:**This paper is a contribution to the study of countable Borel equivalence relations on standard Borel spaces. We concentrate here on the study of the nature of translation equivalence. We study these known hyperfinite spaces in order to gain insight into the approach necessary to classify certain variables as either being hyperfinite or not. In Chapter 1, we will give the basic definitions and examples of spaces used in this work. The general construction of marker sets is developed in this work. These marker sets are used to develop several invariant tilings of the equivalence classes of specific variables . Some properties that are equivalent to hyperfiniteness in the certain space are also developed. Lastly, we will give the new result that there is a continuous injective embedding from certain defined variables.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4345/

### Determining Properties of Synaptic Structure in a Neural Network through Spike Train Analysis

**Date:**May 2007

**Creator:**Brooks, Evan

**Description:**A "complex" system typically has a relatively large number of dynamically interacting components and tends to exhibit emergent behavior that cannot be explained by analyzing each component separately. A biological neural network is one example of such a system. A multi-agent model of such a network is developed to study the relationships between a network's structure and its spike train output. Using this model, inferences are made about the synaptic structure of networks through cluster analysis of spike train summary statistics A complexity measure for the network structure is also presented which has a one-to-one correspondence with the standard time series complexity measure sample entropy.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3702/

### Borel Determinacy and Metamathematics

**Date:**December 2001

**Creator:**Bryant, Ross

**Description:**Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and a Borel set of Turing degrees that neither contains nor omits a cone; so by another theorem of Martin, Borel Determinacy is not a theorem of ZC. This paper contains three main sections: Martin's proof of Borel Determinacy; a simpler example of Friedman's result, namely, (in ZFC) a coanalytic set of Turing degrees that neither contains nor omits a cone; and finally, the Friedman result.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3061/