No description available.

No description available.

The primary intent of this thesis is to uncover the presence of matrices in polynomials and also to demonstrate that wherever there are vast numbers of interlocking relationships that must be handled, it is reasonable to guess that matrices will appear on the scene and lend their strength to facilitate the process. Most important of all, I seriously expose this omnipresent ability of matrices in polynomials and matrix equations. Matrix polynomials and equations are, in the main, a part of algebra, but it has become increasingly clear that they possess a utility that extends beyond the domain of algebra into other regions of mathematics. More than this, we have discovered that they are exactly the means necessary for expressing many ideas of applied mathematics. My thesis illustrates this for polynomials and equations of matrices.

The n-antiprism graph is not widely studied as a class of graphs in graph theory hence there is not much literature. We begin by de ning the n-antiprism graph and discussing properties, which we prove in the thesis, and which have not been previously presented in graph theory literature. Some of our signi cant results include proving that an n-antiprism is 4-connected, 4-edge connected and has a pathwidth of 4. A highly studied area of graph theory is the chromatic polynomial of graphs. We investigate the chromatic polynomial of the antiprism graph and attempt to nd explicit expressions for the chromatic polynomial of the antiprism graph. We express this chromatic polynomial in several forms to discover the best-suited form. We then explore the Tutte polynomial and search for an explicit expression of the Tutte polynomial of the antiprism graph. Using the relationship between a graph and its dual graph, we provide an iterative expression of the Tutte polynomial of the antiprism graph.

Firstly we express the chromatic polynomials of some graphs in tree form. We then Study a special product that comes natural and is useful in the calculation of some Chromatic polynomials. Next we use the tree form to study the chromatic polynomial Of a graph obtained from a forest (tree) by "blowing up" or "replacing" the vertices Of the forest (tree) by a graph. Then we give explicit expressions, in terms of induced Subgraphs, for the first five coefficients of the chromatic polynomial of a connected Graph. In the case of higher order graphs we develop some useful computational Techniques to obtain some higher order coefficients. In the process we obtain some Useful combinatorial identities, some of which are new. We discuss in detail the Application of these combinatorial identities to some families of graphs. We also discuss Pairs of graphs that are chromatically equivalent and graph that are chromatically Unique with special emphasis on wheels. In conclusion,

Li, Zhening. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 138-146). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Thesis (M.A.)--Boston University / PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you. / This paper deals with methods of Chebyshev approximation. In particular polynomial approximation of continuous functions on a finite interval are discussed. Chapter I deals with the existence and uniqueness of Chebyshev or C-polynomials. In addition, some properties of the extremal points of the error function are derived, where the error fUnction E(x) = f(x) - p(x), p(x) being the C-polynomial. Chapter II discusses a method for finding the C-polynomial of degree n--the exchange method. After choosing a set of n+2 distinct abscissas, or a reference set, the so-called levelled reference polynomial is computed by the method of divided differences or by using the approximation errors of this polynomial. A point xj of maximal error is obtained and introduced into a new reference. A new levelled reference polynomial is then computed. This process continues until a reference is gotten, whose reference deviation equals the maximal approximating error of the levelled reference polynomial. The reference deviation is the common absolute value of the levelled reference polynomial at each of the reference points. The levelled reference polynomial for this reference is then shown to be the desired C-polynomial. Chapter III deals with phase methods for constructing the a-polynomial. It is shown that under suitable restrictions, if a Pn, A and €(phi) can be found such that the basic relation f(cos phi) = Pn(cos phi) + A cos[(n+1)phi + E(phi)] is satisfied on the approximation interval, then Pn is the a-polynomial. Two methods for finding the amplitude A and the phase function €(phi) are discussed. The complex method assumes f to be analytic on a domain and uses Cauchy's integral formula to obtain new values of €(phi), starting with a set of initial values. These values in turn generate new values of Pn and A. The values of Pn as well as values of A and €(phi) at certain points are gotten through convergence of this iterative scheme. Then an interpolation formula is used to obtain Pn from its values at these points. The second method attempts to find A, €(phi) and Pn so as to satisfy the basic relation only on a discrete set of points. First, assuming €(phi) so small that cos €(phi) may be replaced by 1, an expression is obtained for Pn(cos phi). In the general case, a system of phase equations is given, from which €(phi), A and hence Pn may be obtained. Although these results are valid only on a discrete set of points in the approximation interval, the polynomial derived in this way represents a good approximation to f(x). / 2031-01-01

Lee, King Leung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leave 95). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.6 / Chapter 1.1 --- Organization --- p.10 / Chapter 2 --- Semigroups and Cones --- p.13 / Chapter 2.1 --- Relation between Semigroups and Cones --- p.13 / Chapter 2.2 --- Subadditive Functions on Semigroups --- p.23 / Chapter 2.3 --- Relation between Cones and Bases --- p.29 / Chapter 3 --- General Theories of Okounkov Bodies --- p.33 / Chapter 3.1 --- Okounkov Bodies and Volumes --- p.33 / Chapter 3.2 --- Relation of Subadditive Functions on Semigroups and Okounkov Bodies --- p.39 / Chapter 3.3 --- Convex Functions on Okounkov Bodies --- p.47 / Chapter 4 --- Okounkov Bodies and Complex Geometry --- p.55 / Chapter 4.1 --- Holomorphic Line Bundles --- p.55 / Chapter 4.2 --- Chebyshev Transform --- p.65 / Chapter 4.3 --- Bernstein-Markov Norms --- p.74 / Chapter 5 --- Applications of Okounkov Bodies --- p.81 / Chapter 5.1 --- Relative Energy of Weights --- p.81 / Chapter 5.2 --- Computational Methods and Some Examples --- p.89 / Bibliography --- p.95

A Dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the Degree of Master of Science. Johannesburg 2015. / This Dissertation focuses on the Jacobi polynomial. Specifically, it discusses certain aspects of the zeros of the Jacobi polynomial such as the interlacing property and quasiorthogonality. Also found in the Dissertation is a chapter on the inequalities of the zeros of the Jacobi polynomial, mainly those developed by Walter Gautschi.

We present a combinatorial interpretation of Chebyshev polynomials. The nth Chebyshev polynomial of the first kind, Tn(x), counts the sum of all weights of n-tilings using light and dark squares of weight x and dominoes of weight −1, and the first tile, if a square must be light. If we relax the condition that the first square must be light, the sum of all weights is the nth Chebyshev polynomial of the second kind, Un(x). In this paper we prove many of the beautiful Chebyshev identities using the tiling interpretation.