Number Theory Commons^™

Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett

Number Theory

No abstract provided.

The Pell Equation In India, Toke Knudsen, Keith Jones

Number Theory

No abstract provided.

Neutrosophic Commutative N-Ideals In Bck-Algebras, Florentin Smarandache, Seok-Zun Song, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of a neutrosophic commutative N -ideal in BCK-algebras is introduced, and several properties are investigated. Relations between a neutrosophic N -ideal and a neutrosophic commutative N -ideal are discussed. Characterizations of a neutrosophic commutative N -ideal are considered.

Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, Ryan Ronan

Dissertations, Theses, and Capstone Projects

The Markoff equation is a Diophantine equation in 3 variables first studied in Markoff's celebrated work on indefinite binary quadratic forms. We study the growth of solutions to an n variable generalization of the Markoff equation, which we refer to as the Markoff-Hurwitz equation. We prove explicit asymptotic formulas counting solutions to this generalized equation with and without a congruence restriction. After normalizing and linearizing the equation, we show that all but finitely many solutions appear in the orbit of a certain semigroup of maps acting on finitely many root solutions. We then pass to an accelerated subsemigroup of maps …

Some Results In Combinatorial Number Theory, Karl Levy

Dissertations, Theses, and Capstone Projects

The first chapter establishes results concerning equidistributed sequences of numbers. For a given $d\in\mathbb{N}$, $s(d)$ is the largest $N\in\mathbb{N}$ for which there is an $N$-regular sequence with $d$ irregularities. We compute lower bounds for $s(d)$ for $d\leq 10000$ and then demonstrate lower and upper bounds $\left\lfloor\sqrt{4d+895}+1\right\rfloor\leq s(d)< 24801d^{3} + 942d^{2} + 3$ for all $d\geq 1$. In the second chapter we ask if $Q(x)\in\mathbb{R}[x]$ is a degree $d$ polynomial such that for $x\in[x_k]=\{x_1,\cdots,x_k\}$ we have $|Q(x)|\leq 1$, then how big can its lead coefficient be? We prove that there is a unique polynomial, which we call $L_{d,[x_k]}(x)$, with maximum lead coefficient under these constraints and construct an algorithm that generates $L_{d,[x_k]}(x)$.

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

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.25log₂(α)³ + 16.5log₂(α)² + …

Transfinite Ordinal Arithmetic, James Roger Clark

All Student Theses and Dissertations

Following the literature from the origin of Set Theory in the late 19th century to more current times, an arithmetic of finite and transfinite ordinal numbers is outlined. The concept of a set is outlined and directed to the understanding that an ordinal, a special kind of number, is a particular kind of well-ordered set. From this, the idea of counting ordinals is introduced. With the fundamental notion of counting addressed: then addition, multiplication, and exponentiation are defined and developed by established fundamentals of Set Theory. Many known theorems are based upon this foundation. Ultimately, as part of the conclusion, …

A Math Poem, Sara R. Katz

Journal of Humanistic Mathematics

No abstract provided.

Primes, Divisibility, And Factoring, Dominic Klyve

Number Theory

No abstract provided.

Babylonian Numeration, Dominic Klyve

Number Theory

No abstract provided.

Gaussian Integers And Dedekind's Creation Of An Ideal: A Number Theory Project, Janet Heine Barnett

Number Theory

No abstract provided.

Construction Of The Figurate Numbers, Jerry Lodder

Number Theory

No abstract provided.

Pascal's Triangle And Mathematical Induction, Jerry Lodder

Number Theory

No abstract provided.

Generating Pythagorean Triples: The Methods Of Pythagoras And Of Plato Via Gnomons, Janet Heine Barnett

Number Theory

No abstract provided.

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Counting Rational Points, Integral Points, Fields, And Hypersurfaces, Joseph Gunther

Dissertations, Theses, and Capstone Projects

This thesis comes in four parts, which can be read independently of each other.

In the first chapter, we prove a generalization of Poonen's finite field Bertini theorem, and use this to show that the obvious obstruction to embedding a curve in some smooth surface is the only obstruction over perfect fields, extending a result of Altman and Kleiman. We also prove a conjecture of Vakil and Wood on the asymptotic probability of hypersurface sections having a prescribed number of singularities.

In the second chapter, for a fixed base curve over a finite field of characteristic at least 5, we …

Neutrosophy, A Sentiment Analysis Model, Florentin Smarandache, Mirela Teodorescu, Daniela Gifu

Branch Mathematics and Statistics Faculty and Staff Publications

This paper describes the importance of Neutrosophy Theory in order to find a method that could solve the uncertainties arising on discursive analysis. The aim of this pilot study is to find a procedure to diminish the uncertainties from public discourse induced, especially, by humans (politicians, journalists, etc.). We consider that Neutrosophy Theory is a sentiment analysis specific case regarding processing of the three states: positive, negative, and neutral. The study is intended to identify a method to answer to uncertainties solving in order to support politician's staff, NLP specialists, artificial intelligence researchers and generally the electors.

On Circulant-Like Rhotrices Over Finite Fields, P. L. Sharma, Shalini Gupta, Mansi Rehan

Applications and Applied Mathematics: An International Journal (AAM)

Circulant matrices over finite fields are widely used in cryptographic hash functions, Lattice based cryptographic functions and Advanced Encryption Standard (AES). Maximum distance separable codes over finite field GF2 have vital a role for error control in both digital communication and storage systems whereas maximum distance separable matrices over finite field GF2 are used in block ciphers due to their properties of diffusion. Rhotrices are represented in the form of coupled matrices. In the present paper, we discuss the circulant- like rhotrices and then construct the maximum distance separable rhotrices over finite fields.

Diophantine Approximation And The Atypical Numbers Of Nathanson And O'Bryant, David Seff

Dissertations, Theses, and Capstone Projects

For any positive real number $\theta > 1$, and any natural number $n$, it is obvious that sequence $\theta^{1/n}$ goes to 1. Nathanson and O'Bryant studied the details of this convergence and discovered some truly amazing properties. One critical discovery is that for almost all $n$, $\displaystyle\floor{\frac{1}{\fp{\theta^{1/n}}}}$ is equal to $\displaystyle\floor{\frac{n}{\log\theta}-\frac{1}{2}}$, the exceptions, when $n > \log_2 \theta$, being termed atypical $n$ (the set of which for fixed $\theta$ being named $\mcA_\theta$), and that for $\log\theta$ rational, the number of atypical $n$ is finite. Nathanson left a number of questions open, and, subsequently, O'Bryant developed a theory to answer most of these …

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 …

From Simplest Recursion To The Recursion Of Generalizations Of Cross Polytope Numbers, Yutong Yang

KSU Journey Honors College Capstones and Theses

My research project involves investigations in the mathematical field of combinatorics. The research study will be based on the results of Professors Steven Edwards and William Griffiths, who recently found a new formula for the cross-polytope numbers. My topic will be focused on "Generalizations of cross-polytope numbers". It will include the proofs of the combinatorics results in Dr. Edwards and Dr. Griffiths' recently published paper. $E(n,m)$ and $O(n,m)$, the even terms and odd terms for Dr. Edward's original combinatorial expression, are two distinct combinatorial expressions that are in fact equal. But there is no obvious algebraic evidence to show that …

Roman Domination In Complementary Prisms, Alawi I. Alhashim

Electronic Theses and Dissertations

The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect match- ing between the corresponding vertices of G and G. A Roman dominating function on a graph G = (V,E) is a labeling f : V(G) → {0,1,2} such that every vertex with label 0 is adjacent to a vertex with label 2. The Roman domination number γR(G) of G is the minimum f(V ) = Σv∈V f(v) over all such functions of G. We study the Roman domination number of complementary prisms. …

On The Reality Of Mathematics, Brendan Ortmann

Selected Student Publications

Mathematics is an integral cornerstone of science and society at large, and its implications and derivations should be considered. That mathematics is frequently abstracted from reality is a notion not countered, but one must also think upon its physical basis as well. By segmenting mathematics into its different, abstract philosophies and real-world applications, this paper seeks to peer into the space that mathematics seems to fill; that is, to understand how and why it works. Under mathematical theory, Platonism, Nominalism, and Fictionalism are analyzed for their validity and their shortcomings, in addition to the evaluation of infinities and infinitesimals, to …

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

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.

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.

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 …

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.

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 …