Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Claremont Colleges (11)
- Portland State University (11)
- Indian Statistical Institute (10)
- California State University, San Bernardino (7)
- Illinois Math and Science Academy (4)
-
- TÜBİTAK (4)
- Loyola Marymount University and Loyola Law School (3)
- University of South Carolina (3)
- East Tennessee State University (2)
- Technological University Dublin (2)
- University of Minnesota Morris Digital Well (2)
- University of Richmond (2)
- Air Force Institute of Technology (1)
- Dartmouth College (1)
- Eastern Kentucky University (1)
- Gettysburg College (1)
- Governors State University (1)
- James Madison University (1)
- Loyola University Chicago (1)
- Minnesota State University, Mankato (1)
- Missouri State University (1)
- Montclair State University (1)
- Oberlin (1)
- Pittsburg State University (1)
- Rose-Hulman Institute of Technology (1)
- Union College (1)
- University at Albany, State University of New York (1)
- University of Connecticut (1)
- University of Mississippi (1)
- Utah State University (1)
- Publication Year
- Publication
-
- Mathematics and Statistics Faculty Publications and Presentations (11)
- Doctoral Theses (10)
- Theses Digitization Project (7)
- CMC Faculty Publications and Research (5)
- Theses and Dissertations (4)
-
- Turkish Journal of Mathematics (4)
- All HMC Faculty Publications and Research (3)
- Electronic Theses and Dissertations (3)
- Mathematics Faculty Works (3)
- Teacher Resources (3)
- Articles (2)
- Honors Theses (2)
- Mathematics Publications (2)
- All Capstone Projects (1)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
- All Graduate Theses, Dissertations, and Other Capstone Projects (1)
- CGU Theses & Dissertations (1)
- CMC Senior Theses (1)
- Dartmouth Scholarship (1)
- Department of Math & Statistics Faculty Publications (1)
- Exemplary Student Work (1)
- Honors Papers (1)
- Honors Scholar Theses (1)
- Journal of Humanistic Mathematics (1)
- LASER Journal (1)
- Legacy Theses & Dissertations (2009 - 2024) (1)
- MSU Graduate Theses (1)
- Math Faculty Publications (1)
- Mathematical Sciences Technical Reports (MSTR) (1)
- Mathematics and Statistics: Faculty Publications and Other Works (1)
- Publication Type
Articles 1 - 30 of 79
Full-Text Articles in Physical Sciences and Mathematics
Art And Math Via Cubic Polynomials, Polynomiography And Modulus Visualization, Bahman Kalantari
Art And Math Via Cubic Polynomials, Polynomiography And Modulus Visualization, Bahman Kalantari
LASER Journal
Throughout history, both quadratic and cubic polynomials have been rich sources for the discovery and development of deep mathematical properties, concepts, and algorithms. In this article, we explore both classical and modern findings concerning three key attributes of polynomials: roots, fixed points, and modulus. Not only do these concepts lead to fertile ground for exploring sophisticated mathematics and engaging educational tools, but they also serve as artistic activities. By utilizing innovative practices like polynomiography—visualizations associated with polynomial root finding methods—as well as visualizations based on polynomial modulus properties, we argue that individuals can unlock their creative potential. From crafting captivating …
The Number Systems Tower, Bill Bauldry, Michael J. Bossé, William J. Cook, Trina Palmer, Jaehee K. Post
The Number Systems Tower, Bill Bauldry, Michael J. Bossé, William J. Cook, Trina Palmer, Jaehee K. Post
Journal of Humanistic Mathematics
For high school and college instructors and students, this paper connects number systems, field axioms, and polynomials. It also considers other properties such as cardinality, density, subset, and superset relationships. Additional aspects of this paper include gains and losses through sequences of number systems. The paper ends with a great number of activities for classroom use.
Roots Of Quaternionic Polynomials And Automorphisms Of Roots, Olalekan Ogunmefun
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
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=0n ai zi, a polynomial of degree n with real coefficients satisfying 0 ≤ a0 ≤ a1 ≤ ⋯≤ an, 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
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 …
On Sharpening And Generalization Of Rivlin's Inequality, Prasanna Kumar, Gradimir Milovanovic
On Sharpening And Generalization Of Rivlin's Inequality, Prasanna Kumar, Gradimir Milovanovic
Turkish Journal of Mathematics
n inequality due to T. J. Rivlin from 1960 states that if $P(z)$ is a polynomial of degree $n$ having no zeros in $ z
Polynomials, Primes And The Pte Problem, Joseph C. Foster
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 …
The Siebeck-Marden-Northshield Theorem And The Real Roots Of The Symbolic Cubic Equation, Emil Prodanov
The Siebeck-Marden-Northshield Theorem And The Real Roots Of The Symbolic Cubic Equation, Emil Prodanov
Articles
The isolation intervals of the real roots of the symbolic monic cubic polynomial x 3 ` ax2 ` bx ` c are determined, in terms of the coefficients of the polynomial, by solving the Siebeck–Marden–Northshield triangle — the equilateral triangle that projects onto the three real roots of the cubic polynomial and whose inscribed circle projects onto an interval with endpoints equal to stationary points of the polynomial.
A Method For Locating The Real Roots Of The Symbolic Quintic Equation Using Quadratic Equations, Emil Prodanov
A Method For Locating The Real Roots Of The Symbolic Quintic Equation Using Quadratic Equations, Emil Prodanov
Articles
A method is proposed with which the locations of the roots of the monic symbolic quintic polynomial $x^5 + a_4 x^4 + a_3 x^3 + a_2 x^2 + a_1 x + a_0$ can be determined using the roots of two {\it resolvent} quadratic polynomials: $q_1(x) = x^2 + a_4 x + a_3$ and $q_2(x) = a_2 x^2 + a_1 x + a_0$, whose coefficients are exactly those of the quintic polynomial. The different cases depend on the coefficients of $q_1(x)$ and $q_2(x)$ and on some specific relationships between them. The method is illustrated with the full analysis of one of …
Combinatorial Models For Representations Of Simple And Affine Lie Algebras, Adam Lee Schultze
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 …
On The Growth Of Maximum Modulus Of Rational Functions With Prescribed Poles, Lubna Wali Shah
On The Growth Of Maximum Modulus Of Rational Functions With Prescribed Poles, Lubna Wali Shah
Turkish Journal of Mathematics
In this paper we prove a sharp growth estimate for rational functions with prescribed poles and restricted zeros in the Chebyshev norm on the unit disk in the complex domain. In particular we extend a polynomial inequality due to Dubinin (2007) to rational functions which also improves a result of Govil and Mohapatra (1998).
“Product Development: Model Rockets As Toys”, Kelly W. Remijan
“Product Development: Model Rockets As Toys”, Kelly W. Remijan
Teacher Resources
No abstract provided.
"American Football: Field Goals And Quadratic Functions”, Kelly W. Remijan
"American Football: Field Goals And Quadratic Functions”, Kelly W. Remijan
Teacher Resources
No abstract provided.
"Crash Reconstruction: Stopping Distance”, Kelly W. Remijan
"Crash Reconstruction: Stopping Distance”, Kelly W. Remijan
Teacher Resources
No abstract provided.
An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer
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
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
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.
Invariant Sum Defined In Terms Of Complex Multivariate Polynomial Given Degree, Matthew Niemiro '20
Invariant Sum Defined In Terms Of Complex Multivariate Polynomial Given Degree, Matthew Niemiro '20
Exemplary Student Work
We use a generalized version of arithmetic progressions to obtain a non- trivial everywhere-zero sum in terms of a complex univariate polynomial and its degree. We then remark on its generalization to multivariate polynomials.
Maria Agnesi Activity, Cynthia J. Huffman Ph.D.
Maria Agnesi Activity, Cynthia J. Huffman Ph.D.
Open Educational Resources - Math
This activity was originally created for a Women in Mathematics course to provide students with a small taste of some basic mathematics connected to the work of Maria Agnesi. The activity has the students look at some of her work in algebra and calculus (optional). It could also be used in other courses, such as history of math, a general education mathematics course, high school or college algebra, and calculus.
Radial Basis Function Generated Finite Differences For The Nonlinear Schrodinger Equation, Justin Ng
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 …
On A Frobenius Problem For Polynomials, Ricardo Conceição, R. Gondim, M. Rodriguez
On A Frobenius Problem For Polynomials, Ricardo Conceição, R. Gondim, M. Rodriguez
Math Faculty Publications
We extend the famous diophantine Frobenius problem to a ring of polynomials over a field~k. Similar to the classical problem we show that the n = 2 case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over ℤ to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
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.25log2(α)3 + 16.5log2(α)2 + …
Dynamically Distinguishing Polynomials, Andrew Bridy, Derek Garton
Dynamically Distinguishing Polynomials, Andrew Bridy, Derek Garton
Mathematics and Statistics Faculty Publications and Presentations
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field FpFp. We say a subset of Z[x]Z[x] is dynamically distinguishable mod p if the associated mod pdynamical systems are pairwise non-isomorphic. For any k,M∈Z>1k,M∈Z>1, we prove that there are infinitely many sets of integers MM of size M such that {xk+m∣m∈M}{xk+m∣m∈M} is dynamically distinguishable mod p for most p (in the sense of natural density). Our proof uses the Galois theory of dynatomic polynomials largely developed …
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Mathematical Sciences Technical Reports (MSTR)
The problem of exact polynomial factorization, in other words expressing a polynomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used …
Polynomials Of Small Mahler Measure With No Newman Multiples, Spencer Victoria Saunders
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
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
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 …
On An Effective Variation Of Kronecker's Approximation Theorem, Lenny Fukshansky
On An Effective Variation Of Kronecker's Approximation Theorem, Lenny Fukshansky
CMC Faculty Publications and Research
Let Λ ⊂ Rn be an algebraic lattice, coming from a projective module over the ring of integers of a number field K. Let Z ⊂ Rn be the zero locus of a finite collection of polynomials such that Λ |⊂ Z or a finite union of proper full-rank sublattices of Λ. Let K1 be the number field generated over K by coordinates of vectors in Λ, and let L1, . . . , Lt be linear forms in n variables with algebraic coefficients satisfying an appropriate linear independence condition over K1. For each ε > 0 and a ∈ Rn, …
Division Polynomials With Galois Group Su3(3).2 = G2(2), David P. Roberts
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 SU3(3).2 ∼= G2(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 G2 motives in the …
General Factoring Algorithms For Polynomials Over Finite Fields, Wade Combs
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 …