Number Theory Commons^™

New Theorems For The Digraphs Of Commutative Rings, Morgan Bounds

Rose-Hulman Undergraduate Mathematics Journal

The digraphs of commutative rings under modular arithmetic reveal intriguing cycle patterns, many of which have yet to be explained. To help illuminate these patterns, we establish a set of new theorems. Rings with relatively prime moduli a and b are used to predict cycles in the digraph of the ring with modulus ab. Rings that use Pythagorean primes as their modulus are shown to always have a cycle in common. Rings with perfect square moduli have cycles that relate to their square root.

Decision Making On Teachers’ Adaptation To Cybergogy In Saturated Interval- Valued Refined Neutrosophic Overset /Underset /Offset Environment, Florentin Smarandache, Nivetha Martin, Priya R.

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic overset, neutrosophic underset and neutrosophic offset introduced by Smarandache are the special kinds of neutrosophic sets with values beyond the range [0,1] and these sets are pragmatic in nature as it represents the real life situations. This paper introduces the concept of saturated refined neutrosophic sets and extends the same to the special kinds of neutrosophic sets. The proposed concept is applied in decision making on Teacher’s adaptation to cybergogy. The decision making environment is characterized by different types of teachers, online teaching skills and various training methods. Fuzzy relation is used to match the most suitable method to …

Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya

Department of Mathematics Faculty Scholarship and Creative Works

We examine two dimensional properties of vortex shedding past elliptical cylinders through numerical simulations. Specifically, we investigate the vortex formation length in the Reynolds number regime 10 to 100 for elliptical bodies of aspect ratio in the range 0.4 to 1.4. Our computations reveal that in the steady flow regime, the change in the vortex length follows a linear profile with respect to the Reynolds number, while in the unsteady regime, the time averaged vortex length decreases in an exponential manner with increasing Reynolds number. The transition in profile is used to identify the critical Reynolds number which marks the …

Arithmetical Structures On Paths With A Doubled Edge, Darren B. Glass, Joshua R. Wagner

Math Faculty Publications

An arithmetical structure on a graph is given by a labeling of the vertices that satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical structures for graphs in these families.

Small Gaps Between Almost Primes, The Parity Problem, And Some Conjectures Of Erdős On Consecutive Integers Ii, Daniel A. Goldston, Sidney W. Graham, Apoorva Panidapu, Janos Pintz, Jordan Schettler, Cem Y. Yıldırım

Faculty Publications

We show that for any positive integer n, there is some fixed A such that d(x) = d(x +n) = A infinitely often where d(x) denotes the number of divisors of x. In fact, we establish the stronger result that both x and x +n have the same fixed exponent pattern for infinitely many x. Here the exponent pattern of an integer x > 1is the multiset of nonzero exponents which appear in the prime factorization of x.

Cross-Cultural Comparisons: The Art Of Computing The Greatest Common Divisor, Mary K. Flagg

Number Theory

No abstract provided.

Multiparty Non-Interactive Key Exchange And More From Isogenies On Elliptic Curves, Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry

Math Faculty Publications

We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n ≥ 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is believed to be difficult. We do not obtain a working protocol because of a missing step that is currently an open mathematical problem. What we need to complete our protocol is an efficient algorithm that takes as input an abelian variety presented as a product of isogenous elliptic curves, and outputs an isomorphism invariant of the abelian variety.

Our framework builds a cryptographic …

Averages And Nonvanishing Of Central Values Of Triple Product L-Functions Via The Relative Trace Formula, Bin Guan

Dissertations, Theses, and Capstone Projects

Harris and Kudla (2004) proved a conjecture of Jacquet, that the central value of a triple product L-function does not vanish if and only if there exists a quaternion algebra over which a period integral of three corresponding automorphic forms does not vanish. Moreover, Gross and Kudla (1992) established an explicit identity relating central L-values and period integrals (which are finite sums in their case), when the cusp forms are of prime levels and weight 2. Böcherer, Schulze-Pillot (1996) and Watson (2002) generalized this identity to more general levels and weights, and Ichino (2008) proved an adelic period formula which …

Quadratic Packing Polynomials On Sectors Of R2, Kaare S. Gjaldbaek

Dissertations, Theses, and Capstone Projects

A result by Fueter-Pólya states that the only quadratic polynomials that bijectively map the integral lattice points of the first quadrant onto the non-negative integers are the two Cantor polynomials. We study the more general case of bijective mappings of quadratic polynomials from the lattice points of sectors defined as the convex hull of two rays emanating from the origin, one of which falls along the x-axis, the other being defined by some vector. The sector is considered rational or irrational according to whether this vector can be written with rational coordinates or not. We show that the existence of …

The Distribution Of The Greatest Common Divisor Of Elements In Quadratic Integer Rings, Asimina S. Hamakiotes

Student Theses and Dissertations

For a pair of quadratic integers n and m chosen randomly, uniformly, and independently from the set of quadratic integers of norm x or less, we calculate the probability that the greatest common divisor of (n,m) is k. We also calculate the expected norm of the greatest common divisor (n,m) as x tends to infinity, with explicit error terms. We determine the probability and expected norm of the greatest common divisor for quadratic integer rings that are unique factorization domains. We also outline a method to determine the probability and expected norm of the greatest …

An In-Depth Look At P-Adic Numbers, Xiaona Zhou

Publications and Research

In this study, we consider $p$-adic numbers. We will also study the $p$-adic norm representation of real number, which is defined as $\mathbb{Q}_p = \{\sum_{j=m}^{\infty }a_j p^j: a_j \in \mathbb{D}_p, m\in\mathbb{Z}, a_m\neq 0\} \cup \{0\}$, where $p$ is a prime number. We explore properties of the $p$-adics by using examples. In particular, we will show that $\sqrt{6},i \in \mathbb{Q}_5$ and $\sqrt{2} \in \mathbb{Q}_7 $. $p$-adic numbers have a wide range of applicationsnin fields such as string theory, quantum mechanics, and transportation in porous disordered media in geology.

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

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

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

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

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

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

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

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

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.