Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
Articles 1 - 7 of 7
Full-Text Articles in Algebra
Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair
Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair
Graduate Student Publications and Research
Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:
f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n
where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.
This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).
Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors answer the question proposed by Florentin Smarandache “Does there exist neutrosophic numbers which are such that they take values differently and behave differently from I; the indeterminate?”. We have constructed a class of natural neutrosophic numbers m 0I , m xI , m yI , m zI where m 0I × m 0I = m 0I , m xI × m xI = m xI and m yI × m yI = m yI and m yI × m xI = m 0I and m zI × m zI = m 0I . Here take m …
Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna
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 Kronecker-Weber Theorem: An Exposition, Amber Verser
The Kronecker-Weber Theorem: An Exposition, Amber Verser
Lawrence University Honors Projects
This paper is an investigation of the mathematics necessary to understand the Kronecker-Weber Theorem. Following an article by Greenberg, published in The American Mathematical Monthly in 1974, the presented proof does not use class field theory, as the most traditional treatments of the theorem do, but rather returns to more basic mathematics, like the original proofs of the theorem. This paper seeks to present the necessary mathematical background to understand the proof for a reader with a solid undergraduate background in abstract algebra. Its goal is to make what is usually an advanced topic in the study of algebraic number …
Special Quasi Dual Numbers And Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Special Quasi Dual Numbers And Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors introduce a new notion called special quasi dual number, x = a + bg.
Among the reals – 1 behaves in this way, for (– 1)2 = 1 = – (– 1). Likewise –I behaves in such a way (– I)2 = – (– I). These special quasi dual numbers can be generated from matrices with entries from 1 or I using only the natural product ×n. Another rich source of these special quasi dual numbers or quasi special dual numbers is Zn, n a composite number. For instance 8 in Z12 is such that …
Definitions, Solved And Unsolved Problems, Conjectures, And Theorems In Number Theory And Geometry, Florentin Smarandache
Definitions, Solved And Unsolved Problems, Conjectures, And Theorems In Number Theory And Geometry, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Florentin Smarandache, an American mathematician of Romanian descent has generated a vast variety of mathematical problems. Some problems are easy, others medium, but many are interesting or unsolved and this is the reason why the present book appears. Here, of course, there are problems from various types. Solving these problems is addictive like eating pumpkin seed: having once started, one cannot help doing it over and over again.
Asupra Unor Noi Functii În Teoria Numerelor, Florentin Smarandache
Asupra Unor Noi Functii În Teoria Numerelor, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Performantele matematicii actuale,ca si descoperirile din viitor isi au,desigur, inceputul in cea mai veche si mai aproape de filozofie ramura a matematicii, in teoria numerelor. Matematicienii din toate timpurile au fost, sunt si vor fi atrasi de frumusetea si varietatea problemelor specifice acestei ramuri a matematicii. Regina a matematicii, care la randul ei este regina a stiintelor, dupa cum spunea Gauss, teoria numerelor straluceste cu lumina si atractiile ei, fascinandu-ne si usurandu-ne drumul cunoasterii legitatilor ce guverneaza macrocosmosul si microcosmosul. De la etapa antichitatii, cand teoria numerelor era cuprinsa in aritmetica, la etapa aritmeticii superioare din perioada Renasterii, cand teoria …