Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Number Theory
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 + …
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 …
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
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
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 …
Prouhet-Tarry-Escott Problem, Juan Manuel Gutierrez
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
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.
Algebraic Points Of Small Height Missing A Union Of Varieties, Lenny Fukshansky
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 KN where N≥ 2. Let ZK be a union of varieties defined over K such that V ⊈ ZK. We prove the existence of a point of small height in V \ ZK, 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 ZK, where dependence on …
The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennet
The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennet
All HMC Faculty Publications and Research
No abstract provided in this article.