Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Number Theory

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 181 - 210 of 567

Full-Text Articles in Mathematics

Combinatorial And Asymptotic Statistical Properties Of Partitions And Unimodal Sequences, Walter Mcfarland Bridges May 2020

Combinatorial And Asymptotic Statistical Properties Of Partitions And Unimodal Sequences, Walter Mcfarland Bridges

LSU Doctoral Dissertations

Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane; the upper boundary is called the shape. For various types of unimodal sequences, we show that, as the number of squares tends to infinity, 100% of shapes are near a certain curve---that is, there is a single limit shape. Similar phenomena have been well-studied for integer partitions, but several technical difficulties arise in the extension of such asymptotic statistical laws to unimodal sequences. We develop a widely applicable method for obtaining these limit …


On The Mersenne Prime Numbers, Julia Vanlandingham Apr 2020

On The Mersenne Prime Numbers, Julia Vanlandingham

Undergraduate Honors Thesis Projects

The prime numbers have been an important field of research for thousands of years and are intertwined with most other fields of mathematics. One topic that has piqued the interest of mathematicians young and old is the Mersenne prime numbers, which have applications in many mathematics and computer science fields. The Mersenne primes get a lot of attention because there is not much known about them. However, we do have a very simple primality test for Mersenne numbers, which is why the largest currently known primes are Mersenne primes. These primes are also very closely related to another class of …


Local-Global Principles For Diophantine Equations, Benjamin Barham Apr 2020

Local-Global Principles For Diophantine Equations, Benjamin Barham

Senior Honors Theses

The real number field, denoted ℝ, is the most well-known extension field of ℚ, the field of rational numbers, but it is not the only one. For each prime p, there exists an extension field ℚp of ℚ, and these fields, known as the p-adic fields, have some properties substantially different from ℝ. In this paper, we construct the p-adic numbers from the ground up and discuss the local-global principle, which concerns connections between solutions of equations found in ℚ and in ℚp. We state the Hasse-Minkowski theorem, which addresses a type …


Symmetric Presentations And Related Topics, Mayra Mcgrath Mar 2020

Symmetric Presentations And Related Topics, Mayra Mcgrath

Electronic Theses, Projects, and Dissertations

In this thesis, we have investigated several permutation and monomialprogenitors for finite images. We have found original symmetric presen-tations for several important non-abelian simple groups, including lineargroups, unitary groups, alternating groups, and sporadic simple groups.We have found a number of finite images, including : L(2,41), PSL(2,11)×2, L(2,8), and L(2,19), as homomorphic images of the permutation progenitors. We have also found PGL(2,16) : 2 =Aut(PSL(2,16)) and PSL(2,16) as homomorphic images of monomial progenitors. We have performed manual double coset enumeration of finte images. In addition, we have given the isomorphism class of each image that we have discovered. Presentation for all …


Collaboration (Reacting To The Past/Math/History/Writing), James Hayashi Feb 2020

Collaboration (Reacting To The Past/Math/History/Writing), James Hayashi

Q2S Enhancing Pedagogy

This is an assignment for a Freshman level course in the College of Natural Science. By the end students will have an understanding of valid research, collaboration and communication skills. Faculty that chooses to use this assignment will be preparing students for an active learning environment, and understanding a “Big Idea”, valid research, technology and communication skills.

Faculty should give an example of what is valid research. As students are completing this assignment mini deadlines (check-ins) shall be set. With the check-ins for this assignment focus on how the group will communicate the check point and the collaboration.

The focus …


Arithmetic Of Binary Cubic Forms, Gennady Yassiyevich Feb 2020

Arithmetic Of Binary Cubic Forms, Gennady Yassiyevich

Dissertations, Theses, and Capstone Projects

The goal of the thesis is to establish composition laws for binary cubic forms. We will describe both the rational law and the integral law. The rational law of composition is easier to describe. Under certain conditions, which will be stated in the thesis, the integral law of composition will follow from the rational law. The end result is a new way of looking at the law of composition for integral binary cubic forms.


On Consecutive Triples Of Powerful Numbers, Edward Beckon Jan 2020

On Consecutive Triples Of Powerful Numbers, Edward Beckon

Rose-Hulman Undergraduate Mathematics Journal

A powerful number is a positive integer such that every prime that appears in its prime factorization appears there at least twice. Erdős, Mollin and Walsh conjectured that three consecutive powerful numbers do not exist. This paper shows that if they do exist, the smallest of the three numbers must have remainder 7, 27, or 35 when divided by 36.


Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle Jan 2020

Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle

Rose-Hulman Undergraduate Mathematics Journal

This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982. Consecutive prime labeling is defined here for the first time. Consecutive prime labeling requires that the labels of vertices in a graph be relatively prime to the labels of all adjacent vertices as well as all incident edges. We show that all paths, cycles, stars, and complete graphs have a consecutive prime labeling and conjecture that all simple connected graphs have a consecutive prime labeling.

This paper also expands on work …


Combinatorial Identities On Multinomial Coefficients And Graph Theory, Seungho Lee Jan 2020

Combinatorial Identities On Multinomial Coefficients And Graph Theory, Seungho Lee

Rose-Hulman Undergraduate Mathematics Journal

We study combinatorial identities on multinomial coefficients. In particular, we present several new ways to count the connected labeled graphs using multinomial coefficients.


The Mobius Function And Mobius Inversion, Carl Lienert Jan 2020

The Mobius Function And Mobius Inversion, Carl Lienert

Number Theory

No abstract provided.


Simultaneous Zeros Of A System Of Two Quadratic Forms, Nandita Sahajpal Jan 2020

Simultaneous Zeros Of A System Of Two Quadratic Forms, Nandita Sahajpal

Theses and Dissertations--Mathematics

In this dissertation we investigate the existence of a nontrivial solution to a system of two quadratic forms over local fields and global fields. We specifically study a system of two quadratic forms over an arbitrary number field. The questions that are of particular interest are:

  1. How many variables are necessary to guarantee a nontrivial zero to a system of two quadratic forms over a global field or a local field? In other words, what is the u-invariant of a pair of quadratic forms over any global or local field?
  2. What is the relation between u-invariants of a …


Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick Jan 2020

Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick

Senior Honors Theses

Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow …


Solutions To Systems Of Equations Over Finite Fields, Rachel Petrik Jan 2020

Solutions To Systems Of Equations Over Finite Fields, Rachel Petrik

Theses and Dissertations--Mathematics

This dissertation investigates the existence of solutions to equations over finite fields with an emphasis on diagonal equations. In particular:

  1. Given a system of equations, how many solutions are there?
  2. In the case of a system of diagonal forms, when does a nontrivial solution exist?

Many results are known that address (1) and (2), such as the classical Chevalley--Warning theorems. With respect to (1), we have improved a recent result of D.R. Heath--Brown, which provides a lower bound on the total number of solutions to a system of polynomials equations. Furthermore, we have demonstrated that several of our lower bounds …


Introduction To Neutroalgebraic Structures And Antialgebraic Structures (Revisited), Florentin Smarandache Jan 2020

Introduction To Neutroalgebraic Structures And Antialgebraic Structures (Revisited), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In all classical algebraic structures, the Laws of Compositions on a given set are well-defined. But this is a restrictive case, because there are many more situations in science and in any domain of knowledge when a law of composition defined on a set may be only partially-defined (or partially true) and partially-undefined (or partially false), that we call NeutroDefined, or totally undefined (totally false) that we call AntiDefined. Again, in all classical algebraic structures, the Axioms (Associativity, Commutativity, etc.) defined on a set are totally true, but it is again a restrictive case, because similarly there are numerous situations …


An Exploration Of The Use Of The Fibonacci Sequence In Unrelated Mathematics Disciplines, Molly E. Boodey Jan 2020

An Exploration Of The Use Of The Fibonacci Sequence In Unrelated Mathematics Disciplines, Molly E. Boodey

Honors Theses and Capstones

No abstract provided.


The Infinite Is The Chasm In Which Our Thoughts Are Lost: Reflections On Sophie Germain's Essays, Adam Glesser, Bogdan D. Suceavă, Mihaela Vajiac Jan 2020

The Infinite Is The Chasm In Which Our Thoughts Are Lost: Reflections On Sophie Germain's Essays, Adam Glesser, Bogdan D. Suceavă, Mihaela Vajiac

Mathematics, Physics, and Computer Science Faculty Articles and Research

"Sophie Germain (1776–1831) is quite well-known to the mathematical community for her contributions to number theory [17] and elasticity theory (e.g., see [2, 5]). On the other hand, there have been few attempts to understand Sophie Germain as an intellectual of her time, as an independent thinker outside of academia, and as a female mathematician in France, facing the prejudice of the time of the First Empire and of the Bourbon Restoration, while pursuing her thoughts and interests and writing on them. Sophie Germain had to face a double challenge: the mathematical difficulty of the problems she approached and the …


Quadruple Neutrosophic Theory And Applications Volume I, Florentin Smarandache, Memet Şahin, Vakkas Uluçay, Abdullah Kargin Jan 2020

Quadruple Neutrosophic Theory And Applications Volume I, Florentin Smarandache, Memet Şahin, Vakkas Uluçay, Abdullah Kargin

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, …


Improved, Extended, And Total Impact Factor Of A Journal, Florentin Smarandache Jan 2020

Improved, Extended, And Total Impact Factor Of A Journal, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this short paper we recall the (Garfield) Impact Factor of a journal, we improve and extend it, and eventually present the Total Impact Factor that reflects the most accurate impact factor.


The Tsukano Conjectures On Exponential Sums, Brad Isaacson Jan 2020

The Tsukano Conjectures On Exponential Sums, Brad Isaacson

Publications and Research

We prove three conjectures of Tsukano about exponential sums stated in his Master’s thesis written at Osaka University. These conjectures are variations of earlier conjectures made by Lee and Weintraub which were first proved by Ibukiyama and Saito.


Adjoint Appell-Euler And First Kind Appell-Bernoulli Polynomials, Pierpaolo Natalini, Paolo E. Ricci Dec 2019

Adjoint Appell-Euler And First Kind Appell-Bernoulli Polynomials, Pierpaolo Natalini, Paolo E. Ricci

Applications and Applied Mathematics: An International Journal (AAM)

The adjunction property, recently introduced for Sheffer polynomial sets, is considered in the case of Appell polynomials. The particular case of adjoint Appell-Euler and Appell-Bernoulli polynomials of the first kind is analyzed.


Complex Powers Of I Satisfying The Continued Fraction Functional Equation Over The Gaussian Integers, Matthew Niemiro '20 Dec 2019

Complex Powers Of I Satisfying The Continued Fraction Functional Equation Over The Gaussian Integers, Matthew Niemiro '20

Exemplary Student Work

We investigate and then state the conditions under which iz satisfies the simple continued fraction functional equation for real and then complex z over the Gaussian integers.


Fibonacci And Lucas Identities From Toeplitz–Hessenberg Matrices, Taras Goy, Mark Shattuck Dec 2019

Fibonacci And Lucas Identities From Toeplitz–Hessenberg Matrices, Taras Goy, Mark Shattuck

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we consider determinants for some families of Toeplitz–Hessenberg matrices having various translates of the Fibonacci and Lucas numbers for the nonzero entries. These determinant formulas may also be rewritten as identities involving sums of products of Fibonacci and Lucas numbers and multinomial coefficients. Combinatorial proofs are provided of several of the determinants which make use of sign-changing involutions and the definition of the determinant as a signed sum over the symmetric group. This leads to a common generalization of the Fibonacci and Lucas determinant formulas in terms of the so-called Gibonacci numbers.


Hankel Rhotrices And Constructions Of Maximum Distance Separable Rhotrices Over Finite Fields, P. L. Sharma, Arun Kumar, Shalini Gupta Dec 2019

Hankel Rhotrices And Constructions Of Maximum Distance Separable Rhotrices Over Finite Fields, P. L. Sharma, Arun Kumar, Shalini Gupta

Applications and Applied Mathematics: An International Journal (AAM)

Many block ciphers in cryptography use Maximum Distance Separable (MDS) matrices to strengthen the diffusion layer. Rhotrices are represented by coupled matrices. Therefore, use of rhotrices in the cryptographic ciphers doubled the security of the cryptosystem. We define Hankel rhotrix and further construct the maximum distance separable rhotrices over finite fields.


Some Results And Examples On Vertex Equitable Labeling, Mohamed Saied Aboshady, Reda Amin Elbarkoki, Eliwa Mohamed Roshdy, Mohamed Abdel Azim Seoud Dec 2019

Some Results And Examples On Vertex Equitable Labeling, Mohamed Saied Aboshady, Reda Amin Elbarkoki, Eliwa Mohamed Roshdy, Mohamed Abdel Azim Seoud

Basic Science Engineering

In this paper we present a survey for all graphs with order at most 6 whether they are vertex equitable or not and we get an upper bound for the number of edges of any graph with 𝑝 vertices to be a vertex equitable graph. Also, we establish vertex equitable labeling for the 𝑚-chain of the complete bipartite graph 𝐾2,𝑛 and for the graph 𝑃𝑛 × 𝑃𝑚.


On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac Nov 2019

On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac

Mathematics and Statistics Faculty Publications and Presentations

The generalized Ramanujan Conjecture for cuspidal unitary automorphic representations π on GL(2) asserts that |av(π)| ≤ 2. We prove that this inequality is strict if π is generated by a CM Hilbert modular form of parallel weight two and v is a finite place of degree one. Equivalently, the Satake parameters of πv are necessarily distinct. We also give examples where the equality case does occur for primes of degree two.


Winnability Of The Group Labeling Lights Out Game On Complete Bipartite Graphs, Christian J. Miller Sep 2019

Winnability Of The Group Labeling Lights Out Game On Complete Bipartite Graphs, Christian J. Miller

McNair Scholars Manuscripts

For an arbitrary graph, we can play Lights Out on it if we assign a number label to each of the vertices of a graph G, representing states of on/off in the original Lights Out game, with the edges connecting those vertices representing the buttons that are adjacent to each other. This project is focused on a slightly modifed version of the game's original rules, with the labels for the vertices coming from the group Zn. It is not always possible to win the game. We will be investigating the values of n for which this group labeling "Lights Out!" …


Hermitian Maass Lift For General Level, An Hoa Vu Sep 2019

Hermitian Maass Lift For General Level, An Hoa Vu

Dissertations, Theses, and Capstone Projects

For an imaginary quadratic field $K$ of discriminant $-D$, let $\chi = \chi_K$ be the associated quadratic character. We will show that the space of special hermitian Jacobi forms of level $N$ is isomorphic to the space of plus forms of level $DN$ and nebentypus $\chi$ (the hermitian analogue of Kohnen's plus space) for any integer $N$ prime to $D$. This generalizes the results of Krieg from $N = 1$ to arbitrary level. Combining this isomorphism with the recent work of Berger and Klosin and a modification of Ikeda's construction we prove the existence of a lift from the space …


Zeta Functions Of Classical Groups And Class Two Nilpotent Groups, Fikreab Solomon Admasu Sep 2019

Zeta Functions Of Classical Groups And Class Two Nilpotent Groups, Fikreab Solomon Admasu

Dissertations, Theses, and Capstone Projects

This thesis is concerned with zeta functions and generating series associated with two families of groups that are intimately connected with each other: classical groups and class two nilpotent groups. Indeed, the zeta functions of classical groups count some special subgroups in class two nilpotent groups.

In the first chapter, we provide new expressions for the zeta functions of symplectic groups and even orthogonal groups in terms of the cotype zeta function of the integer lattice. In his paper on universal $p$-adic zeta functions, J. Igusa computed explicit formulae for the zeta functions of classical algebraic groups. These zeta functions …


A Few Firsts In The Epsilon Years Of My Career, Heidi Goodson Jul 2019

A Few Firsts In The Epsilon Years Of My Career, Heidi Goodson

Journal of Humanistic Mathematics

In this essay, I describe the unexpected ways I achieved some milestones in the early years of my career.


The Last Digits Of Infinity (On Tetrations Under Modular Rings), William Stowe Jun 2019

The Last Digits Of Infinity (On Tetrations Under Modular Rings), William Stowe

Celebration of Learning

A tetration is defined as repeated exponentiation. As an example, 2 tetrated 4 times is 2^(2^(2^2)) = 2^16. Tetrated numbers grow rapidly; however, we will see that when tetrating where computations are performed mod n for some positive integer n, there is convergent behavior. We will show that, in general, this convergent behavior will always show up.