Quaestiones Neutrosophicae,
2015
University of New Mexico
Quaestiones Neutrosophicae, Florentin Smarandache, Yale Landsberg
Branch Mathematics and Statistics Faculty and Staff Publications
The following dialogue contains cuts from different non-protocolar conversations, initially not intended for publication, held by the authors by email during the beginning of 2015 – on Neutrosophy and related topics.
Many thanks to all friends and dialogue partners who payed attention to Neutrosophy and connected areas, in emails, yahoo groups, social media, letters, private discussions.
Techno-Art Of Selariu Supermathematics Functions, 2nd Volume,
2015
University of New Mexico
Techno-Art Of Selariu Supermathematics Functions, 2nd Volume, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
An ALBUM, according to the dictionary, is defined as "notebook for storing photos, postcards, stamps, lyrics, quotes etc.", which, in other words, means gatherings of "pieces" of the same "species". Or, in the new Techno-Art of Selariu SuperMathematics Functions ALBUM (the second book of Selariu SuperMathematics Functions), one contemplates a unique COMPOSITION, INTER-, INTRA- and TRANS-DISCIPLINARY. (Capitalizing here is not a futility, but a harmony with the TRUTH.) One caveat I am indebted to do, as a consequent "reader" – over time, I received the ALBUM, chapter by chapter, pace by pace, which gave me the time to analyze / …
Neutrosophic Axiomatic System,
2015
University of New Mexico
Neutrosophic Axiomatic System, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, we introduce for the first time the notions of Neutrosophic Axiom, Neutrosophic Axiomatic System, Neutrosophic Deducibility and Neutrosophic Inference, Neutrosophic Proof, Neutrosophic Tautologies, Neutrosophic Quantifiers, Neutrosophic Propositional Logic, Neutrosophic Axiomatic Space, Degree of Contradiction (Dissimilarity) of Two Neutrosophic Axioms, and Neutrosophic Model. A class of neutrosophic implications is also introduced. A comparison between these innovatory neutrosophic notions and their corresponding classical notions is made. Then, three concrete examples of neutrosophic axiomatic systems, describing the same neutrosophic geometrical model, are presented at the end of the paper.
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One,
2015
Scripps College
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley
Scripps Senior Theses
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure.
This paper describes the mathematics (and some of the computer science) necessary to understand and compute an attack on the elliptic curve discrete logarithm problem that works in a special case. The algorithm, proposed by Nigel Smart, renders the elliptic curve discrete logarithm problem easy in both directions for elliptic curves of …
Polynomials With Prescribed Bad Primes,
2014
University of Minnesota - Morris
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.
Deconstructing The Welch Equation Using P-Adic Methods,
2014
Rose-Hulman Institute of Technology
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Mathematical Sciences Technical Reports (MSTR)
The Welch map x -> gx-1+c is similar to the discrete exponential map x -> gx, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: gx-1+c = x (mod pe) 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 pe, 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,
2014
Rose-Hulman Institute of Technology
Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh
Rose-Hulman Undergraduate Research Publications
The Welch map x -> gx-1+c is similar to the discrete exponential map x -> gx, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: gx-1+c = x (mod pe) 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 pe, 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,
2014
Arizona State University
The Tame-Wild Principle For Discriminant Relations For Number Fields, John W. Jones, David P. Roberts
Mathematics Publications
Consider tuples ( K1 , … , Kr ) of separable algebras over a common local or global number field F1, with the Ki 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 Ki ∕ 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,
2014
University of Connecticut - Storrs
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 …
Computing Local Constants For Cm Elliptic Curves,
2014
College of Saint Benedict/Saint John's University
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.
A Frobenius Question Related To Actions On Curves In Characteristic P,
2014
Gettysburg College
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.
Constructing Carmichael Numbers Through Improved Subset-Product Algorithms,
2014
Illinois Wesleyan University
Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue
Scholarship
style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> prime factors for every style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> 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 style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">with the property that …
Interval Neutrosophic Rough Set,
2014
University of New Mexico
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.
Importance Of Sources Using The Repeated Fusion Method And The Proportional Conflict Redistribution Rules #5 And #6,
2014
University of New Mexico
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.
There And Back Again: Elliptic Curves, Modular Forms, And L-Functions,
2014
Harvey Mudd College
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,
2014
Claremont McKenna College
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.
New Research On Neutrosophic Algebraic Structures,
2014
University of New Mexico
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 …
On Crittenden And Vanden Eynden's Conjecture,
2014
University of New Mexico
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.
Lower And Upper Soft Interval Valued Neutrosophic Rough Approximations Of An Ivnss-Relation,
2014
University of New Mexico
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,
2014
University of New Mexico
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.
