No description available.

A balanced double square in a string x consists of two squares starting in the same position and of comparable lengths. We present a unique fac- torization of the longer square into primitive components refereed to as the canonical factorization and analyze its properties. In particular, we examine the inversion factors and the right and left inversion subfactors. All three substrings are collectively referred to as rare factors as they occur only twice in a signi cant portion of the larger square. The inversion factors were es- sential for determining the classi cation of mutual con gurations of double squares and thus providing the best-to-date upper bound of 11n=6 for the number of distinct squares in a string of length n by Deza, Franek, and Thierry. The right and left inversion subfactors have the advantage of being half the length of the inversion factors, thus providing a stronger dis- crimination property for a possible third square. This part of the thesis was published by Bai, Franek, and Smyth. The canonical factorization and the right and left inversion subfactors are used to formulate and prove a signi cantly stronger version of the New Periodicity Lemma by Fan, Puglisi, Smyth, and Turpin, 2006, that basically restricts what kind of a third square can exists in a balanced double square. This part of the thesis was published by Bai, Franek, and Smyth. The canonical factorization and the inversion factors are applied to for- mulate and prove a stronger version of the Three Squares Lemma by Crochemore and Rytter. This part of the thesis was published by Bai, Deza, and Franek. / Thesis / Doctor of Philosophy (PhD)

The study of factorization in integral domains has a long history. Unique factorization domains, like the integers, have been studied extensively for many years. More recently, mathematicians have turned their attention to generalizations of this such as Dedekind domains or other domains which have weaker factorization properties. Many authors have sought to generalize the notion of factorization in domains. One particular method which has encapsulated many of the generalizations into a single study is that of tau-factorization, studied extensively by A. Frazier and D.D. Anderson. Another generalization comes in the form of studying factorization in rings with zero-divisors. Factorization gets quite complicated when zero-divisors are present due to the existence of several types of associate relations as well as several choices about what to consider the irreducible elements. In this thesis, we investigate several methods for extending the theory of tau-factorization into rings with zero-divisors. We investigate several methods including: 1) the approach used by A.G. Agargun and D.D. Anderson, S. Chun and S. Valdes-Leon in several papers; 2) the method of U-factorization developed by C.R. Fletcher and extended by M. Axtell, J. Stickles, and N. Baeth and 3) the method of regular factorizations and 4) the method of complete factorizations. This thesis synthesizes the work done in the theory of generalized factorization and factorization in rings with zero-divisors. Along the way, we encounter several nice applications of the factorization theory. Using tau_z-factorizations, we discover a nice relationship with zero-divisor graphs studied by I. Beck as well as D.D. Anderson, D.F. Anderson, A. Frazier, A. Lauve, and P. Livingston. Using tau-U-factorization, we are able to answer many questions that arise when discussing direct products of rings. There are several benefits to the regular factorization factorization approach due to the various notions of associate and irreducible coinciding on regular elements greatly simplifying many of the finite factorization property relationships. Complete factorization is a very natural and effective approach taken to studying factorization in rings with zero-divisors. There are several nice results stemming from extending tau-factorization in this way. Lastly, an appendix is provided in which several examples of rings satisfying the various finite factorization properties studied throughout the thesis are given.

Abstract in English / The research will analyze and compare the current research on the spectral factorization of non-singular and singular matrices. We show that a nonsingular non-scalar matrix A can be written as a product A = BC where the eigenvalues of B and C are arbitrarily prescribed subject to the condition that the product of the eigenvalues of B and C must be equal to the determinant of A. Further, B and C can be simultaneously triangularised as a lower and upper triangular matrix respectively. Singular matrices will be factorized in terms of nilpotent matrices and otherwise over an arbitrary or complex field in order to present an integrated and detailed report on the current state of research in this area. Applications related to unipotent, positive-definite, commutator, involutory and Hermitian factorization are studied for non-singular matrices, while applications related to positive-semidefinite matrices are investigated for singular matrices. We will consider the theorems found in Sourour [24] and Laffey [17] to show that a non-singular non-scalar matrix can be factorized spectrally. The same two articles will be used to show applications to unipotent, positive-definite and commutator factorization. Applications related to Hermitian factorization will be considered in [26]. Laffey [18] shows that a non-singular matrix A with det A = ±1 is a product of four involutions with certain conditions on the arbitrary field. To aid with this conclusion a thorough study is made of Hoffman [13], who shows that an invertible linear transformation T of a finite dimensional vector space over a field is a product of two involutions if and only if T is similar to T−1. Sourour shows in [24] that if A is an n × n matrix over an arbitrary field containing at least n + 2 elements and if det A = ±1, then A is the product of at most four involutions. We will review the work of Wu [29] and show that a singular matrix A of order n ≥ 2 over the complex field can be expressed as a product of two nilpotent matrices, where the rank of each of the factors is the same as A, except when A is a 2 × 2 nilpotent matrix of rank one. Nilpotent factorization of singular matrices over an arbitrary field will also be investigated. Laffey [17] shows that the result of Wu, which he established over the complex field, is also valid over an arbitrary field by making use of a special matrix factorization involving similarity to an LU factorization. His proof is based on an application of Fitting's Lemma to express, up to similarity, a singular matrix as a direct sum of a non-singular and nilpotent matrix, and then to write the non-singular component as a product of a lower and upper triangular matrix using a matrix factorization theorem of Sourour [24]. The main theorem by Sourour and Tang [26] will be investigated to highlight the necessary and sufficient conditions for a singular matrix to be written as a product of two matrices with prescribed eigenvalues. This result is used to prove applications related to positive-semidefinite matrices for singular matrices. / National Research Foundation of South Africa / Mathematical Sciences / M Sc. (Mathematics)

We define morphism (E, M)-structures in an abstract category, develop their basic properties and present some examples. We also consider the existence of such factorization structures, and find conditions under which they can be extended to factorization structures for certain classes of sources. There is a Galois correspondence between the collection of all subclasses of X-morphisms and the collection of all subclasses of X-objects. A-epimorphisms diagonalize over A-regular morphisms. Given an (E, M)-factorization structure on a finitely complete category, E-separated objects are those for which diagonal morphisms lie in M. Other characterizations of E-separated objects are given. We give a bijective correspondence between the class of all (E, M)factorization structures with M contained in the class of all X-embeddings and the class of all strong limit operators. We study M-preserving morphisms, M-perfect morphisms and M-compact objects in a morphism (E, M)-hereditary construct, and prove some of their properties which are analogous to the topological ones. / Mathematical Sciences / M. Sc. (Mathematics)

The efficiency of interior-point algorithms for linear programming is related to the effort required to factorize the matrix used to solve for the search direction at each iteration. When the linear program is in symmetric form (i.e., the constraints are Ax b, x > 0 ), then there are two mathematically equivalent forms of the search direction, involving different matrices. One form necessitates factoring a matrix whose sparsity pattern has the same form as that of (A AT). The other form necessitates factoring a matrix whose sparsity pattern has the same form as that of (ATA). Depending on the structure of the matrix A, one of these two forms may produce significantly less fill-in than the other. Furthermore, by analyzing the fill-in of both forms prior to starting the iterative phase of the algorithm, the form with the least fill-in can be computed and used throughout the algorithm. Finally, this methodology can be applied to linear programs that are not in symmetric form, that contain both equality and inequality constraints.

The objective of this dissertation is to develop a suitable statistical methodology for functional data analysis. Modern advanced technology allows researchers to collect samples as functional which means the ideal unit of samples is a curve. We consider each functional observation as the resulting of a digitized recoding or a realization from a stochastic process. Traditional statistical methodologies often fail to be applied to this functional data set due to the high dimensionality. Functional hypothesis testing is the main focus of my dissertation. We suggested a testing procedure to determine the significance of two curves with order restriction. This work was motivated by a case study involving high-dimensional and high-frequency tidal volume traces from the New York State Psychiatric Institute at Columbia University. The overall goal of the study was to create a model of the clinical panic attack, as it occurs in panic disorder (PD), in normal human subjects. We proposed a new dimension reduction technique by non-negative basis matrix factorization (NBMF) and adapted a one-degree of freedom test in the context of multivariate analysis. This is important because other dimension techniques, such as principle component analysis (PCA), cannot be applied in this context due to the order restriction. Another area that we investigated was the estimation of functions with constrained restrictions such as convexification and/or monotonicity, together with the development of computationally efficient algorithms to solve the constrained least square problem. This study, too, has potential for applications in various fields. For example, in economics the cost function of a perfectly competitive firm must be increasing and convex, and the utility function of an economic agent must be increasing and concave. We propose an estimation method for a monotone convex function that consists of two sequential shape modification stages: (i) monotone regression via solving a constrained least square problem and (ii) convexification of the monotone regression estimate via solving an associated constrained uniform approximation problem.

The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Title from PDF of title page (University of Missouri--Columbia, viewed on December 30, 2009). Thesis advisor: Dr. William Banks. Includes bibliographical references.

Let X be a simply connected compact Riemannian symmetric space, let U be the universal covering group of the identity component of the isometry group of X, and let g denote the complexification of the Lie algebra of U, g=u^C. Each u-compatible triangular decomposition g= n_- + h + n_+ determines a Poisson Lie group structure pi_U on U. The Evens-Lu construction produces a (U, pi_U)-homogeneous Poisson structure on X. By choosing the basepoint in X appropriately, X is presented as U/K where K is the fixed point set of an involution which stabilizes the triangular decomposition of g. With this presentation, a connection is established between the symplectic foliation of the Evens-Lu Poisson structure and the Birkhoff decomposition of U/K. This is done through reinterpretation of results of Pickrell. Each symplectic leaf admits a natural torus action. It is shown that these actions are Hamiltonian and the momentum maps are computed using triangular factorization. Finally, local formulas for the Evens-Lu Poisson structure are displayed in several examples.

In this study, we address the factorization problem in the Hardy H('p) spaces, and provide a fast algorithm for its implementation with applications to some important engineering problems. The Thesis is presented in three autonomous papers. / In the first paper we lay down the technical foundation of the new approach in the scalar case. First, the factorization problem is formulated in the H('p) spaces. A formulation with sufficient generality to encompass practically all such engineering problems. Necessary and sufficient conditions for the existence of the spectral factors are derived, and a characterization of the class of functions admitting a canonical factorization is obtained. The reduction method is applied to certain Toeplitz equations in H('2) space to generate a sequence of approximate spectral factors. When the Laguerre basis is used in the reduction method the Toeplitz equation turns out to a Toeplitz set of linear equations. We also provide an error bound and an estimate for the speed of convergence. / In the second paper the matrix version of all the scalar results is provided and enriched with discussions and extension. In particular, we have shown that the factorization problem is associated with the solutions of certain Toeplitz equations in / (DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI) / spaces. The classical Gohberg-Krein factorization is re-examined within the framework developed here, and the connections between the outer-factorization, the canonical factorization, and inversion of certain Toeplitz operators have also been unveiled. / In Part III we generalize the Davis and Barry formula for the feedback gain in the LQR problems. The new setting, equipped with the spectral factorization method, provides fast and efficient algorithms for solving a wide class of LQR problems, rational matrix factorization, and positive polynomials factorization. Our parallel results for the discrete time case are given in brief together with many interesting computational properties.