Mathematics Commons^™

Characterizing The Properties Of Specific Binomial Coefficients In Congruence Relations, Tyler Robert Russ

Master's Theses and Doctoral Dissertations

The number theoretic conjecture we examine in this paper originates when trying to construct a characterizable generating set for the complex cobordism polynomial ring. To date there is no efficient, universal method for characterizing such a generating set. Wilfong conjectures that smooth projective toric varieties can act as these generators [7]. Toric varieties are related to polytopes by a bijective correspondence. Studying the combinatorial structure of these polytopes is much more manageable than studying properties of toric varieties directly. This gives rise to the number theoretic conjecture considered here. A proof of this number theoretic conjecture would in turn prove …

A Short Note On Sums Of Powers Of Reciprocals Of Polygonal Numbers, Jihang Wang, Suman Balasubramanian

Student Research

This paper presents the summation of powers of reciprocals of polygonal numbers. Several summation formulas of the reciprocals of generalized polygonal numbers are presented as examples of specific cases in this paper.

Commutative N-Ary Arithmetic, Aram Bingham

University of New Orleans Theses and Dissertations

Motivated by primality and integer factorization, this thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation. This class of operations are constructed to preserve commutativity and identity so that binary multiplication is included as a special case, in order to preserve relationships with ordinary multiplicative number theory. This leads to a study of their expression in terms of elementary symmetric polynomials, and connections are made to results from the theory of polyadic (n-ary) groups. Higher order operations yield wider factorization and representation possibilities which correspond to reductions in the set of primes …

Explorations Of The Collatz Conjecture (Mod M), Glenn Micah Jackson Jr

Honors College Theses

The Collatz Conjecture is a deceptively difficult problem recently developed in mathematics. In full, the conjecture states: Begin with any positive integer and generate a sequence as follows: If a number is even, divide it by two. Else, multiply by three and add one. Repetition of this process will eventually reach the value 1. Proof or disproof of this seemingly simple conjecture have remained elusive. However, it is known that if the generated Collatz Sequence reaches a cycle other than 4, 2, 1, the conjecture is disproven. This fact has motivated our search for occurrences of 4, 2, 1, and …

Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair

Graduate Student Publications and Research

Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:

f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n

where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.

This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).

Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors answer the question proposed by Florentin Smarandache “Does there exist neutrosophic numbers which are such that they take values differently and behave differently from I; the indeterminate?”. We have constructed a class of natural neutrosophic numbers m 0I , m xI , m yI , m zI where m 0I × m 0I = m 0I , m xI × m xI = m xI and m yI × m yI = m yI and m yI × m xI = m 0I and m zI × m zI = m 0I . Here take m …

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 …

A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass

Math Faculty Publications

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.

The Kronecker-Weber Theorem: An Exposition, Amber Verser

Lawrence University Honors Projects

This paper is an investigation of the mathematics necessary to understand the Kronecker-Weber Theorem. Following an article by Greenberg, published in The American Mathematical Monthly in 1974, the presented proof does not use class field theory, as the most traditional treatments of the theorem do, but rather returns to more basic mathematics, like the original proofs of the theorem. This paper seeks to present the necessary mathematical background to understand the proof for a reader with a solid undergraduate background in abstract algebra. Its goal is to make what is usually an advanced topic in the study of algebraic number …

On Cubic Multisections, Andrew Alaniz

Theses and Dissertations - UTB/UTPA

In this thesis, a systematic procedure is given for generating cubic multi-sections of Eisenstein series. The relevant series are determined from Fourier expansions for Eisenstein series by restricting the congruence class of the summation index modulo three. The resulting series are shown to be rational functions of the Dedekind eta function. A more general treatment of cubic dissection formulas is given by describing the dissection operators in terms of linear transformations.

The Fibonacci Sequence And Hosoya's Triangle, Jeffrey Lee Smith

Theses Digitization Project

The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci numbers.

Comparing The Algebraic And Analytical Properties Of P-Adic Numbers With Real Numbers, Joseph Colton Wilson

Theses Digitization Project

This study will provide a glimpse into the world of p-adic numbers, which encompasses a different way to measure the distance between rational numbers. Simple calculations and surprising results are examined to help familiarize the reader to the new space.

A Tale Of Two Workshops: Two Workshops, Three Papers, New Ideas, Gizem Karaali

Pomona Faculty Publications and Research

No abstract provided.

Prove It!, Kenny W. Moran

Journal of Humanistic Mathematics

A dialogue between a mathematics professor, Frank, and his daughter, Sarah, a mathematical savant with a powerful mathematical intuition. Sarah's intuition allows her to stumble into some famous theorems from number theory, but her lack of academic mathematical background makes it difficult for her to understand Frank's insistence on the value of proof and formality.

Orthogonal Polynomials, George Gevork Antashyan

Theses Digitization Project

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 that was invented in the nineteenth century. The theory of rational approximations is one of the most important applications of orthogonal polynomials.

Solutions To A Generalized Pell Equation, Kyle Christopher Castro

Theses Digitization Project

This study aims to extend the notion of continued fractions to a new field Q (x)*, in order to find solutions to generalized Pell's Equations in Q [x] . The investigation of these new solutions to Pell's Equation will begin with the necessary extensions of theorems as they apply to polynomials with rational coefficients and fractions of such polynomials in order to describe each "family" of solutions.

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.

Special Quasi Dual Numbers And Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce a new notion called special quasi dual number, x = a + bg.

Among the reals – 1 behaves in this way, for (– 1)2 = 1 = – (– 1). Likewise –I behaves in such a way (– I)2 = – (– I). These special quasi dual numbers can be generated from matrices with entries from 1 or I using only the natural product ×n. Another rich source of these special quasi dual numbers or quasi special dual numbers is Zn, n a composite number. For instance 8 in Z12 is such that …

Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger

CMC Senior Theses

Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.

Diagonal Forms And The Rationality Of The Poincaré Series, Dibyajyoti Deb

University of Kentucky Doctoral Dissertations

The Poincaré series, Py(f) of a polynomial f was first introduced by Borevich and Shafarevich in [BS66], where they conjectured, that the series is always rational. Denef and Igusa independently proved this conjecture. However it is still of interest to explicitly compute the Poincaré series in special cases. In this direction several people looked at diagonal polynomials with restrictions on the coefficients or the exponents and computed its Poincaré series. However in this dissertation we consider a general diagonal polynomial without any restrictions and explicitly compute its Poincaré series, thus extending results of Goldman, Wang and Han. In a separate …

The Fibonacci Sequence, Arik Avagyan

A with Honors Projects

A review was made of the Fibonacci sequence, its characteristics and applications.

Solvability Characterizations Of Pell Like Equations, Jason Smith

Boise State University Theses and Dissertations

Pell's equation has intrigued mathematicians for centuries. First stated as Archimedes' Cattle Problem, Pell's equation, in its most general form, X² – P • Y² = 1, where P is any square free positive integer and solutions are pairs of integers, has seen many approaches but few general solutions. The eleventh century Indian mathematician Bhaskara solved X² – 61 • Y² = 1 and, in response to Fermat's challenge, Wallis and Brouncker gave solutions to X² – 151 • Y² = 1 and X² –313 • Y² = 1. Fermat claimed to …

Effective Structure Theorems For Quadratic Spaces Via Height, Lenny Fukshansky

CMC Faculty Publications and Research

Lecture given at the Second International Conference on The Algebraic and Arithmetic Theory of Quadratic Forms, December 2007.

Proven Cases Of A Generalization Of Serre's Conjecture, Jonathan H. Blackhurst

Theses and Dissertations

In the 1970's Serre conjectured a correspondence between modular forms and two-dimensional Galois representations. Ash, Doud, and Pollack have extended this conjecture to a correspondence between Hecke eigenclasses in arithmetic cohomology and n-dimensional Galois representations. We present some of the first examples of proven cases of this generalized conjecture.

On Conway's Generalization Of The 3x + 1 Problem, Robin M. Givens

Honors Theses

This thesis considers a variation of the 3x+1, or Collatz, Problem involving a function we call the Conway function. The Conway function is defined by letting C3(n)=2k for n=3k and C3(n)=4k±1 for n=3k±1, where n is an integer. The iterates of this function generate a few 'short' cycles, but the s' tructural dynamics are otherwise unknown. We investigate properties of the Conway function and other related functions. We also discuss the possibility of using the Conway function to generate keys for cryptographic use based on a fast, efficient binary implemenation of the function. Questions related to the conjectured tree-like structure …

The Riemann Zeta Function, Ernesto Oscar Reyes

Theses Digitization Project

The Riemann Zeta Function has a deep connection with the distribution of primes. This expository thesis will explain the techniques used in proving the properties of the Rieman Zeta Function, its analytic continuation to the complex plane, and the functional equation that the the Riemann Zeta Function satisfies.

Sylvester: Ushering In The Modern Era Of Research On Odd Perfect Numbers, Steven Gimbel, John Jaroma

Philosophy Faculty Publications

In 1888, James Joseph Sylvester (1814-1897) published a series of papers that he hoped would pave the way for a general proof of the nonexistence of an odd perfect number (OPN). Seemingly unaware that more than fifty years earlier Benjamin Peirce had proved that an odd perfect number must have at least four distinct prime divisors, Sylvester began his fundamental assault on the problem by establishing the same result. Later that same year, he strengthened his conclusion to five. These findings would help to mark the beginning of the modern era of research on odd perfect numbers. Sylvester's bound stood …

Mathematical Card Tricks, Sarah Zimmermann

Honors Capstones

Capstone submitted as a graduation requirement for the BSU Honors Program.