Number Theory Commons^™

Cohomology Of Absolute Galois Groups, Claudio Quadrelli

Electronic Thesis and Dissertation Repository

The main problem this thesis deals with is the characterization of profinite groups which are realizable as absolute Galois groups of fields: this is currently one of the major problems in Galois theory. Usually one reduces the problem to the pro-p case, i.e., one would like to know which pro-p groups occur as maximal pro-p Galois groups, i.e., maximal pro-p quotients of absolute Galois groups. Indeed, pro-p groups are easier to deal with than general profinite groups, yet they carry a lot of information on the whole absolute Galois group.

We define a new class of pro-p groups, called Bloch-Kato …

Polynomials With Prescribed Bad Primes, David P. Roberts

Mathematics Publications

We tabulate polynomials in ℚ[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and ∞. We explain how these polynomials are of particular interest because of their role in the construction of nonsolvable number fields of arbitrarily large degree and bounded ramification.

Prime Decomposition In Iterated Towers And Discriminant Formulae, Thomas Alden Gassert

Doctoral Dissertations

We explore certain arithmetic properties of iterated extensions. Namely, we compute the index associated to certain families of iterated polynomials and determine the decomposition of prime ideals in others.

Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh

Mathematical Sciences Technical Reports (MSTR)

The Welch map x -> g^x-1+c is similar to the discrete exponential map x -> g^x, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: g^x-1+c = x (mod p^e) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo p^e, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …

Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh

Rose-Hulman Undergraduate Research Publications

The Welch map x -> g^x-1+c is similar to the discrete exponential map x -> g^x, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: g^x-1+c = x (mod p^e) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo p^e, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …

The Tame-Wild Principle For Discriminant Relations For Number Fields, John W. Jones, David P. Roberts

Mathematics Publications

Consider tuples ( K₁ , … , K_r ) of separable algebras over a common local or global number field F₁, with the K_i related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best possible divisibility relations among the discriminants of K_i ∕ F . We show that for many resolvent constructions, these divisibility relations continue to hold even in the presence of wild ramification.

Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna

Honors Scholar Theses

Finite fields, and the polynomial rings over them, have many neat algebraic properties and identities that are very convenient to work with. In this paper we will start by exploring said properties with the goal in mind of being able to use said properties to efficiently irreducibly factorize polynomials over these fields, an important action in the fields of discrete mathematics and computer science. Necessarily, we must also introduce the concept of an algorithm’s speed as well as particularly speeds of basic modular and integral arithmetic opera- tions. Outlining these concepts will have laid the groundwork for us to introduce …

The Combinatorialization Of Linear Recurrences, Arthur T. Benjamin, Halcyon Derks, Jennifer J. Quinn

Jennifer J. Quinn

We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.

Mod 2 Homology For Gl(4) And Galois Representations, Avner Ash, Paul E. Gunnells, Mark Mcconnell

Paul Gunnells

We extend the computations in [AGM11] to find the mod 2 homology in degree 1 of a congruence subgroup Γ of SL(4,Z) with coefficients in the sharbly complex, along with the action of the Hecke algebra. This homology group is related to the cohomology of Γ with F2 coefficients in the top cuspidal degree. These computations require a modification of the algorithm to compute the action of the Hecke operators, whose previous versions required division by 2. We verify experimentally that every mod 2 Hecke eigenclass found appears to have an attached Galois representation, giving evidence for a conjecture in …

Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue

Scholarship

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with prime factors for every between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes with the property that divides a highly composite .

Computing Local Constants For Cm Elliptic Curves, Sunil Chetty, Lung Li

Mathematics Faculty Publications

Let E/k be an elliptic curve with CM by O. We determine a formula for (a generalization of) the arithmetic local constant of Mazur-Rubin at almost all primes of good reduction. We apply this formula to the CM curves defined over Q and are able to describe extensions F/Q over which the O-rank of E grows.

There And Back Again: Elliptic Curves, Modular Forms, And L-Functions, Allison F. Arnold-Roksandich

HMC Senior Theses

L-functions form a connection between elliptic curves and modular forms. The goals of this thesis will be to discuss this connection, and to see similar connections for arithmetic functions.

Finding Zeros Of Rational Quadratic Forms, John F. Shaughnessy

CMC Senior Theses

In this thesis, we introduce the notion of quadratic forms and provide motivation for their study. We begin by discussing Diophantine equations, the field of p-adic numbers, and the Hasse-Minkowski Theorem that allows us to use p-adic analysis determine whether a quadratic form has a rational root. We then discuss search bounds and state Cassels' Theorem for small-height zeros of rational quadratic forms. We end with a proof of Cassels' Theorem and suggestions for further reading.

A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass

Math Faculty Publications

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.

Special Pseudo Linear Algebras Using [0,N), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce some special type of linear algebras called pseudo special linear algebras using the interval [0, n). These new types of special pseudo interval linear algebras has several interesting properties. Special pseudo interval linear algebras are built over the subfields in Zn where Zn is a S-ring. We study the substructures of them. The notion of Smarandache special interval pseudo linear algebras and Smarandache strong special pseudo interval linear algebras are introduced. The former Sspecial interval pseudo linear algebras are built over the Sring itself. Study in this direction has yielded several interesting results. S-strong special …

Soft Neutrosophic Algebraic Structures And Their Generalization - Vol. 1, Florentin Smarandache, Mumtaz Ali, Muhammad Shabir

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduced the notions of soft neutrosophic algebraic structures. These soft neutrosophic algebraic structures are basically defined over the neutrosophic algebraic structures which means a parameterized collection of subsets of the neutrosophic algebraic structure. For instance, the existence of a soft neutrosophic group over a neutrosophic group or a soft neutrosophic semigroup over a neutrosophic semigroup, or a soft neutrosophic field over a neutrosophic field, or a soft neutrosophic LA-semigroup over a neutrosophic LAsemigroup, or a soft neutosophic loop over a neutrosophic loop. It is interesting to note that these notions are defined over finite and …

New Research On Neutrosophic Algebraic Structures, Florentin Smarandache, Mumtaz Ali, Muhammad Shabir

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, we define several new neutrosophic algebraic structures and their related properties. The main focus of this book is to study the important class of neutrosophic rings such as neutrosophic LA-semigroup ring, neutrosophic loop ring, neutrosophic groupoid ring and so on. We also construct their generalization in each case to study these neutrosophic algebraic structures in a broader sense. The indeterminacy element “ I “ gives rise to a more bigger algebraic structure than the classical algebraic structures. It mainly classifies the algebraic structures in three categories: such as neutrosophic algebraic structures, strong neutrosophic algebraic structures, and classical …

Solving Diophantine Equations, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

In recent times, we witnessed an explosion of Number Theory problems that are solved using mathematical software and powerful computers. The observation that the number of transistors packed on integrated circuits doubles every two years made by Gordon E. Moore in 1965 is still accurate to this day. With ever increasing computing power more and more mathematical problems can be tacked using brute force. At the same time the advances in mathematical software made tools like Maple, Mathematica, Matlab or Mathcad widely available and easy to use for the vast majority of the mathematical research community. This tools don’t only …

Eccentricity, Space Bending, Dimension, Florentin Smarandache, Marian Nitu, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

The main goal of this paper is to present new transformations, previously non-existent in traditional mathematics, that we call centric mathematics (CM) but that became possible due to the new born eccentric mathematics, and, implicitly, to the supermathematics (SM).

As shown in this work, the new geometric transformations, namely conversion or transfiguration, wipe the boundaries between discrete and continuous geometric forms, showing that the first ones are also continuous, being just apparently discontinuous.

On Crittenden And Vanden Eynden's Conjecture, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

It is possible to cover all (positive) integers with n geometrical progressions of integers? Find a necessary and sufficient condition for a general class of positive integer sequences such that, for a fixed n , there are n (distinct) sequences of this class which cover all integers.

Neutrosophic Crisp Sets & Neutrosophic Crisp Topological Spaces, A. A. Salama, Florentin Smarandache, Valeri Kroumov

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we generalize the crisp topological space to the notion of neutrosophic crisp topological space, and we construct the basic concepts of the neutrosophic crisp topology. In addition to these, we introduce the definitions of neutrosophic crisp continuous function and neutrosophic crisp compact spaces. Finally, some characterizations concerning neutrosophic crisp compact spaces are presented and one obtains several properties. Possible application to GIS topology rules are touched upon.

Multi-Criteria Decision Making Based On Dsmt-Ahp, Jean Dezert, Jean Marc Tacnet, Mireille Batton-Hubert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present an extension of the multicriteria decision making based on the Analytic Hierarchy Process (AHP) which incorporates uncertain knowledge matrices for generating basic belief assignments (bba’s). The combination of priority vectors corresponding to bba’s related to each (sub)- criterion is performed using the Proportional Conflict Redistribution rule no. 5 proposed in Dezert-Smarandache Theory (DSmT) of plausible and paradoxical reasoning. The method presented here, called DSmT-AHP, is illustrated on very simple examples.

Lower And Upper Soft Interval Valued Neutrosophic Rough Approximations Of An Ivnss-Relation, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we extend the lower and upper soft interval valued intuitionistic fuzzy rough approximations of IVIFS –relations proposed by Anjan et al. to the case of interval valued neutrosophic soft set relation(IVNSS-relation for short)

Intuitionistic Neutrosophic Soft Set Over Rings, Florentin Smarandache, Said Broumi, Pabitra Kumar Maji

Branch Mathematics and Statistics Faculty and Staff Publications

S.Broumi and F.Smarandache introduced the concept of intuitionistic neutrosophic soft set as an extension of the soft set theory. In this paper we have applied the concept of intuitionistic neutrosophic soft set to rings theory .The notion of intuitionistic neutrosophic soft set over ring (INSSOR for short ) is introduced and their basic properties have been investigated.The definitions of intersection, union, AND, and OR operations over ring (INSSOR) have also been defined. Finally, we have defined the product of two intuitionistic neutrosophic soft set over ring.

Interval Neutrosophic Rough Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This paper combines interval-valued neutrosophic sets and rough sets. It studies rougheness in interval-valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower an upper approximations of interval neutrosophic sets.

Interval Neutrosophic Logic, Haibin Wang, Florentin Smarandache, Yan-Qing Zhang, Rajshekhar Sunderraman

Branch Mathematics and Statistics Faculty and Staff Publications

Interval Neutrosophic Logic

Importance Of Sources Using The Repeated Fusion Method And The Proportional Conflict Redistribution Rules #5 And #6, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

We present in this paper some examples of how to compute by hand the PCR5 fusion rule for three sources, so the reader will better understand its mechanism. We also take into consideration the importance of sources, which is different from the classical discounting of sources.

Algebraic Structures On The Fuzzy Interval [0, 1), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce several algebraic structures on the special fuzzy interval [0, 1). This study is different from that of the algebraic structures using the interval [0, n) n ≠ 1, as these structures on [0, 1) has no idempotents or zero divisors under ×. Further [0, 1) under product × is only a semigroup. However by defining min(or max) operation in [0, 1); [0, 1) is made into a semigroup. The semigroup under × has no finite subsemigroups but under min or max we have subsemigroups of order one, two and so on. [0, 1) under + …

Algebraic Structures On Finite Complex Modulo Integer Interval C([0, N)), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the notion of finite complex modulo integer intervals. Finite complex modulo integers was introduced by the authors in 2011. Now using this finite complex modulo integer intervals several algebraic structures are built. Further the concept of finite complex modulo integers itself happens to be new and innovative for in case of finite complex modulo integers the square value of the finite complex number varies with varying n of Zn. In case of finite complex modulo integer intervals also we can have only pseudo ring as the distributive law is not true, in general in C([0, …

Single Valued Neutrosophic Information Systems Based On Rough Set Theory, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

The theory of rough sets was firstly proposed by Pawlak. Later on, Smarandache introduced the concept of neutrosophic (NS) sets in 1998. In this paper based on the concept of rough neutrosohic set, we define the concept of single valued neutrosophic information systems. In addition, we will discuss the knowledge reduction and extension of the single valued neutrosophic information systems.