UNT Libraries - 405 Matching Results

Search Results

Uniqueness of Positive Solutions for Elliptic Dirichlet Problems

Description: In this paper we consider the question of uniqueness of positive solutions for Dirichlet problems of the form - Δ u(x)= g(λ,u(x)) in B, u(x) = 0 on ϑB, where A is the Laplace operator, B is the unit ball in RˆN, and A>0. We show that if g(λ,u)=uˆ(N+2)/(N-2) + λ, that is g has "critical growth", then large positive solutions are unique. We also prove uniqueness of large solutions when g(λ,u)=A f(u) with f(0) < 0, f "superlinear" and monotone. We use a number of methods from nonlinear functional analysis such as variational identities, Sturm comparison theorems and methods of order. We also present a regularity result on linear elliptic equation where a coefficient has critical growth.
Date: December 1990
Creator: Ali, Ismail, 1961-

Automorphism Groups of Strong Bruhat Orders of Coxeter Groups

Description: In this dissertation, we describe the automorphism groups for the strong Bruhat orders A_n-1, B_n, and D_n. In particular, the automorphism group of A_n-1 for n ≥ 3 is isomorphic to the dihedral group of order eight, D_4; the automorphism group of B_n for n ≥ 3 is isomorphic to C_2 x C_2 where C_2 is the cyclic group of order two; the automorphism group of D_n for n > 5 and n even is isomorphic to C_2 x C_2 x C_2; and the automorphism group of D_n for n ≥ 5 and n odd is isomorphic to the dihedral group D_4.
Date: August 1986
Creator: Sutherland, David C. (David Craig)

Applications of Graph Theory and Topology to Combinatorial Designs

Description: This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to obtain a design from a difference family. Chapters II to IV study the existence of an affine 3-(p^m,4,λ) design where the v-set is the Galois field GF(p^m). Associated to each prime p, this paper constructs a graph. If the graph has a 1-factor, then a difference family and hence an affine design exists. The question arises of how to determine when the graph has a 1-factor. It is not hard to see that the graph is connected and of even order. Tutte's theorem shows that if the graph is 2-connected and regular of degree three, then the graph has a 1-factor. By using the concept of quadratic reciprocity, this paper shows that if p Ξ 53 or 77 (mod 120), the graph is almost regular of degree three, i.e., every vertex has degree three, except two vertices each have degree tow. Adding an extra edge joining the two vertices with degree tow gives a regular graph of degree three. Also, Tutte proved that if A is an edge of the graph satisfying the above conditions, then it must have a 1-factor which contains A. The second part of the dissertation is concerned with determining if two designs are isomorphic. Here the v-set is any group G and translation by any element in G gives a design automorphism. Given a design B and its difference family D, two topological spaces, B and D, are constructed. We give topological conditions which imply that a design isomorphism is a group isomorphism.
Date: December 1988
Creator: Somporn Sutinuntopas

Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension

Description: This dissertation is a study of the dynamics of one-dimensional unimodal maps and is mainly concerned with those maps which are trapezoidal. The trapezoidal function, f_e, is defined for eΣ(0,1/2) by f_e(x)=x/e for xΣ[0,e], f_e(x)=1 for xΣ(e,1-e), and f_e(x)=(1-x)/e for xΣ[1-e,1]. We study the symbolic dynamics of the kneading sequences and relate them to the analytic dynamics of these maps. Chapter one is an overview of the present theory of Metropolis, Stein, and Stein (MSS). In Chapter two a formula is given that counts the number of MSS sequences of length n. Next, the number of distinct primitive colorings of n beads with two colors, as counted by Gilbert and Riordan, is shown to equal the number of MSS sequences of length n. An algorithm is given that produces a bisection between these two quantities for each n. Lastly, the number of negative orbits of size n for the function f(z)=z^2-2, as counted by P.J. Myrberg, is shown to equal the number of MSS sequences of length n. For an MSS sequence P, let H_ϖ(P) be the unique common extension of the harmonics of P. In Chapter three it is proved that there is exactly one J(P)Σ[0,1] such that the itinerary of λ(P) under the map is λ(P)f_e is H_ϖ(P). In Chapter four it is shown that only period doubling or period halving bifurcations can occur for the family λf_e, λΣ[0,1]. Results concerning how the size of a stable orbit changes as bifurcations of the family λf_e occur are given. Let λΣ[0,1] be such that 1/2 is a periodic point of λf_e. In this case 1/2 is superstable. Chapter five investigates the boundary of the basin of attraction of this stable orbit. An algorithm is given that yields a graph directed construction such that the object constructed is the basin ...
Date: May 1988
Creator: Brucks, Karen M. (Karen Marie), 1957-

Operators on Continuous Function Spaces and Weak Precompactness

Description: If T:C(H,X)-->Y is a bounded linear operator then there exists a unique weakly regular finitely additive set function m:-->L(X,Y**) so that T(f) = ∫Hfdm. In this paper, bounded linear operators on C(H,X) are studied in terms the measure given by this representation theorem. The first chapter provides a brief history of representation theorems of these classes of operators. In the second chapter the represenation theorem used in the remainder of the paper is presented. If T is a weakly compact operator on C(H,X) with representing measure m, then m(A) is a weakly compact operator for every Borel set A. Furthermore, m is strongly bounded. Analogous statements may be made for many interesting classes of operators. In chapter III, two classes of operators, weakly precompact and QSP, are studied. Examples are provided to show that if T is weakly precompact (QSP) then m(A) need not be weakly precompact (QSP), for every Borel set A. In addition, it will be shown that weakly precompact and GSP operators need not have strongly bounded representing measures. Sufficient conditions are provided which guarantee that a weakly precompact (QSP) operator has weakly precompact (QSP) values. A sufficient condition for a weakly precomact operator to be strongly bounded is given. In chapter IV, weakly precompact subsets of L1(μ,X) are examined. For a Banach space X whose dual has the Radon-Nikodym property, it is shown that the weakly precompact subsets of L1(μ,X) are exactly the uniformly integrable subsets of L1(μ,X). Furthermore, it is shown that this characterization does not hold in Banach spaces X for which X* does not have the weak Radon-Nikodym property.
Date: August 1988
Creator: Abbott, Catherine Ann

Dually Semimodular Consistent Lattices

Description: A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the number of elements covering exactly k elements is equal to the number of elements covered by exactly k elements. Here, it is established that if a finite dually semimodular consistent lattice has the same number of join-irreducibles as meet-irreducibles, then it is modular. Hence, a converse of Dilworth's theorem, in the case when k equals 1, is obtained for finite dually semimodular consistent lattices. Several combinatorial results are shown for finite consistent lattices similar to those already established for finite geometric lattices. The reach of an element x in a lattice L is the difference between the rank of x*, the join of x and all the elements covering x, and the rank of x; the maximum reach of all elements in L is the reach of L. Sharp lower bounds for the total number of elements and the number of elements of a given reach in a semimodular consistent lattice given the rank, the reach, and the number of join-irreducibles are found. Extremal lattices attaining these bounds are described. Similar results are then obtained for finite dually semimodular consistent lattices.
Date: May 1988
Creator: Gragg, Karen E. (Karen Elizabeth)

Hausdorff, Packing and Capacity Dimensions

Description: In this thesis, Hausdorff, packing and capacity dimensions are studied by evaluating sets in the Euclidean space R^. Also the lower entropy dimension is calculated for some Cantor sets. By incorporating technics of Munroe and of Saint Raymond and Tricot, outer measures are created. A Vitali covering theorem for packings is proved. Methods (by Taylor and Tricot, Kahane and Salem, and Schweiger) for determining the Hausdorff and capacity dimensions of sets using probability measures are discussed and extended. The packing pre-measure and measure are shown to be scaled after an affine transformation. A Cantor set constructed by L.D. Pitt is shown to be dimensionless using methods developed in this thesis. A Cantor set is constructed for which all four dimensions are different. Graph directed constructions (compositions of similitudes follow a path in a directed graph) used by Mauldin and Willjams are presented. Mauldin and Williams calculate the Hausdorff dimension, or, of the object of a graph directed construction and show that if the graph is strongly connected, then the a—Hausdorff measure is positive and finite. Similar results will be shown for the packing dimension and the packing measure. When the graph is strongly connected, there is a constant so that the constant times the Hausdorff measure is greater than or equal to the packing measure when a subset of the realization is evaluated. Self—affine Sierpinski carpets, which have been analyzed by McMullen with respect to their Hausdorff dimension and capacity dimension, are analyzed with respect to their packing dimension. Conditions under which the Hausdorff measure of the construction object is positive and finite are given.
Date: August 1989
Creator: Spear, Donald W.

The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors

Description: We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the 5-point line, the 4-wheel W_4, and the 4-whirl W^4 as minors is 6n - 5, for n ≥ 3. Examples of geometries having rank n and size 6n - 5 include parallel connections of the geometries V_19 and PG(2,3).
Date: August 1989
Creator: Hipp, James W. (James William), 1956-

Centers of Invariant Differential Operator Algebras for Jacobi Groups of Higher Rank

Description: Let G be a Lie group acting on a homogeneous space G/K. The center of the universal enveloping algebra of the Lie algebra of G maps homomorphically into the center of the algebra of differential operators on G/K invariant under the action of G. In the case that G is a Jacobi Lie group of rank 2, we prove that this homomorphism is surjective and hence that the center of the invariant differential operator algebra is the image of the center of the universal enveloping algebra. This is an extension of work of Bringmann, Conley, and Richter in the rank 1case.
Date: August 2013
Creator: Dahal, Rabin

A Comparative Study of Non Linear Conjugate Gradient Methods

Description: We study the development of nonlinear conjugate gradient methods, Fletcher Reeves (FR) and Polak Ribiere (PR). FR extends the linear conjugate gradient method to nonlinear functions by incorporating two changes, for the step length αk a line search is performed and replacing the residual, rk (rk=b-Axk) by the gradient of the nonlinear objective function. The PR method is equivalent to FR method for exact line searches and when the underlying quadratic function is strongly convex. The PR method is basically a variant of FR and primarily differs from it in the choice of the parameter βk. On applying the nonlinear Rosenbrock function to the MATLAB code for the FR and the PR algorithms we observe that the performance of PR method (k=29) is far better than the FR method (k=42). But, we observe that when the MATLAB codes are applied to general nonlinear functions, specifically functions whose minimum is a large negative number not close to zero and the iterates too are large values far off from zero the PR algorithm does not perform well. This problem with the PR method persists even if we run the PR algorithm for more iterations or with an initial guess closer to the actual minimum. To improve the PR algorithm we suggest finding a better weighing parameter βk, using better line search method and/or using specific line search for certain functions and identifying specific restart criteria based on the function to be optimized.
Date: August 2013
Creator: Pathak, Subrat

Multifractal Measures

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.
Date: May 1994
Creator: Olsen, Lars

Sufficient Conditions for Uniqueness of Positive Solutions and Non Existence of Sign Changing Solutions for Elliptic Dirichlet Problems

Description: In this paper we study the uniqueness of positive solutions as well as the non existence of sign changing solutions for Dirichlet problems of the form $$\eqalign{\Delta u + g(\lambda,\ u) &= 0\quad\rm in\ \Omega,\cr u &= 0\quad\rm on\ \partial\Omega,}$$where $\Delta$ is the Laplace operator, $\Omega$ is a region in $\IR\sp{N}$, and $\lambda>0$ is a real parameter. For the particular function $g(\lambda,\ u)=\vert u\vert\sp{p}u+\lambda$, where $p={4\over N-2}$, and $\Omega$ is the unit ball in $\IR\sp{N}$ for $N\ge3$, we show that there are no sign changing solutions for small $\lambda$ and also we show that there are no large sign changing solutions for $\lambda$ in a compact set. We also prove uniqueness of positive solutions for $\lambda$ large when $g(\lambda,\ u)=\lambda f(u)$, where f is an increasing, sublinear, concave function with f(0) $<$ 0, and the exterior boundary of $\Omega$ is convex. In establishing our results we use a number of methods from non-linear functional analysis such as rescaling arguments, methods of order, estimation near the boundary, and moving plane arguments.
Date: August 1995
Creator: Hassanpour, Mehran

Natural Smooth Measures on the Leaves of the Unstable Manifold of Open Billiard Dynamical Systems

Description: In this paper, we prove, for a certain class of open billiard dynamical systems, the existence of a family of smooth probability measures on the leaves of the dynamical system's unstable manifold. These measures describe the conditional asymptotic behavior of forward trajectories of the system. Furthermore, properties of these families are proven which are germane to the PYC programme for these systems. Strong sufficient conditions for the uniqueness of such families are given which depend upon geometric properties of the system's phase space. In particular, these results hold for a fairly nonrestrictive class of triangular configurations of scatterers.
Date: December 1998
Creator: Richardson, Peter A. (Peter Adolph), 1955-

Minimality of the Special Linear Groups

Description: Let F denote the field of real numbers, complex numbers, or a finite algebraic extension of the p-adic field. We prove that the special linear group SLn(F) with the usual topology induced by F is a minimal topological group. This is accomplished by first proving the minimality of the upper triangular group in SLn(F). The proof for the upper triangular group uses an induction argument on a chain of upper triangular subgroups and relies on general results for locally compact topological groups, quotient groups, and subgroups. Minimality of SLn(F) is concluded by appealing to the associated Lie group decomposition as the product of a compact group and an upper triangular group. We also prove the universal minimality of homeomorphism groups of one dimensional manifolds, and we give a new simple proof of the universal minimality of S∞.
Date: December 1997
Creator: Hayes, Diana Margaret

Generalized Function Solutions to Nonlinear Wave Equations with Distribution Initial Data

Description: In this study, we consider the generalized function solutions to nonlinear wave equation with distribution initial data. J. F. Colombeau shows that the initial value problem u_tt - Δu = F(u); m(x,0) = U_0; u_t (x,0) = i_1 where the initial data u_0 and u_1 are generalized functions, has a unique generalized function solution u. Here we take a specific F and specific distributions u_0, u_1 then inspect the generalized function representatives for the initial value problem solution to see if the generalized function solution is a distribution or is more singular. Using the numerical technics, we show for specific F and specific distribution initial data u_0, u_1, there is no distribution solution.
Date: August 1996
Creator: Kim, Jongchul

Universal Branched Coverings

Description: In this paper, the study of k-fold branched coverings for which the branch set is a stratified set is considered. First of all, the existence of universal k-fold branched coverings over CW-complexes with stratified branch set is proved using Brown's Representability Theorem. Next, an explicit construction of universal k-fold branched coverings over manifolds is given. Finally, some homotopy and homology groups are computed for some specific examples of Universal k-fold branched coverings.
Date: May 1993
Creator: Tejada, Débora

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

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 gradients are explored. A theorem relating the B-gradient to the theory of Lagrange multipliers is stated as well. Basic theorems regarding the continuous steepest descent given by the Sobolev and B-gradients are stated in Chapter 4, and conditions for convergence in the application to the liquid crystal problem are given as well. Finally, in Chapter 5, the algorithm is described and numerical results are examined.
Date: August 1994
Creator: Garza, Javier, 1965-