^H ^Fibonacci Quarterly

Total Page:16

File Type:pdf, Size:1020Kb

^H ^Fibonacci Quarterly ^h ^Fibonacci Quarterly THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION VOLUME 15 [l^WST NUMBER 1 CONTENTS Residues of Generalized Fibonacci Sequences C. C. Yalavigi 1 Composites and Primes Among Powers of Fibonacci V. E. Hoggatt, Jr., and Numbers, Increased or Decreased by One Marjorie Bicknell-Johnson 2 Divisibility by Fibonacci and Lucas Squares V. E. Hoggatt, Jr., and Marjorie Bicknell-Johnson 3 Letter to the Editor . John W. Jameson 8 An Elementary Proof of Kronecker's Theorem J. Spencer 9 Fibonacci Numbers in the Count of Spanning Trees Peter J. Slater 11 The Diophantine Equation 3 3 3 (x1 + x2 + - +xnf = x + x 2 + - + x . W. R. Utz 14 An Application of W. Schmidt's Theorem Transcendental Numbers and Golden Number Maurice Mignotte 15 The Reciprocal Law W. E. Greig 17 Binet's Formula Generalized A. K. Whitford 21 On the Multinomial Theorem David Lee Hilliker 22 A Fibonacci Formula of Lucas and its Subsequent Manifestations and Rediscoveries . H. W. Gould 25 Numerator Polynomial Coefficient Arrays for Catalan V. E. Hoggatt, Jr., and and Related Sequence Convolution Triangles. Marjorie Bicknell-Johnson 30 Fibonacci-Like Groups and Periods of Fibonacci-Like Sequences .Lawrence Somer 35 Solution of a Certain Recurrence Relation .Douglas A. Fults 41 On Tribonacci Numbers and Related Functions Krishnaswami Alladi and V. E. Hoggatt, Jr. 42 Sums of Fibonacci Reciprocals W. E. Greig 46 Fibonacci Notes — 5. Zero-One Sequences Again L. Carlitz 49 On the A/"-Canonical Fibonacci Representations of Order N . Robert Silber 57 A Rearrangement of Series Based on a Partition of the Natural Numbers H. W. Gould 67 n n k A Formula for £ ' Fk (x)y " and its Generalization. M. N. S. Swamy 73 7 Some Sums Containing the Greatest Integer Function L Carlitz 18 Wythoff's Nim and Fibonacci Representations Robert Silber 85 Advanced Problems and Solutions Edited by Raymond E. Whitney 89 Elementary Problems and Solutions Edited by A. P. Hillman 93 FEBRUARY 1977 tfie Fibonacci Quarterly THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION DEVOTED TO THE STUDY OF INTEGERS WITH SPECIAL PROPERTIES EDITOR V. E. Hoggatt, Jr. EDITORIAL BOARD H. L. Alder Gerald E. Bergum David A. Klarner Marjorie Bicknell-Johnson Leonard Klosinski Paul F. Byrd Donald E. Knuth L. Carlitz C. T. Long H. W. Gould M. N. S. Swamy A. P. Hillman D. E. Thoro WITH THE COOPERATION OF Maxey Brooke L. H. Lange Rro. A. Brousseau James Maxwell Calvin D. Crabill Sister M. DeSales T. A. Davis McNabb Franklyn Fuller D. W. Robinson A. F. Horadam Lloyd Walker Dov Jarden Charles H. Wall The California Mathematics Council All subscription correspondence should be addressed to Professor Leonard Klosinski, Mathematics Department, University of Santa Clara, Santa Clara, California 95053. All checks ($15.00 per year) should be made out to the Fibonacci Association or The Fibonacci Quarterly. Two copies of manuscripts intended for publication in the Quarterly should be sent to Verner E. Hoggatt, Jr., Mathematics Department, San Jose State University, San Jose, California 95192. All manuscripts should be typed, double-spaced. Drawings should be made the same size as they will appear in the Quarterly, and should be done in India ink on either vellum or bond paper. Authors should keep a copy of the manuscript sent to the editors. The Quarterly is entered as third-class mail at the University of Santa Clara Post Office, California, as an official publication of the Fibonacci Association. The Quarterly is published in February, April, October, and December, each year. Typeset by HIGHLANDS COMPOSITION SERVICE P. 0 . Box 760 Clearlake Highlands, Calif. 95422 RESIDUES OF GENERALIZED FIBONACCI SEQUENCES C. C. YALAVIGI Government College, Mercara, India Consider a sequence of GF numbers, [wn(b,c; P.Q)}^. For b =c= 1, L Taylor [1] has proved the follow- ing theorem. Theorem. The only sequences which possess the property that upon division by a (non-zero) member of that sequence, the members of the sequence leave least +ve, or -ve residues which are either zero or equal in absolute value to a member of the original sequence are the Fibonacci and Lucas sequences. Our objective is to consider the extension of this theorem to GF sequences by a different approach, and show that a class of sequences can be constructed to satisfy the property of this theorem in a restricted sense, i.e., for a particular member only. For convenience, wn(b,l; 0,1), wn(b,1; 2,b), wn(b,1; P,Q) shall be designated by u v n> n, Hnr respectively. r Let Hk+r = (-l) ~ Hk.r (mod H k). Assume without loss of generality, k to be +ve. We distinguish 2 cases: (A)0<r<k, and (B) r>k. (A) Evidently, the members leave least residues which are either zero or equal in absolute value to a member of the original sequence. (B) Allow |//_ 5 + ; | < \Hk\ < \H.S\. Let k+S 1 k+s (D H2k+S - (-V ' H.S (mod Hk), H2k+S+1 = (-V H.s.j (mod Hk). Clearly, the property of above-cited theorem holds for {Hp}^, iff k+s (_1)k+s-lH_s _ HQ ( m o d Hj<)i a n d (-D H-s-i = HQ + 1 (mod Hk), for some c such that -s + 1 < e < 2k. Denote the period of { Hn (mod Hk)} Q by k(Hk). Rewrite the given sequence as { Hp'}™^, where H'n' = Hn. Set k' = k + t, s' = s - t, and 2'=£ + t. Then, it is easy to show that k(Hk) = 2k + s-z, k(H'k>) = 2k'+ s'- c', and k(Hk) = k(H'k-). We assert that ^ / / ^ ' ^ is even, for f = ^ - z)/2 obtains s'= si', k(H'k') = 2k', and the substitution ois-s. = 2t + 1 leads to s' - si' = 1, k(H'k') = 2k'+ 1, which is a contradiction. Hence, it is sufficient to examine the following system of congruences, viz., (2) H'2k- = H'0 (mod H'k-\ H'2k+1 = H', (mod H'k>). These congruences imply k+t 1 k 1 (3) H2k+t = Ht = (-V ~ H^(mo6Hk) = (-l) ~ {Ht- (2Q - bP)ut } (mod Hk ) k 1 = (-1) ~ {Pvt-Ht}(m^Hk). Therefore, (i) P = 0, Q = 1, and (\\) P = 2, Q = b, furnish readily the desired sequences, and they are the only sequences for which the property of L. Taylor's theorem holds. For the restripted case, by using the well known formula Hn = Pun-i + Qun, it is possible to express H.s = HQ (mod Hk), and //_s_; =H%+1 (mod Hk) as two simultaneous equations in P, Q, and obtain their solution for given s, si, and k. In particular, the latter case may be handled by using k(H'k') = k(uk'), where H'k' is selected arbitrarily to satisfy k'= k(uk')/2 and Hk- = Puk-„i + Quk, determines/3 and Q. Example: H'g = 19, k(H'9) =18, P = 9, Q = -5. 1 2 RESIDUES OF GENERALIZED FIBONACCI SEQUENCES FEB. 1977 REFERENCES 1. L Taylor, ''Residues of Fibonacci-Like Sequences," The Fibonacci Quarterly, Vol. 5, No. 3 (Oct. 1967), pp. 298-304. 2. C. C. Yalavigi, "On a Theorem of L Taylor,"Math. Edn., 4 (1970), p. 105. ******* COMPOSITES AND PRIMES AMONG POWERS OF FIBONACCI NUMBERS, INCREASED OR DECREASED BY ONE V. E. HOGGATT, JR., and MARJORIE BICKNELL\IOHNSON San Jose State University, San Jose, California 95192 It is well known that, among the Fibonacci numbers Fn, given by F-i = 1 = F2, Fn+1 * Fn + Fn-i, 2 Fn + 1 is composite for each n > 4, while Fn - /is composite for/7 > 7. It is easily shown that Fn ± 1 is also composite for any n, since Fn± 1 = Fn-2Fn+2, Fn + / = Fn+1Fn^1 . Here, we raise the question of when F™ ± 1 is composite. First, if k£0 (mod 3), then Fk is odd, F™ is odd, and F™± 7 is even and hence composite. Now, suppose we n n m deal with F™k ± I Since A - B always has (A - B) as a factor, we see that F™k - 1 is composite except when (A- B)= 1; that is, for k= 1. Thus, Theorem 1. F™ - 1 is composite, k ± 3. m m m We return to F™k + I For/77 odd, then A + B is known to have the factor (A + B), so that F™k + 1 has the factor (F^k + 11 and hence is composite. If m is even, every even m except powers of 2 can be written in the form (2j + 1)2' = m, so that + m 2 2i+1 2 2i+1 F3k 1 = (F 3k) + (1 ) . m m which, from the known factors of A + B , m odd, must have (Fjk + 1) as a factor, and hence, F™k + /is composite. 2 This leaves only the case F™k + /, where m = 2'. When k= 1, we have the Fermat primes,? + /, prime for / = 0, 1, 2, 3, 4 but composite for / = 5, 6. It is an unsolved problem whether or not 22' + 1 has other prime 3 m 3 m 3 values. We note in passing that, when k = 2,F6=8 = 2 , and 8 ± 1 = (2 ) ^ ± 1 = (2 ) ± 7 is always com- 3 posite, since A ± B is always factorable. It is th ought that Fg + 1 is a prime. Since F3k=Q (mod 10),Ar=0(mod 5 ) , / ^ , + / = 102'-t+1. Since F?/, = 6 (mod 10), i> 2, k^ 0 (mod 5), F2' + 1 has the form 10t + 7, k4ft (mod 5). We can sum- marize these remarks as Theorem 2.
Recommended publications
  • Unsolved Problems in Group Theory. the Kourovka Notebook
    Unsolved problems in group theory. The Kourovka notebook. No. 18 Edited by: Mazurov, V. D. and Khukhro, E. I. 2014 MIMS EPrint: 2014.1 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports available from: http://eprints.maths.manchester.ac.uk/ And by contacting: The MIMS Secretary School of Mathematics The University of Manchester Manchester, M13 9PL, UK ISSN 1749-9097 Russian Academy of Sciences Siberian Division q INSTITUTEOFMATHEMATICS UNSOLVED PROBLEMS IN GROUP THEORY THE KOUROVKA NOTEBOOK No. 18 Novosibirsk 2014 q Editors: V. D. Mazurov and E. I. Khukhro New problems and comments can be sent to the Editors: V. D. Mazurov or E. I. Khukhro Institute of Mathematics Novosibirsk-90, 630090, Russia e-mails: [email protected] [email protected] c V. D. Mazurov, E. I. Khukhro, 2014 Contents Preface ......................................................................... 4 Problems from the 1st Issue (1965) . 5 Problems from the 2nd Issue (1966) . 7 Problems from the 3rd Issue (1969) . 10 Problems from the 4th Issue (1973) . 12 Problems from the 5th Issue (1976) . 16 Problems from the 6th Issue (1978) . 19 Problems from the 7th Issue (1980) . 23 Problems from the 8th Issue (1982) . 27 Problems from the 9th Issue (1984) . 33 Problems from the 10th Issue (1986) . 39 Problems from the 11th Issue (1990) . 47 Problems from the 12th Issue (1992) . 59 Problems from the 13th Issue (1995) . 67 Problems from the 14th Issue (1999) . 73 Problems from the 15th Issue (2002) . 85 Problems from the 16th Issue (2006) . 98 Problems from the 17th Issue (2010) . 111 New Problems .
    [Show full text]
  • 1, 2, ' 0}N N ' As the 0-Th Row of the Array F
    PART I GENERATING FUNCTIONS FOR PRODUCTS OF POWERS OF FIBONACCI NUMBERS* H. W. GOULD, WEST VIRGINIA UNIVERSITY, MORGANTOWN, W. VA. 1. INTRODUCTION We may define the Fibonacci numbers, F . by Fn = 0, F< = 1, F n = F ' n' J ° ' 1 n+2 n+1 + F . A well-known generating function for these numbers is d.i) — ^ — = y F n xn m Z-J i1 _ x _ x2 n = Q Intimately associated with the numbers of Fibonacci are the numbers of Lucas, L , which we may define by L01 =, 25, 1Lt = 1, L 9 = L + L . The numbers n ' n+2 n+1 n F and L may be considered as special cases of general functions first studied in great detail by Lucas [8 J, though as Bell [1 ] has observed many expansions for the Lucas functions appeared in papers of Cauchy and others prior to Lucas. Dickson [4 | devotes all of one chapter (17) to recurring series and more particu- larly Lucas functions. Here one may find further references to the many papers on the subject which have appeared since Leonardo Pisano, or Fibonacci, first introduced the famous numbers in 1202. It would be difficult to estimate how many papers related to Fibonacci numbers have appeared since Dickson's monumental History was written, however it may be of interest to point out that a project has been initiated under the direction of Professor Vern Hoggatt, San Jose State College, San Jose, California, to collect formulas, maintain a bibliography and co- ordinate work on Fibonacci numbers. As part of the w r i t e r ' s activity with this Fibonacci Bibliographical Project the subject of generating functions for powers of the Fibonacci'numbers has come in for some study, and the object of this p r e s - ent paper is to develop some very general generating functions for the Lucas functions.
    [Show full text]
  • Table of Contents
    THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION TABLE OF CONTENTS Second-Order Recurrence and Iterates of [an + Vi\ ClarkKimherling 194 Entry Point Reciprocity of Characteristic Conjugate Generalized Fibonacci Sequences David Englund 197 Announcement on Fifth International Conference 199 Summation of Certain Reciprocal Series Related to Fibonacci and Lucas Numbers Richard Andre- Jeannin 200 Sequences of Integers Satisfying Recurrence Relations Richard Andre-Jeannin 205 Conjectures about s-Additive Sequences Steven R. Finch 209 A Note on Euler's Numbers.. .Nenad Cakic 215 The Zeckendorf Representation and the Golden Sequence .Martin Bunder and Keith Tognetti 217 Third International Conference Proceedings 219 The Period of Convergents Modulo M of Reduced Quadratic Irrationals R.A. Bateman, E.A. Clark, M.L. Hancock and C.A. Reiter 220 On the Notion of Uniform Distribution Mod 1 . Rita Giuliano Antonini 230 Some Recursive Asymptotes ' R.N. Whitaker and A.G. Shannon 235 Second-Order Recurrences and the Schroder-Bernstein Theorem Calvin Long and John Bradshaw 239 Sets of Terms that Determine all the Terms of a Linear Recurrence Sequence Clark Kimherling 244 Some Convolution-Type and Combinatorial Identities Pertaining to Binary Linear Recurrences Neville Robhins 249 A Note on a Class of Lucas Sequences Piero Filipponi 256 Multiplicative Partitions of Bipartite Numbers Bruce M. Landman and Raymond N. Greenwell 264 A Combinatorial Interpretation of the Square of a Lucas Number John Konvalina and Yi-Hsin Liu 268 Reciprocal GCD Matrices and LCM Matrices Scott J. Beslin 271 Summing Infinite Series with Sex Herb Silverman 275 Elementary Problems and Solutions .Edited by Stanley Rabinowitz andA.P. Hillman 277 Advanced Problems and Solutions Edited by Raymond E.
    [Show full text]
  • Arxiv:2103.12494V4 [Math.AT] 27 Jun 2021 Orsodn Author: Corresponding Dimension Mological E Od N Phrases
    PROPERTIES OF THE COMBINATORIAL HANTZSCHE-WENDT GROUPS J. POPKO AND A. SZCZEPANSKI´ Abstract. The combinatorial Hantzsche-Wendt group Gn = −1 2 2 {x1, ..., xn | xi xj xixj , ∀i 6= j} was defined by W. Craig and P. A. Linnell in [3]. For n = 2 it is a fundamental group of 3-dimensional oriented flat manifold with no cyclic holonomy group. We calculate the Hilbert-Poincar´eseries of Gn,n ≥ 1 with Q and F2 coefficients. Moreover, we prove that a cohomological dimension of Gn is equal to n +1. Some other properties of this group are also considered. 1. Introduction Let Γ3 be the fundamental group of an oriented flat 3-manifold with non-cyclic holonomy, which was the first time defined by W. Hantzsche & H. Wendt and W. Nowacki in 1934, see [7], [11]. From [18, ch. 9], Γ3 is a torsion free crystallographic group of a rank 3. Where, by crystallo- graphic group of dimension n we understand a discrete and cocompact subgroup of a group E(n)= O(n) ⋉Rn of isometries of the Euclidean space Rn. From Bieberbach theorems [18] any crystallographic group Γ of rank n defines a short exact sequence (1) 1 → Zn → Γ → H → 1, where Zn is a free abelian subgroup of all translations of Γ and H is a finite group, called a holonomy group of Γ. In the case of Γ3 a group H = Z2 ⊕ Z2. As a subgroup of E(3) 1 0 0 −1 0 0 Γ3 = gen{A =( 0 −1 0 , (1/2, 1/2, 0)), B =( 0 1 0 , (0, 1/2, 1/2))}.
    [Show full text]
  • On Automorphisms of Structures in Logic and Orderability of Groups In
    On Automorphisms of Structures in Logic and Orderability of Groups in Topology By Ataollah Togha A Dissertation Submitted to The Faculty of The Columbian College of Arts and Sciences ofTheGeorgeWashingtonUniversity in Partial Satisfaction of the Requirements for the Degree of Doctor of Philosophy August 30, 2004 Dissertation Co-directed by Valentina Harizanov The George Washington University and Ali Enayat American University Contents Dedication iv Acknowledgements v Abstract vii 1 Model-theoretic Preliminaries 1 1.1TheAutomorphismGroup...................... 1 1.2Saturation,Categoricity,andHomogeneity............. 6 1.3RecursivelySaturatedModels.................... 8 2 Automorphisms of Models of Set Theory 16 2.1Friedman’sTheorem......................... 16 2.2AutomorphismsthatFixOrdinalsFixaLotMore........ 22 2.3CutsinModelsofSetTheory.................... 24 2.4OpenProblems............................ 32 3 (Left-)orderability of Groups 34 i 3.1 (Left-)ordered Groups and (Left-)orderability . .......... 34 3.2CharacterizationsandConnectionswithLogic........... 39 3.3TheAbelianCase........................... 42 3.4 Left-orderability of Non-abelian Groups .............. 43 4 Non-left-orderability of Fundamental Groups of 3-Manifolds 49 4.1TopologicalPreliminaries...................... 49 4.2Non-left-orderable3-ManifoldGroups............... 52 4.3OpenProblems............................ 63 ii List of Figures Figure3.1.................................. 45 Figure3.2.................................. 46 Figure4.1.................................
    [Show full text]
  • THE OFFICIAL JOURNAL of the FIBONACCI ASSOCIATION on Fibonacci and Lucas Numbers Which Are Sums of Precisely Four Squares Nevill
    THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION VOLUME 21 FEBRUARY NUMBER 1 1983 CONTENTS. On Fibonacci and Lucas Numbers Which Are Sums of Precisely Four Squares Neville Robbins 3 Intersections of Second-Order Linear Recursive Sequences . A.G. Shannon 6 A Property of Fibonacci and TribonaccI Numbers Christopher D. Godsil & Reinhard Razen 13 Unitary Harmonic Numbers Charles R. Wall 18 A Generalization of Euler's 0-Function P.O. Garcia & Steve Ligh 26 Harmonic Sums and the Zeta Function . v. C. Georghiou & A.N. Philippou 29 Injectivity of Extended Generalized Fibonacci Sequences Karel L. de Bouvere & Regina E. Lathrop 37 One-Free Zeckendorf Sums .. Clark Kirnberling 53 Generalized Profile Numbers Shmuel Zaks 58 Properties of Polynomials Having Fibonacci Numbers for Coefficients .. D.H. Lehmer & Emma Lehmer 62 The Parity of the Catalan Numbers Via Lattice Paths Omer Egecioglu 65 Elementary Problems and Solutions Edited by A.P. Hillman 67 Advanced Problems and Solutions . Edited by Raymond E. Whitney 74 PURPOSE The primary function of THE FIBONACCI QUARTERLY is to serve as a focal point for widespread interest in the Fibonacci and related numbers, especially with respect to new results, research proposals, challenging problems, and innovative proofs of old ideas. EDITORIAL POLICY THE FIBONACCI QUARTERLY seeks articles that are intelligible yet stimulating to its readers, most of whom are university teachers and students. These articles should be lively and well motivated, with new ideas that develop enthusiasm for number sequences or the explora- tion of number facts. Illustrations and tables should be wisely used to clarify the ideas of the manuscript.
    [Show full text]
  • 24(4):316-322, ATANASSOV, Krassimir T
    THE OFFICIAL JOURNAL OF THE FIBONACCI "ASSOCIATION VOLUME 24 NOVEMBER NUMBER 4 1986 CONTENTS Matrix and Other Summation Techniques for Pell Polynomials Bro. J. M. Mahon & A. F. Horadam 290 Letter to the Editor Marjorie Bicknell-Johnson 309 On the Least Common Multiple of Some Binomial Coefficients HughM. Edgar 310 Sidney's Series Clarence B. Larison 313 A Solution to a Tantalizing Problem Gert Almkvist 316 Tenth Roots and the Golden Ratio J. M. H. Peters 323 A Note Concerning the Number of Odd-Order Magic Squares G. L. Chia 328 A Congruence Relation for Certain Recursive Sequences H. T. Freitag & G. M. Phillips 332 A Note on the Representation of Integers as a Sum of Distinct Fibonacci Numbers Piero Filipponi 336 Simson's Formula and an Equation of Degree 24 A. F Horadam & A. P Treweek 344 Differences between Squares and Powerful Numbers Charles Vanden Eynden 347 A Note on Moessner's Process Calvin T. Long 349 Fibonacci Sequences of Period n in Groups Howard J. Wilcox 356 On a Second New Generalization of the Fibonacci Sequence Krassimir T. Atanassov 362 Euclidean Coordinates as Generalized Fibonacci Number Products • • • • • A. F Horadam & S. Pethe 366 Elementary Problems and Solutions Edited by A. P. Hillman, Gloria C Padilla, & Charles R. Wall 371 Advanced Problems and Solutions Edited by Raymond E. Whitney 376 Letter to the Editor - R. Herz-Fischler 382 Volume Index 383 PURPOSE The primary function of THE FIBONACCI QUARTERLY is to serve as a focal point for widespread interest in the Fibonacci and related numbers, especially with respect to new results, research proposals, challenging problems, and innovative proofs of old ideas.
    [Show full text]
  • The Order of Appearance of the Product of Consecutive Lucas Numbers
    THE ORDER OF APPEARANCE OF THE PRODUCT OF CONSECUTIVE LUCAS NUMBERS DIEGO MARQUES Abstract. Let Fn be the nth Fibonacci number and let Ln be the nth Lucas number. The order of appearance z(n) of a natural number n is defined as the smallest natural number k such that n divides Fk. For instance, z(Ln) = 2n, for all n > 1. In this paper, among other things, we prove that z L L L L n(n+1)(n+2)(n+3) ( n n+1 n+2 n+3)= 3 , for all positive integers n ≡ 0 (mod 3). 1. Introduction Let (Fn)n≥0 be the Fibonacci sequence given by Fn+2 = Fn+1 + Fn, for n ≥ 0, where F0 = 0 and F1 = 1. These numbers are well-known for possessing amazing properties (consult [4] together with its very extensive annotated bibliography for additional references and history). We cannot go very far in the lore of Fibonacci numbers without encountering its companion Lucas sequence (Ln)n≥0 which follows the same recursive pattern as the Fibonacci numbers, but with initial values L0 = 2 and L1 = 1. The study of the divisibility properties of Fibonacci numbers has always been a popular area of research. Let n be a positive integer number, the order (or rank) of appearance of n in the Fibonacci sequence, denoted by z(n), is defined as the smallest positive integer k, such that n | Fk (some authors also call it order of apparition, or Fibonacci entry point). There are several results about z(n) in the literature.
    [Show full text]
  • Kaplansky's Conjectures
    Kaplansky’s conjectures Giles Gardam University of Münster New York Group Theory Seminar 11 March 2021 Giles Gardam (University of Münster) Kaplansky’s conjectures 11 March 2021 1 / 17 Links Giles Gardam. A counterexample to the unit conjecture for group rings. arXiv:2102.11818. These slides are available at www.gilesgardam.com/slides/nygt.pdf. Giles Gardam (University of Münster) Kaplansky’s conjectures 11 March 2021 2 / 17 Group rings Let G be a group and R be a ring. The group ring R[G] is the ring nX o rg g j rg 2 R; g 2 G of finite formal sums with multiplication X X X rg g · shh := (rg sh)(gh): × Note that g 7! 1R g is an embedding G ,! (R[G]) of G in the group of units and r 7! r1G embeds R as a subring of R[G]. An expression like r − g makes sense. G-actions on R-modules (e.g. vector spaces) are the same thing as R[G]-modules, so group rings are natural objects of study in representation theory, topology, etc. If K is a field then K[G] is an algebra over K and one might say “group algebra” instead of “group ring”. Giles Gardam (University of Münster) Kaplansky’s conjectures 11 March 2021 3 / 17 Group rings (continued) If G = Z = hti then R[G] is just finite formal sums of multiples of powers of −1 P i t, that is, the Laurent polynomials R[t; t ] = i ai t . k Similarly R[Z ] is just the Laurent polynomials in k unknowns.
    [Show full text]
  • Non-Commutative Gröbner Bases and Applications
    Dissertation Non-Commutative Gr¨obnerBases and Applications Xingqiang Xiu Eingereicht an der Fakult¨atf¨urInformatik und Mathematik der Universit¨atPassau als Dissertation zur Erlangung des Grades eines Doktors der Naturwissenschaften Submitted to the Department of Informatics and Mathematics of the Universit¨atPassau in Partial Fulfilment of the Requirements for the Degree of a Doctor in the Domain of Science Betreuer / Advisor: Prof. Dr. Martin Kreuzer Universit¨atPassau May 2012 Non-Commutative Gr¨obnerBases and Applications Xingqiang Xiu Erstgutachter: Prof. Dr. Martin Kreuzer Zweitgutachter: Prof. Dr. Gerhard Rosenberger M¨undliche Pr¨ufer: Prof. Dr. Franz Brandenburg Prof. Dr. Tobias Kaiser Der Fakult¨atf¨urInformatik und Mathematik der Universit¨atPassau vorgelegt im Mai 2012 Dedicated to my parents and grandma ii Contents 1 Introduction 1 2 Preliminaries 7 2.1 Monoids and Groups . 7 2.2 Rings . 15 2.3 Modules . 21 3 Gr¨obnerBases in KhXi 27 3.1 Admissible Orderings . 28 3.2 The Division Algorithm . 34 3.3 Gr¨obnerBases . 40 3.4 Syzygies . 46 3.5 Gr¨obnerBases of Right Ideals . 52 4 Gr¨obnerBasis Computations in KhXi 55 4.1 The Buchberger Procedure . 57 4.2 Improved Buchberger Procedures . 68 4.2.1 Interreduction on Obstructions . 69 4.2.2 Improved Buchberger Procedures . 77 4.3 Homogenization and Dehomogenization . 96 4.4 Gr¨obnerBasis Computations for Right Ideals . 108 5 Gr¨obnerBasis Theory in (KhXi ⊗ KhXi)r 111 5.1 Module Term Orderings and the Division Algorithm . 112 5.2 Gr¨obnerBases and Gr¨obner Basis Computations . 118 iv CONTENTS 5.3 Improved Buchberger Procedures . 124 5.4 The F4 Procedure .
    [Show full text]
  • Hie Fibonacci Quarterly
    Hie Fibonacci Quarterly THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION VOLUME 17 M E T I I NUMBER 1 CONTENTS Pythagorean Triples Containing Fibonacci Numbers: Solutions for F2 ± F2 = K2 . Marjorie Bicknell-Johnson 1 Strong Divisibility Sequences and Some Conj ectures . Clark Kimberling 13 Greatest Common Divisors of Sums and Differences of Fibonacci, Lucas9 and Chebyshev Polynomials . Clark Kimberling 18 Probability via the 217th Order Fibonacci--^ Sequence .................................'. Stephen John Turner 23 Some Congruences Involving Generalized Fibonacci Numbers . Charles R. Wall 29 Enumeration of Truncated Latin Rectangles . F. W. Light3 Jr. 34 The Normal Modes of a Hanging Oscillator of Order N . John Boardman 37 Congruences for Certain Fibonacci Numbers . Norvald Midttun 40 Some Divisibility Properties of Generalized Fibonacci Sequences . Paul S. Bruckman 42 A Note on a Pell-Type Sequence . William J. OrDonnell 49 Periods and Entry Points in Fibonacci Sequence . A. Allard and P. Lecomte 51 Generating Functions of Central Values in Generalized Pascal Triangles . Claudia Smith and Verner E. Hoggatt3 Jr. 58 Solution of y J = ( y -J in Terms of Fibonacci Numbers . J. ..{... James C. Owings3 Jr. 67 The Diophantine Equation Nb2 = c2 + N + 1 . David A. Anderson and Milton W. Loyer 69 Matrix Generators of Pell Sequences . Joseph Ercolano 71 f Two Theorems Concerning Hexagonal Numbers .. William J. 0 Donnell 77 f Some Sequences Like Fibonacci s .. B. H. Neumann and L. G. Wilson 80 Nearly Linear Functions ... V. E. Eoggatt3 Jr.3 and A. P. Hillman 84 Elementary Problems and Solutions"........ Edited by A. P. Hillman 90 Advanced Problems and Solutions . .. Edited by Raymond E.
    [Show full text]