Number Theory Commons^™

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

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 Mobius Function And Mobius Inversion, Carl Lienert

Number Theory

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

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 …

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.

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 i^z 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

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

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.

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.

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 𝑃𝑛 × 𝑃𝑚.

Elliptic Curves And Power Residues, Vy Thi Khanh Nguyen

Doctoral Dissertations

Let E₁ x E₂ over Q be a fixed product of two elliptic curves over Q with complex multiplication. I compute the probability that the pth Fourier coefficient of E₁ x E₂, denoted as a_p(E₁) + a_p(E₂), is a square modulo p. The results are 1/4, 7/16, and 1/2 for different imaginary quadratic fields, given a technical independence of the twists. The similar prime densities for cubes and 4th power are 19/54, and 1/4, respectively. I also compute the probabilities without the technical …

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.

Comparison Of Three Dimensional Selfdual Representations By Faltings-Serre Method, Lian Duan

Doctoral Dissertations

In this thesis, we prove that, a selfdual 3-dimensional Galois representation constructed by van Geemen and Top is isomorphic to a quadratic twist of the symmetric square of the Tate module of an elliptic curve. This is an application of our refinement of the Faltings-Serre method to 3-dimensional Galois representations with ground field not equal to Q. The proof makes use of the Faltings-Serre method, $\ell$-adic Lie algebra, and Burnside groups.

Bruhat-Tits Buildings And A Characteristic P Unimodular Symbol Algorithm, Matthew Bates

Doctoral Dissertations

Let k be the finite field with q elements, let F be the field of Laurent series in the variable 1/t with coefficients in k, and let A be the polynomial ring in the variable t with coefficients in k. Let SLn(F) be the ring of nxn-matrices with entries in F, and determinant 1. Given a polynomial g in A, let Gamma(g) subset SLn(F) be the full congruence subgroup of level g. In this thesis we examine the action of Gamma(g) on the Bruhat-Tits building Xn associated to SLn(F) for n equals 2 and n equals 3. Our first main …

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!" …

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 …

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 …

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

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.

Inquiry In Inquiry: A Classification Of The Learning Theories Underlying Inquiry-Based Undergraduate Number Theory Texts, Rebecca L. Butler

Honors Projects

While undergraduate inquiry-based texts in number theory share similar approaches with respect to learning as the embodiment of professional practice, this does not entail that these texts all operate from the same fundamental understanding of what it means to learn mathematics. In this paper, the instructional design of several texts of the aforementioned types are analyzed to assess the theory of learning under which they operate. From this understanding of the different theories of learning employed in an inquiry-based mathematical setting, one can come to understand the popular model of what it is to learn number theory in a meaningful …