Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 2285 for “"Polynomials"”.
-
Waring's Problem for Linear Polynomials and Laurent Polynomials
… K. Hayman obtained lower bounds of p1 and p2 for polynomials, entire functions, rational functions and meromorphic functions. First, we consider Waring's problem for linear polynomials and get p 1 = k and p2 ≥ k + 1. Next, we study Waring's problem for Laurent polynomials and obtain lower …
-
Knot polynomials
… of the Knot type, is the one called Knot polynomials. The Knot polynomials are somehow easy to calculate, or at least they are easier to handle than other invariants of the Knot type, such as the presentation of the group of the Knot, or the elementary ideals. The Knot polynomials have …
-
Nice Polynomials
… of finding, constructing, and classifying nice polynomials. After a short history of previous results, we present a general property of nice polynomials which leads to an important modification of the concept of equivalence classes of nice polynomials. We give several important results on nice …
-
Independence Polynomials
… to giving several tools for computing these polynomials and giving closed-form representations of these polynomials for common classes of graphs, we prove two results concerning the roots of independence polynomials. The first result gives us the unique root of smallest modulus of the …
-
Orthogonal polynomials
This thesis will show work on Orthogonal Polynomials. In mathematics, the type of polynomials that are orthogonal to each other under inner product are called orthogonal polynomials. Jacobi polynomials, Laguerre polynomials, and Hermite polynomials are examples of classical orthogonal polynomials …
-
Orthogonal polynomials
This thesis will show work on Orthogonal Polynomials. In mathematics, the type of polynomials that are orthogonal to each other under inner product are called orthogonal polynomials. Jacobi polynomials, Laguerre polynomials, and Hermite polynomials are examples of classical orthogonal polynomials …
-
Integral-valued polynomials
… to investigate the Z-module of integral-valued polynomials and some of its special subsets, with particular attention given to theorems that characterize members of these subsets.</p><p>Chapter I introduces the topic and lists and explains the notation and abbreviations used in the text. Chapter …
-
Heights of Polynomials /
… problems related to various heights of polynomials. The height of a polynomial, in the most general sense, is a quantity by which we measure the complexity of the polynomial P. There are several different types of heights: the naive height H(P), the length L(P), the Euclidean norm ||P||, …
-
On PCF Polynomials
… that the set of post-critically finite (PCF) polynomials of given degree is a set of bounded height, up to PGL_2-conjugacy. This result is extended to show that the set of monic polynomials g(z) with rational coefficients of given degree such that there exists a d ≥ 2 such that g(z^d) is PCF, …
-
The Ultraspherical Polynomials
This study involves the ultraspherical polynomials, the Legendre polynomials, the Tchebichef polynomials of the first kind, and the Tchebichef polynomials of the second kind.
-
Multivariate orthogonal polynomials
… of this thesis is to define special orthogonal polynomials and develop efficient methods for employing them which have the same advantages with respect to functions of the type (1.2) as do univariate orthogonal polynomials in the simple case k=1. These new polynomials may be usefully termed …
-
Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials
… for computing normal forms for matrices of Ore polynomials while controlling coefficient growth. By formulating row reduction as a linear algebra problem, we obtain a fraction-free algorithm for row reduction for matrices of Ore polynomials. The algorithm allows us to compute the rank and a …
-
Shifted Eisenstein polynomials, irreducible compositions of polynomials and group key exchanges
… the natural density of shifted Eisenstein polynomials. This means that we compute the density of integer polynomials f(x) of a fixed degree n for which some shift f(x + i) for an integer i satisfies Eisenstein’s irreducibility criterion. We then also compute the density of affine Eisenstein …
-
A Finite Family of q-Orthogonal Polynomials and Resultants of Chebyshev Polynomials
Two problems related to orthogonal polynomials and special functions are considered. For q greater than 1 it is known that continuous q-Jacobi polynomials are orthogonal on the imaginary axis. The first problem is to find proper normalization to form a system of polynomials that are orthogonal on …
-
Hypergeometric multiple orthogonal polynomials
… devoted to the analysis of multiple orthogonal polynomials for indices on the so-called step-line with respect to absolutely continuous measures on the positive real line, whose moments are given by ratios of Pochhammer symbols (also known as rising factorials). We investigate both type I and …
Page 1 of 115