You limited your search to:

  Partner: UNT Libraries
 Degree Discipline: Mathematics
 Degree Level: Doctoral
Aspects of Universality in Function Iteration

Aspects of Universality in Function Iteration

Date: December 1991
Creator: Taylor, John (John Allen)
Description: This work deals with some aspects of universal topological and metric dynamic behavior of iterated maps of the interval.
Contributing Partner: UNT Libraries
Characterizations of Some Combinatorial Geometries

Characterizations of Some Combinatorial Geometries

Date: August 1992
Creator: Yoon, Young-jin
Description: We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non—splitting supersolvable signed-graphic geometries : If a non-splitting supersolvable ternary geometry does not contain the Reid geometry as a subgeometry, then it is signed—graphic.
Contributing Partner: UNT Libraries
π-regular Rings

π-regular Rings

Date: May 1993
Creator: Badawi, Ayman R.
Description: The dissertation focuses on the structure of π-regular (regular) rings.
Contributing Partner: UNT Libraries
Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory

Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory

Date: August 1993
Creator: Simmons, Dayton C. (Dayton Cooper)
Description: In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs are rapidly mixing and an algorithm for the uniform generation of 2 - (4k + 1,4,1) cyclic Mendelsohn designs is developed.
Contributing Partner: UNT Libraries
Property (H*) and Differentiability in Banach Spaces

Property (H*) and Differentiability in Banach Spaces

Date: August 1993
Creator: Obeid, Ossama A.
Description: A continuous convex function on an open interval of the real line is differentiable everywhere except on a countable subset of its domain. There has been interest in the problem of characterizing those Banach spaces where the continuous functions exhibit similar differentiability properties. In this paper we show that if a Banach space E has property (H*) and B_E• is weak* sequentially compact, then E is an Asplund space. In the case where the space is weakly compactly generated, it is shown that property (H*) is equivalent for the space to admit an equivalent Frechet differentiable norm. Moreover, we define the SH* spaces, show that every SH* space is an Asplund space, and show that every weakly sequentially complete SH* space is reflexive. Also, we study the relation between property (H*) and the asymptotic norming property (ANP). By a slight modification of the ANP we define the ANP*, and show that if the dual of a Banach spaces has the ANP*-I then the space admits an equivalent Fréchet differentiability norm, and that the ANP*-II is equivalent to the space having property (H*) and the closed unit ball of the dual is weak* sequentially compact. Also, we show that in the ...
Contributing Partner: UNT Libraries
The Continuous Wavelet Transform and the Wave Front Set

The Continuous Wavelet Transform and the Wave Front Set

Date: December 1993
Creator: Navarro, Jaime
Description: In this paper I formulate an explicit wavelet transform that, applied to any distribution in S^1(R^2), yields a function on phase space whose high-frequency singularities coincide precisely with the wave front set of the distribution. This characterizes the wave front set of a distribution in terms of the singularities of its wavelet transform with respect to a suitably chosen basic wavelet.
Contributing Partner: UNT Libraries
Multifractal Measures

Multifractal Measures

Date: May 1994
Creator: Olsen, Lars
Description: The purpose of this dissertation is to introduce a natural and unifying multifractal formalism which contains the above mentioned multifractal parameters, and gives interesting results for a large class of natural measures. In Part 2 we introduce the proposed multifractal formalism and study it properties. We also show that this multifractal formalism gives natural and interesting results when applied to (nonrandom) graph directed self-similar measures in Rd and "cookie-cutter" measures in R. In Part 3 we use the multifractal formalism introduced in Part 2 to give a detailed discussion of the multifractal structure of random (and hence, as a special case, non-random) graph directed self-similar measures in R^d.
Contributing Partner: UNT Libraries
Topics in Fractal Geometry

Topics in Fractal Geometry

Date: August 1994
Creator: Wang, JingLing
Description: In this dissertation, we study fractal sets and their properties, especially the open set condition, Hausdorff dimensions and Hausdorff measures for certain fractal constructions.
Contributing Partner: UNT Libraries
Using Steepest Descent to Find Energy-Minimizing Maps Satisfying Nonlinear Constraints

Using Steepest Descent to Find Energy-Minimizing Maps Satisfying Nonlinear Constraints

Date: August 1994
Creator: Garza, Javier, 1965-
Description: The method of steepest descent is applied to a nonlinearly constrained optimization problem which arises in the study of liquid crystals. Let Ω denote the region bounded by two coaxial cylinders of height 1 with the outer cylinder having radius 1 and the inner having radius ρ. The problem is to find a mapping, u, from Ω into R^3 which agrees with a given function v on the surfaces of the cylinders and minimizes the energy function over the set of functions in the Sobolev space H^(1,2)(Ω; R^3) having norm 1 almost everywhere. In the variational formulation, the norm 1 condition is emulated by a constraint function B. The direction of descent studied here is given by a projected gradient, called a B-gradient, which involves the projection of a Sobolev gradient onto the tangent space for B. A numerical implementation of the algorithm, the results of which agree with the theoretical results and which is independent of any strong properties of the domain, is described. In chapter 2, the Sobolev space setting and a significant projection in the theory of Sobolev gradients are discussed. The variational formulation is introduced in Chapter 3, where the issues of differentiability and existence of ...
Contributing Partner: UNT Libraries
Cycles and Cliques in Steinhaus Graphs

Cycles and Cliques in Steinhaus Graphs

Date: December 1994
Creator: Lim, Daekeun
Description: In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian.
Contributing Partner: UNT Libraries
FIRST PREV 1 2 3 4 5 NEXT LAST