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 301 - 330 of 567

Full-Text Articles in Mathematics

Applications Of The Heine And Bauer-Muir Transformations To Rogers-Ramanujan Type Continued Fractions, Jongsil Lee, James Mclaughlin, Jaebum Sohn Mar 2017

Applications Of The Heine And Bauer-Muir Transformations To Rogers-Ramanujan Type Continued Fractions, Jongsil Lee, James Mclaughlin, Jaebum Sohn

Mathematics Faculty Publications

In this paper we show that various continued fractions for the quotient of general Ramanujan functions G(aq, b, λq)/G(a, b, λ) may be derived from each other via Bauer-Muir transformations. The separate convergence of numerators and denominators play a key part in showing that the continued fractions and their Bauer-Muir transformations converge to the same limit. We also show that these continued fractions may be derived from either Heine’s continued fraction for a ratio of 2φ1 functions, or other similar continued fraction expansions of ratios of 2φ1 functions. Further, by employing essentially the same methods, a new continued fraction for …


Scaling Of Spectra Of Cantor-Type Measures And Some Number Theoretic Considerations, Isabelle Kraus Jan 2017

Scaling Of Spectra Of Cantor-Type Measures And Some Number Theoretic Considerations, Isabelle Kraus

Honors Undergraduate Theses

We investigate some relations between number theory and spectral measures related to the harmonic analysis of a Cantor set. Specifically, we explore ways to determine when an odd natural number m generates a complete or incomplete Fourier basis for a Cantor-type measure with scale g.


Mock Theta Function Identities Deriving From Bilateral Basic Hypergeometric Series, James Mclaughlin Jan 2017

Mock Theta Function Identities Deriving From Bilateral Basic Hypergeometric Series, James Mclaughlin

Mathematics Faculty Publications

The bilateral series corresponding to many of the third-, fifth-, sixth- and eighth order mock theta functions may be derived as special cases of 2ψ2 series ∞ ∑n=−∞ (a, c;q)n (b,d;q)n z n . Three transformation formulae for this series due to Bailey are used to derive various transformation and summation formulae for both these mock theta functions and the corresponding bilateral series. New and existing summation formulae for these bilateral series are also used to make explicit in a number of cases the fact that for a mock theta function, say χ(q), and a root of unity in a …


On P-Adic Fields And P-Groups, Luis A. Sordo Vieira Jan 2017

On P-Adic Fields And P-Groups, Luis A. Sordo Vieira

Theses and Dissertations--Mathematics

The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal …


Combinatorics Of Compositions, Meghann M. Gibson Jan 2017

Combinatorics Of Compositions, Meghann M. Gibson

College of Graduate Studies: Theses & Dissertations

Integer compositions and related enumeration problems have been extensively studied. The cyclic analogues of such questions, however, have significantly fewer results. In this thesis, we follow the cyclic construction of Flajolet and Soria to obtain generating functions for cyclic compositions and n-color cyclic compositions with various restrictions. With these generating functions we present some statistics and asymptotic formulas for the number of compositions and parts in such compositions. Combinatorial explanations are also provided for many of the enumerative observations presented.


A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mohsin Khan Jan 2017

A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mohsin Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.


Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira Jan 2017

Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

We put the problem to determine the sets of integers in base b ≥ 2 that generate primes with using a function.


P-Union And P-Intersection Of Neutrosophic Cubic Sets, Florentin Smarandache, Young Bae Jun, Chang Su Kim Jan 2017

P-Union And P-Intersection Of Neutrosophic Cubic Sets, Florentin Smarandache, Young Bae Jun, Chang Su Kim

Branch Mathematics and Statistics Faculty and Staff Publications

Conditions for the P-intersection and P-intersection of falsity-external (resp. indeterminacy-external and truth-external) neutrosophic cubic sets to be an falsity-external (resp. indeterminacy-external and truthexternal) neutrosophic cubic set are provided. Conditions for the Punion and the P-intersection of two truth-external (resp. indeterminacyexternal and falsity-external) neutrosophic cubic sets to be a truthinternal (resp. indeterminacy-internal and falsity-internal) neutrosophic cubic set are discussed.


Explicit Formulae And Trace Formulae, Tian An Wong Sep 2016

Explicit Formulae And Trace Formulae, Tian An Wong

Dissertations, Theses, and Capstone Projects

In this thesis, motivated by an observation of D. Hejhal, we show that the explicit formulae of A. Weil for sums over zeroes of Hecke L-functions, via the Maass-Selberg relation, occur in the continuous spectral terms in the Selberg trace formula over various number fields. In Part I, we discuss the relevant parts of the trace formulae classically and adelically, developing the necessary representation theoretic background. In Part II, we show how show the explicit formulae intervene, using the classical formulation of Weil; then we recast this in terms of Weil distributions and the adelic formulation of Weil. As an …


Explicit Reciprocity Laws For Higher Local Fields, Jorge Florez Sep 2016

Explicit Reciprocity Laws For Higher Local Fields, Jorge Florez

Dissertations, Theses, and Capstone Projects

In this thesis we generalize to higher dimensional local fields the explicit reciprocity laws of Kolyvagin for the Kummer pairing associated to a formal group. The formulas obtained describe the values of the pairing in terms of multidimensional p-adic differentiation, the logarithm of the formal group, the generalized trace and the norm on Milnor K-groups.


On Sums Of Binary Hermitian Forms, Cihan Karabulut Sep 2016

On Sums Of Binary Hermitian Forms, Cihan Karabulut

Dissertations, Theses, and Capstone Projects

In one of his papers, Zagier defined a family of functions as sums of powers of quadratic polynomials. He showed that these functions have many surprising properties and are related to modular forms of integral weight and half integral weight, certain values of Dedekind zeta functions, Diophantine approximation, continued fractions, and Dedekind sums. He used the theory of periods of modular forms to explain the behavior of these functions. We study a similar family of functions, defining them using binary Hermitian forms. We show that this family of functions also have similar properties.


On The Free And G-Saturated Weight Monoids Of Smooth Affine Spherical Varieties For G=Sl(N), Won Geun Kim Sep 2016

On The Free And G-Saturated Weight Monoids Of Smooth Affine Spherical Varieties For G=Sl(N), Won Geun Kim

Dissertations, Theses, and Capstone Projects

Let $X$ be an affine algebraic variety over $\mathbb{C}$ equipped with an action of a connected reductive group $G$. The weight monoid $\Gamma(X)$ of $X$ is the set of isomorphism classes of irreducible representations of $G$ that occur in the coordinate ring $\mathbb{C}[X]$ of $X$. Losev has shown that if $X$ is a smooth affine spherical variety, that is, if $X$ is smooth and $\mathbb{C}[X]$ is multiplicity-free as a representation of $G$, then $\Gamma(X)$ determines $X$ up to equivariant automorphism.

Pezzini and Van Steirteghem have recently obtained a combinatorial characterization of the weight monoids of smooth affine spherical varieties, using …


Nullification Of Torus Knots And Links, Zachary S. Bettersworth Jul 2016

Nullification Of Torus Knots And Links, Zachary S. Bettersworth

Masters Theses & Specialist Projects

Knot nullification is an unknotting operation performed on knots and links that can be used to model DNA recombination moves of circular DNA molecules in the laboratory. Thus nullification is a biologically relevant operation that should be studied.

Nullification moves can be naturally grouped into two classes: coherent nullification, which preserves the orientation of the knot, and incoherent nullification, which changes the orientation of the knot. We define the coherent (incoherent) nullification number of a knot or link as the minimal number of coherent (incoherent) nullification moves needed to unknot any knot or link. This thesis concentrates on the study …


Cayley Graphs Of Semigroups And Applications To Hashing, Bianca Sosnovski Jun 2016

Cayley Graphs Of Semigroups And Applications To Hashing, Bianca Sosnovski

Dissertations, Theses, and Capstone Projects

In 1994, Tillich and Zemor proposed a scheme for a family of hash functions that uses products of matrices in groups of the form $SL_2(F_{2^n})$. In 2009, Grassl et al. developed an attack to obtain collisions for palindromic bit strings by exploring a connection between the Tillich-Zemor functions and maximal length chains in the Euclidean algorithm for polynomials over $F_2$.

In this work, we present a new proposal for hash functions based on Cayley graphs of semigroups. In our proposed hash function, the noncommutative semigroup of linear functions under composition is considered as platform for the scheme. We will also …


P-Adic L-Functions And The Geometry Of Hida Families, Joseph Kramer-Miller Jun 2016

P-Adic L-Functions And The Geometry Of Hida Families, Joseph Kramer-Miller

Dissertations, Theses, and Capstone Projects


A major theme in the theory of $p$-adic deformations of automorphic forms is how $p$-adic $L$-functions over eigenvarieties relate to the geometry of these eigenvarieties. In this talk we explain results in this vein for the ordinary part of the eigencurve (i.e. Hida families). We address how Taylor expansions of one variable $p$-adic $L$-functions varying over families can detect geometric phenomena: crossing components of a certain intersection multiplicity and ramification over the weight space. Our methods involve proving a converse to a result of Vatsal relating congruences between eigenforms to their algebraic special $L$-values and then $p$-adically interpolating congruences using …


Comparing Local Constants Of Ordinary Elliptic Curves In Dihedral Extensions, Sunil Chetty Jun 2016

Comparing Local Constants Of Ordinary Elliptic Curves In Dihedral Extensions, Sunil Chetty

Mathematics Faculty Publications

We establish, for a substantial class of elliptic curves, that the arithmetic local constants introduced by Mazur and Rubin agree with quotients of analytic root numbers.


Mathematical Reasoning And The Inductive Process: An Examination Of The Law Of Quadratic Reciprocity, Nitish Mittal Jun 2016

Mathematical Reasoning And The Inductive Process: An Examination Of The Law Of Quadratic Reciprocity, Nitish Mittal

Electronic Theses, Projects, and Dissertations

This project investigates the development of four different proofs of the law of quadratic reciprocity, in order to study the critical reasoning process that drives discovery in mathematics. We begin with an examination of the first proof of this law given by Gauss. We then describe Gauss’ fourth proof of this law based on Gauss sums, followed by a look at Eisenstein’s geometric simplification of Gauss’ third proof. Finally, we finish with an examination of one of the modern proofs of this theorem published in 1991 by Rousseau. Through this investigation we aim to analyze the different strategies used in …


The Evolution Of Cryptology, Gwendolyn Rae Souza Jun 2016

The Evolution Of Cryptology, Gwendolyn Rae Souza

Electronic Theses, Projects, and Dissertations

We live in an age when our most private information is becoming exceedingly difficult to keep private. Cryptology allows for the creation of encryptive barriers that protect this information. Though the information is protected, it is not entirely inaccessible. A recipient may be able to access the information by decoding the message. This possible threat has encouraged cryptologists to evolve and complicate their encrypting methods so that future information can remain safe and become more difficult to decode. There are various methods of encryption that demonstrate how cryptology continues to evolve through time. These methods revolve around different areas of …


Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann May 2016

Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann

Mathematical Sciences Technical Reports (MSTR)

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the solutions to a generalization of the discrete logarithm problem modulo a prime power. This is achieved by interpolating to p-adic functions, and using Hensel's lemma, or other methods in the case of singular lifting, and the Chinese Remainder Theorem.


Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech May 2016

Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech

Mathematical Sciences Technical Reports (MSTR)

The increased use of cryptography to protect our personal information makes us want to understand the security of cryptosystems. The security of many cryptosystems relies on solving the discrete logarithm, which is thought to be relatively difficult. Therefore, we focus on the statistical analysis of certain properties of the graph of the discrete logarithm. We discovered the expected value and variance of a certain property of the graph and compare the expected value to experimental data. Our finding did not coincide with our intuition of the data following a Gaussian distribution given a large sample size. Thus, we found the …


On The Dimension Of Algebraic-Geometric Trace Codes, Phong Le, Sunil Chetty May 2016

On The Dimension Of Algebraic-Geometric Trace Codes, Phong Le, Sunil Chetty

Mathematics Faculty Publications

We study trace codes induced from codes defined by an algebraic curve X. We determine conditions on X which admit a formula for the dimension of such a trace code. Central to our work are several dimension reducing methods for the underlying functions spaces associated to X.


Drawing Numbers And Listening To Patterns, Loren Zo Haynes Apr 2016

Drawing Numbers And Listening To Patterns, Loren Zo Haynes

Honors College Theses

The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …


General Multi-Sum Transformations And Some Implications, James Mclaughlin Apr 2016

General Multi-Sum Transformations And Some Implications, James Mclaughlin

Mathematics Faculty Publications

We give two general transformations that allows certain quite general basic hypergeometric multi-sums of arbitrary depth (sums that involve an arbitrary sequence {g(k)}), to be reduced to an infinite q-product times a single basic hypergeometric sum. Various applications are given, including summation formulae for some q orthogonal polynomials, and various multisums that are expressible as infinite products.


The History And Applications Of Fibonacci Numbers, Cashous W. Bortner, Allan C. Peterson Apr 2016

The History And Applications Of Fibonacci Numbers, Cashous W. Bortner, Allan C. Peterson

UCARE: Research Products

The Fibonacci sequence is arguably the most observed sequence not only in mathematics, but also in nature. As we begin to learn more and more about the Fibonacci sequence and the numbers that make the sequence, many new and interesting applications of the have risen from different areas of algebra to market trading strategies. This poster analyzes not only the history of Leonardo Bonacci, but also the elegant sequence that is now his namesake and its appearance in nature as well as some of its current mathematical and non-mathematical applications.


Cyclic Critical Groups Of Graphs, Ryan P. Becker, Darren B. Glass Feb 2016

Cyclic Critical Groups Of Graphs, Ryan P. Becker, Darren B. Glass

Math Faculty Publications

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly.


Arithmetic Local Constants For Abelian Varieties With Extra Endomorphisms, Sunil Chetty Jan 2016

Arithmetic Local Constants For Abelian Varieties With Extra Endomorphisms, Sunil Chetty

Mathematics Faculty Publications

This work generalizes the theory of arithmetic local constants, introduced by Mazur and Rubin, to better address abelian varieties with a larger endomorphism ring than ℤ. We then study the growth of the p∞- Selmer rank of our abelian variety, and we address the problem of extending the results of Mazur and Rubin to dihedral towers k ⊂ K ⊂ F in which [F : K] is not a p-power extension.


Visual Properties Of Generalized Kloosterman Sums, Paula Burkhardt '16, Alice Zhuo-Yu Chan '14, Gabriel Currier '16, Stephan Ramon Garcia, Florian Luca, Hong Suh '16 Jan 2016

Visual Properties Of Generalized Kloosterman Sums, Paula Burkhardt '16, Alice Zhuo-Yu Chan '14, Gabriel Currier '16, Stephan Ramon Garcia, Florian Luca, Hong Suh '16

Pomona Faculty Publications and Research

For a positive integer m and a subgroup A of the unit group (Z/mZ)x, the corresponding generalized Kloosterman sum is the function K(a, b, m, A) = ΣuEA e(au+bu-1/m). Unlike classical Kloosterman sums, which are real valued, generalized Kloosterman sums display a surprising array of visual features when their values are plotted in the complex plane. In a variety of instances, we identify the precise number-theoretic conditions that give rise to particular phenomena.


Adinkras And Arithmetical Graphs, Madeleine Weinstein Jan 2016

Adinkras And Arithmetical Graphs, Madeleine Weinstein

HMC Senior Theses

Adinkras and arithmetical graphs have divergent origins. In the spirit of Feynman diagrams, adinkras encode representations of supersymmetry algebras as graphs with additional structures. Arithmetical graphs, on the other hand, arise in algebraic geometry, and give an arithmetical structure to a graph. In this thesis, we will interpret adinkras as arithmetical graphs and see what can be learned.

Our work consists of three main strands. First, we investigate arithmetical structures on the underlying graph of an adinkra in the specific case where the underlying graph is a hypercube. We classify all such arithmetical structures and compute some of the corresponding …


A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero Jan 2016

A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero

Undergraduate Honors Thesis Collection

This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.


A Measure Theoretic Approach To Problems Of Number Theory With Applications To The Proof Of The Prime Number Theorem, Russell Lee Jahn Jan 2016

A Measure Theoretic Approach To Problems Of Number Theory With Applications To The Proof Of The Prime Number Theorem, Russell Lee Jahn

All Graduate Theses, Dissertations, and Other Capstone Projects

In this paper we demonstrate how the principles of measure theory can be applied effectively to problems of number theory. Initially, necessary concepts from number theory will be presented. Next, we state standard concepts and results from measure theory to which we will need to refer. We then develop our repertoire of measure theoretic machinery by constructing the needed measures and defining a generalized version of the multiplicative convolution of measures. A suitable integration by parts formula, one that is general enough to handle various combinations of measures, will then be derived. At this juncture we will be ready to …