Mathematics Commons^™

Division Polynomials With Galois Group Su3(3).2 = G2(2), David P. Roberts

Mathematics Publications

We use a rigidity argument to prove the existence of two related degree twenty-eight covers of the projective plane with Galois group SU₃(3).2 ∼= G₂(2). Constructing corresponding two-parameter polynomials directly from the defining group-theoretic data seems beyond feasibility. Instead we provide two independent constructions of these polynomials, one from 3-division points on covers of the projective line studied by Deligne and Mostow, and one from 2-division points of genus three curves studied by Shioda. We explain how one of the covers also arises as a 2-division polynomial for a family of G₂ motives in the …

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.

Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna

Honors Scholar Theses

Finite fields, and the polynomial rings over them, have many neat algebraic properties and identities that are very convenient to work with. In this paper we will start by exploring said properties with the goal in mind of being able to use said properties to efficiently irreducibly factorize polynomials over these fields, an important action in the fields of discrete mathematics and computer science. Necessarily, we must also introduce the concept of an algorithm’s speed as well as particularly speeds of basic modular and integral arithmetic opera- tions. Outlining these concepts will have laid the groundwork for us to introduce …

An Analysis Of The Practical Dpg Method, Jay Gopalakrishnan, Weifeng Qiu

Mathematics and Statistics Faculty Publications and Presentations

We give a complete error analysis of the Discontinuous Petrov Galerkin (DPG) method, accounting for all the approximations made in its practical implementation. Specifically, we consider the DPG method that uses a trial space consisting of polynomials of degree p on each mesh element. Earlier works showed that there is a "trial-to-test" operator T, which when applied to the trial space, defines a test space that guarantees stability. In DPG formulations, this operator T is local: it can be applied element-by-element. However, an infinite dimensional problem on each mesh element needed to be solved to apply T. In practical computations, …

Conditional Tests On Basins Of Attraction With Finite Fields, Ian H. Dinwoodie

Mathematics and Statistics Faculty Publications and Presentations

An iterative method is given for computing the polynomials that vanish on the basin of attraction of a steady state in discrete polynomial dynamics with finite field coefficients. The algorithm is applied to dynamics of a T cell survival network where it is used to compare transition maps conditional on a basin of attraction.

Foundations Of Tropical Geometry Classification Of Polynomials, Nathan Manwaring, Dr. Tyler Jarvis

Journal of Undergraduate Research

Tropical Mathematics is a relatively new field of mathematics that is getting a lot of attention recently. It is applicable in the field of Combinatorics as well as Phylogenetics, and more uses are being found each day. Our goal was to find a way to classify Tropical Polynomials so that they may be better understood and ultimately bridge the gap between different applications and discoveries in Tropical Mathematics.

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 …

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.

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.

On The Hardness Of Counting And Sampling Center Strings, Christina Boucher, Mohamed Omar

All HMC Faculty Publications and Research

Given a set S of n strings, each of length ℓ, and a nonnegative value d, we define a center string as a string of length ` that has Hamming distance at most d from each string in S. The #CLOSEST STRING problem aims to determine the number of center strings for a given set of strings S and input parameters n, ℓ, and d. We show #CLOSEST STRING is impossible to solve exactly or even approximately in polynomial time, and that restricting #CLOSEST STRING so that any one of the parameters n, ℓ, or d is fixed leads to …

Wavenumber Explicit Analysis Of A Dpg Method For The Multidimensional Helmholtz Equation, Leszek Demkowicz, Jay Gopalakrishnan, Ignacio Muga, Jeffrey Zitelli

Mathematics and Statistics Faculty Publications and Presentations

We study the properties of a novel discontinuous Petrov Galerkin (DPG) method for acoustic wave propagation. The method yields Hermitian positive definite matrices and has good pre-asymptotic stability properties. Numerically, we find that the method exhibits negligible phase errors (otherwise known as pollution errors) even in the lowest order case. Theoretically, we are able to prove error estimates that explicitly show the dependencies with respect to the wavenumber ω, the mesh size h, and the polynomial degree p. But the current state of the theory does not fully explain the remarkably good numerical phase errors. Theoretically, comparisons are made with …

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 …

Polynomial Extension Operators. Part Iii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

In this concluding part of a series of papers on tetrahedral polynomial extension operators, the existence of a polynomial extension operator in the Sobolev space H(div) is proven constructively. Specifically, on any tetrahedron K, given a function w on the boundary ∂K that is a polynomial on each face, the extension operator applied to w gives a vector function whose components are polynomials of at most the same degree in the tetrahedron. The vector function is an extension in the sense that the trace of its normal component on the boundary ∂K coincides with w. Furthermore, the extension operator is …

Analysis Of Hdg Methods For Stokes Flow, Bernardo Cockburn, Jay Gopalakrishnan, Ngoc Cuong Nguyen, Jaume Peraire, Francisco-Javier Sayas

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree $ k$ for all the components of the approximate solution of the gradient-velocity-pressure formulation. The novelty of the analysis is the use of a new projection tailored to the very structure of the numerical traces of the method. It renders the analysis of the projection of the errors very concise and allows us to see that the projection of the error in the velocity superconverges. As a consequence, we prove that the approximations of the velocity gradient, the …

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 …

Information-Preserving Structures: A General Framework For Quantum Zero-Error Information, Robin Blume-Kohout, Hui Khoon Ng, David Poulin, Lorenza Viola

Dartmouth Scholarship

Quantum systems carry information. Quantum theory supports at least two distinct kinds of information (classical and quantum), and a variety of different ways to encode and preserve information in physical systems. A system’s ability to carry information is constrained and defined by the noise in its dynamics. This paper introduces an operational framework, using information-preserving structures, to classify all the kinds of information that can be perfectly (i.e., with zero error) preserved by quantum dynamics. We prove that every perfectly preserved code has the same structure as a matrix algebra, and that preserved information can always be corrected. We …

Invariant And Coinvariant Spaces For The Algebra Of Symmetric Polynomials In Non-Commuting Variables, Francois Bergeron, Aaron Lauve

Mathematics and Statistics: Faculty Publications and Other Works

We analyze the structure of the algebra K⟨x⟩Sn of symmetric polynomials in non-commuting variables in so far as it relates to K[x]Sn, its commutative counterpart. Using the "place-action" of the symmetric group, we are able to realize the latter as the invariant polynomials inside the former. We discover a tensor product decomposition of K⟨x⟩Sn analogous to the classical theorems of Chevalley, Shephard-Todd on finite reflection groups.

Résumé. Nous analysons la structure de l'algèbre K⟨x⟩Sn des polynômes symétriques en des variables non-commutatives pour obtenir des analogues des résultats classiques concernant la structure de l'anneau K[x]Sn des polynômes symétriques en des variables …

Algebraic Points Of Small Height Missing A Union Of Varieties, Lenny Fukshansky

CMC Faculty Publications and Research

Let K be a number field, Q, or the field of rational functions on a smooth projective curve over a perfect field, and let V be a subspace of K^N where N≥ 2. Let Z_K be a union of varieties defined over K such that V ⊈ Z_K. We prove the existence of a point of small height in V \ Z_K, providing an explicit upper bound on the height of such a point in terms of the height of V and the degree of hypersurface containing Z_K, where dependence on …

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 …

Integral Orthogonal Bases Of Small Height For Real Polynomial Spaces, Lenny Fukshansky

CMC Faculty Publications and Research

Let P_N(R) be the space of all real polynomials in N variables with the usual inner product < , > on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form representing this inner product on the space of coefficient vectors of all polynomials in P_N(R) of degree ≤ M. We exhibit two applications of this formula. First, given a finite dimensional subspace V of P_N(R) defined over Q, we prove the existence of an orthogonal basis for (V, < , >), consisting of polynomials of small height …

Search Bounds For Zeros Of Polynomials Over The Algebraic Closure Of Q, Lenny Fukshansky

CMC Faculty Publications and Research

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of unions of subspaces. All bounds on the height are explicit.

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

Consider the tangential trace of a vector polynomial on the surface of a tetrahedron. We construct an extension operator that extends such a trace function into a polynomial on the tetrahedron. This operator can be continuously extended to the trace space of H(curl ). Furthermore, it satisfies a commutativity property with an extension operator we constructed in Part I of this series. Such extensions are a fundamental ingredient of high order finite element analysis.

Chinese Remainder Theorem And Its Applications, Jacquelyn Ha Lac

Theses Digitization Project

No abstract provided.

Polynomial Extension Operators. Part I, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

In this series of papers, we construct operators that extend certain given functions on the boundary of a tetrahedron into the interior of the tetrahedron, with continuity properties in appropriate Sobolev norms. These extensions are novel in that they have certain polynomial preservation properties important in the analysis of high order finite elements. This part of the series is devoted to introducing our new technique for constructing the extensions, and its application to the case of polynomial extensions from H^½(∂K) into H¹(K), for any tetrahedron K.

Fractalized Cyclotomic Polynomials, David P. Roberts

Mathematics Publications

For each prime power p^m, we realize the classical cyclotomic polynomial Φ_p^m(x) as one of a collection of 3^m different polynomials in Z[x]. We show that the new polynomials are similar to Φ_p^m(x) in many ways, including that their discriminants all have the form ±p^c. We show also that the new polynomials are more complicated than Φ_p^m(x) in other ways, including that their complex roots are generally fractal in appearance.

The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennet

All HMC Faculty Publications and Research

No abstract provided in this article.

The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennett

Mathematics, Statistics and Data Science Faculty Works

No abstract provided.

A Sequence Of Polynomials For Approximating Arctangent, Herbert A. Medina

Mathematics, Statistics and Data Science Faculty Works

No abstract provided.