Physical Sciences and Mathematics Commons^™

Roots Of Quaternionic Polynomials And Automorphisms Of Roots, Olalekan Ogunmefun

Electronic Theses and Dissertations

The quaternions are an extension of the complex numbers which were first described by Sir William Rowan Hamilton in 1843. In his description, he gave the equation of the multiplication of the imaginary component similar to that of complex numbers. Many mathematicians have studied the zeros of quaternionic polynomials. Prominent of these, Ivan Niven pioneered a root-finding algorithm in 1941, Gentili and Struppa proved the Fundamental Theorem of Algebra (FTA) for quaternions in 2007. This thesis finds the zeros of quaternionic polynomials using the Fundamental Theorem of Algebra. There are isolated zeros and spheres of zeros. In this thesis, we …

Enestr¨Om-Kakeya Type Results For Complex And Quaternionic Polynomials, Matthew Gladin

Electronic Theses and Dissertations

The well known Eneström-Kakeya Theorem states that: for P(z)=∑_i=0ⁿ a_i zⁱ, a polynomial of degree n with real coefficients satisfying 0 ≤ a₀ ≤ a₁ ≤ ⋯≤ a_n, all zeros of P(z) lie in |z|≤1 in the complex plane. In this thesis, we will find inner and outer bounds in which the zeros of complex and quaternionic polynomials lie. We will do this by imposing restrictions on the real and imaginary parts, and on the moduli, of the complex and quaternionic coefficients. We also apply similar restrictions on complex polynomials with …

Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst

CGU Theses & Dissertations

We treat several problems related to the existence of lattice extensions preserving certain geometric properties and small-height zeros of various multilinear polynomials. An extension of a Euclidean lattice $L_1$ is a lattice $L_2$ of higher rank containing $L_1$ so that the intersection of $L_2$ with the subspace spanned by $L_1$ is equal to $L_1$. Our first result provides a counting estimate on the number of ways a primitive collection of vectors in a lattice can be extended to a basis for this lattice. Next, we discuss the existence of lattice extensions with controlled determinant, successive minima and covering radius. In …

Polynomials, Primes And The Pte Problem, Joseph C. Foster

Theses and Dissertations

This dissertation considers three different topics. In the first part of the dissertation, we use Newton Polygons to show that for the arithmetic functions g(n) = n t , where t ≥ 1 is an integer, the polynomials defined with initial condition P g 0 (X) = 1 and recursion P g n (X) = X n Xn k=1 g(k)P g n−k (X) are X/ (n!) times an irreducible polynomial. In the second part of the dissertation, we show that, for 3 ≤ n ≤ 8, there are infinitely many 2-adic integer solutions to the Prouhet-Tarry-Escott (PTE) problem, that are …

Combinatorial Models For Representations Of Simple And Affine Lie Algebras, Adam Lee Schultze

Legacy Theses & Dissertations (2009 - 2024)

Part I: Koskta-Foulkes polynomials are Lusztig's q-analogues of weight multiplicities for irreducible representations of semisimple Lie algebras. It has long been known that these polynomials can be written with all non-negative coefficients. A statistic on semistandard Young tableaux with partition content, called \textit{charge}, was used to give a combinatorial formula exhibiting this fact in type $A$. Defining a charge statistic beyond type $A$ has been a long-standing problem. In the first part of this thesis, we take a completely new approach based on the definition of Kostka-Foulkes polynomials as an alternating sum over Kostant partitions, which can be thought of …

An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer

Senior Honors Projects, 2020-current

Knot polynomials are polynomial equations that are assigned to knot projections based on the mathematical properties of the knots. They are also invariants, or properties of knots that do not change under ambient isotopy. In other words, given an invariant α for a knot K, α is the same for any projection of K. We will define these knot polynomials and explain the processes by which one finds them for a given knot projection. We will also compare the relative usefulness of these polynomials.

Curving Towards Bézout: An Examination Of Plane Curves And Their Intersection, Camron Alexander Robey Cohen

Honors Papers

One area of interest in studying plane curves is intersection. Namely, given two plane curves, we are interested in understanding how they intersect. In this paper, we will build the machinery necessary to describe this intersection. Our discussion will include developing algebraic tools, describing how two curves intersect at a given point, and accounting for points at infinity by way of projective space. With all these tools, we will prove Bézout’s theorem, a robust description of the intersection between two curves relating the degrees of the defining polynomials to the number of points in the intersection.

Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes

All Graduate Theses, Dissertations, and Other Capstone Projects

This paper will explore the use and construction of Gröbner bases through Buchberger's algorithm. Specifically, applications of such bases for solving systems of polynomial equations will be discussed. Furthermore, we relate many concepts in commutative algebra to ideas in computational algebraic geometry.

Radial Basis Function Generated Finite Differences For The Nonlinear Schrodinger Equation, Justin Ng

Theses and Dissertations

Solutions to the one-dimensional and two-dimensional nonlinear Schrodinger (NLS) equation are obtained numerically using methods based on radial basis functions (RBFs). Periodic boundary conditions are enforced with a non-periodic initial condition over varying domain sizes. The spatial structure of the solutions is represented using RBFs while several explicit and implicit iterative methods for solving ordinary differential equations (ODEs) are used in temporal discretization for the approximate solutions to the NLS equation. Splitting schemes, integration factors and hyperviscosity are used to stabilize the time-stepping schemes and are compared with one another in terms of computational efficiency and accuracy. This thesis shows …

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Polynomials Of Small Mahler Measure With No Newman Multiples, Spencer Victoria Saunders

Theses and Dissertations

A Newman polynomial is a polynomial with coefficients in f0;1g and with constant term 1. It is known that the roots of a Newman polynomial must lie in the slit annulus fz 2C: f��1 1 such that if a polynomial f (z) 2 Z[z] has Mahler measure less than s and has no nonnegative real roots, then it must divide a Newman polynomial. In this thesis, we present a new upper bound on such a s if it exists. We also show that there are infinitely many monic polynomials that have distinct Mahler measures which all lie below f, have …

Algebra Tutorial For Prospective Calculus Students, Matthew Mckain

All Capstone Projects

Many undergraduate degrees require students to take one or more courses in calculus. Majors in mathematics, science, and engineering are expected to enroll in several rigorous calculus courses, but those majoring in social and behavioral sciences and business must also have some basic understanding of calculus. The goal of this project is to create a web-based tutorial that can be used by the GSU Mathematics faculty to reinforce the algebra skills needed for introductory or Applied Calculus. The tutorial covers the concepts of the slopes of lines, polynomial arithmetic, factoring polynomials, rational expressions, solving quadratic equations, linear and polynomial inequalities, …

A Cycle Generating Function On Finite Local Rings, Tristen Kirk Wentling

MSU Graduate Theses

We say a function generates a cycle if its output returns the initial value for some number of successive applications of . In this thesis, we develop a class of polynomial functions for finite local rings and associated functions . We show that the zeros of one are precisely the fixed points of the other and that every ring element is either one of these fixed points or is in a cycle of fixed length equal to the order of 2 in the associated group of units. Particular emphasis is given to rings of integers modulo the square of a …

General Factoring Algorithms For Polynomials Over Finite Fields, Wade Combs

Online Theses and Dissertations

In this paper, we generate algorithms for factoring polynomials with coefficients in finite fields. In particular, we develop one deterministic algorithm due to Elwyn Berlekamp and one probabilistic algorithm due to David Cantor and Hans Zassenhaus. While some authors present versions of the algorithms that can only factor polynomials of a certain form, the algorithms we give are able to factor any polynomial over any finite field. Hence, the algorithms we give are the most general algorithms available for this factorization problem. After formulating the algorithms, we look at various ways they can be applied to more specialized inquiries. For …

On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh

CMC Senior Theses

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

An Analysis Of Polynomials That Commute Under Composition, Samuel J. Williams

Honors Theses

It is well known that polynomials commute under addition and multiplication. It turns out that certain polynomials also commute under composition. In this paper, we examine polynomials with coefficients in the field of complex numbers that commute under composition (also referred to as “commuting polynomials”). We begin this examination by defining what it means for polynomials to commute under composition. We then introduce sequences of commuting polynomials and observe how the polynomials in these sequences (later defined as chains) along with other commuting polynomials relate to a concept called similarity. These observations allow us to better understand the qualities and …

Selected Research In Covering Systems Of The Integers And The Factorization Of Polynomials, Joshua Harrington

Theses and Dissertations

In 1960, Sierpi\'{n}ski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. Such integers are known as Sierpi\'{n}ski numbers. Letting $f(x)=ax^r+bx+c\in\mathbb{Z}[x]$, Chapter 2 of this document explores the existence of integers $k$ such that $f(k)2^n+d$ is composite for all positive integers $n$. Chapter 3 then looks into a polynomial variation of a similar question. In particular, Chapter~\ref{CH:FH} addresses the question, for what integers $d$ does there exist a polynomial $f(x)\in\mathbb{Z}[x]$ with $f(1)\neq -d$ such that $f(x)x^n+d$ is reducible for all positive integers $n$. The last two chapters of …

Leonhard Euler's Contribution To Infinite Polynomials, Jack Dean Meekins

Theses Digitization Project

This thesis will focus on Euler's famous method for solving the infinite polynomial. It will show how he manipulated the sine function to find all possible points along the sine function such that the sine A would equal to y; these would be roots of the polynomial. It also shows how Euler set the infinite polynomial equal to the infinite product allowing him to determine which coefficients were equal to which reciprocals of the roots, roots squared, roots cubed, etc.

Prouhet-Tarry-Escott Problem, Juan Manuel Gutierrez

Theses Digitization Project

The purpose of this research paper is to gain a deeper understanding of a famous unsolved mathematical problem known as the Prouhet-Terry-Escott Problem. The Prouhet-Terry-Escott Problem is a complex problem that still has much to be discovered. This fascinating problem shows up in many areas of mathematics such as the study of polynomials, graph theory, and the theory of integral quadratic forms.

Geometric Invariants For A Class Of Semi-Fredholm Hilbert Modules., Shibananda Biswas Dr.

Doctoral Theses

One of the basic problem in the study of a Hilbert module H over the ring of polynomials C[z] := C[z1, . . . , zm] is to find unitary invariants (cf. [15,7]) for H. It is not always possible to find invariants that are complete and yet easy to compute. There are very few instances where a set of complete invariants have been identified. Examples are Hilbert modules over continuous functions (spectral theory of normal operator), contractive modules over the disc algebra (model theory for contractive operator) and Hilbert modules in the class Bn for a bounded domain C …

Covering Systems Of Polynomial Rings Over Finite Fields, Michael Wayne Azlin

Electronic Theses and Dissertations

In 1950 Paul Erdos observed that every integer belonged to a certain system of congruences with distinct moduli. He called such systems of congruences covering systems. Utilizing his covering system, he disproved a conjecture of de Polignac asking, “for every odd k, is there a prime of the form 2n + k?” Examples of covering systems of the integers are presented along with some brief history and a sketch of the disproof by Erd?s. Open conjectures concerning covering systems and best known results of attempts to prove these conjectures are given. Analogies are drawn between the integers and Fq[x], and …

An Investigation Of Kurosh's Theorem, Keith Anthony Earl

Theses Digitization Project

The purpose of this project will be an exposition of the Kurosh Theorem and the necessary and suffcient condition that A must be algebraic and satisfy a P.I. to be locally finite.

Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr.

Doctoral Theses

In everyday life, there arise many situations where two parties, sender and receiver, need to communicate. The channel through which they communicate is assumed to be binary symmetric, that is, it changes 0 to 1 and vice versa with equal probability. At the receiver’s end, the sent message has to be recovered from the corrupted received word using some reasonable mechanism. This real life problem has attracted a lot of research in the past few decades. A solution to this problem is obtained by adding redundancy in a systematic manner to the message to construct a codeword. The collection of …

Chinese Remainder Theorem And Its Applications, Jacquelyn Ha Lac

Theses Digitization Project

No abstract provided.

On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.

Doctoral Theses

In this thesis, we propose two new subband transforms entitled ISITRA and YKSK transforms and their possible applications in image compression and encryption. Both these transforms are developed based on a common model of multiplication known as Bino’s model of multiplication. ISITRA is a convolution based transforms i.e., that both forward and inverse transform of ISITRA is based on convolution as in DWT or 2-channel filter bank. However, it is much more general than the existing DWT or 2-channel filter bank scheme in the sense that it we can get different kinds of filters in addition to the filters specified …

The Solvability Of Polynomials By Radicals: A Search For Unsolvable And Solvable Quintic Examples, Robert Lewis Beyronneau

Theses Digitization Project

This project centers around finding specific examples of quintic polynomials that were and were not solvable. This helped to devise a method for finding examples of solvable and unsolvable quintics.

Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski

Honors Theses

In this project, we address the question: When can a polynomial p(x, y) of two variables be factored as p(x, y) = f(x)g(y), where f and g are polynomials of one variable. We answer this question, using linear algebra, and create a Mathematica program which carries out this factorization. For example,

3+3x-5x^3+y+xy-5/3x^3y+y^2+xy^2-5/3x^3y^2 = (1+x-5/3x^3)(3+y+y^2)

We then generalize this concept and ask: When can p(x,y) can be written as

p(x,y) = f1(x)g2(y)+f2(x)g2(y)+...+fr(x)gr(y)

where fj,gj are polynomials. This can certainly be done (for large enough r). Which is the minimum such r? Again, we have a Mathematica program which carries out this …

Studies On Finite Linear Cellular Automata., Palash Sarkar Dr.

Doctoral Theses

Cellular Automata were originally proposed by John von Neumann as formal models of self reproducing organisms. The structure studied was mostly an ane and two dimensional infinite grida, though higher dimensions were also considered. Computation universality and other computation theoretic questions were considered important. See Burks [24] for a collection of essays on important problems on cellular automata during this period. Later physicists and biologists began to study cellular automsta for the purpose of modelling in their respective domains. In the present era, cellalar automata is being atudied from many widely different angles, and the relationship of these structurea to …

Affine Varieties, Groebner Basis, And Applications, Eui Won James Byun

Theses Digitization Project

No abstract provided.

Time-Space Harmonic Polynomials For Stochastic Processes., Arindam Sengupta Dr.

Doctoral Theses

The sequence of polynomials of a single variable known as the Hermite polynomialshala) = ), k21, (-1)* ha(z) =has many close links with the Normal distribution. Their association goes very doep, and extends to several connections bet ween the two-variable Hermite polynomialsHll, 2) = the(z/t), . k21.and the prime example of Gaussian processes, that is Brownian motion, as well. Much of this connection stems from what we term the time-space harmonic property of these polynomials for the Brownian motion process. An exact definition of this property follows later. A natural question that arises is, for stochastic processes in general, when …