Selected referencesfor Tamas Lengyel

September 20, 2006

  1. T. Amdeberhan, D. Manna, V. H. Moll, The 2-adic valuation of a sequence arising from a rational integral, manuscript, 2006
  2. T. Amdeberhan, D. Manna, V. H. Moll, The 2-adic valuation of Stirling numbers, manuscript, 2006
  3. G. Nivasch, The Sprague–Grundy function of the game Euclid, Discrete Mathematics 306(2006), 2798-2800
  4. G. Della Riccia, Convertingbetween generalized Bell, Lah, Stirling, and Tanh numbers, Journal of Integer Sequences 9(2006),Article 06.3.5
  1. A. S. Fraenkel, Euclid and Wythoff games, Discrete Mathematics 304(2005), 65-68
  1. S. De Wannemacker,On the 2-adic order of the Stirling numbers of the second kind, INTEGERS 5(2005), #A21, 1-7
  1. D. Collins, Variations on a theme of Euclid, INTEGERS 5(2005), #G03, 1-12
  1. J. L. DuBien, W. D. Warde, and S. S. Chae, Moments of Rand's C statistic in cluster analysis, Statistics & Probability Letters(69)2004, 243-252
  1. P. J. Larcombe, E. J. Fennessey, W. A. Koepf, and D. R. French, The Catalan numbers re-visit the World Series, Congressus Numerantium 165(2003), 19-32
  1. S. R. Finch, Mathematical Constants, on Lengyel’s Constant, Section 5.7, in Constants associated with enumerating discrete structures, Encyclopedia of Mathematics and its Applications 94, Cambridge University Press, May 2003, pp. 316-321.
  1. F. Luca, On positive numbers n for which Ω(n) divides Fn, Fibonacci Quarterly 41(2003), 365-371
  1. J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, CambridgeUniversity Press, 2003
  1. S. R. Finch, Bipartite, k-colorable and k-colored graphs, unpublished note, 2003
  2. S. R. Finch, Transitive relations, topologies and partial orders, unpublished, 2003
  1. A. S. Fraenkel, Two-player games on cellular automata, in More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 10-28, 2000, Berkeley, CA (R. J. Nowakowski, ed.), Cambridge University Press, Cambridge, Vol. 42, 2002, pp. 279-306
  1. Th. Prellberg, On the asymptotic analysis of a class of linear recurrences, talk given at INRIA, Project Algorithms Seminars, 2002-2003,
  1. A. S. Fraenkel, Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction, Electronic Journal of Combinatorics, Dynamic Surveys, #DS2, 2002-2006
  1. Z. Xie, On the summation of generalized arithmetic-geometric trigonometric series, Fibonacci Quarterly 40 (2002), 128-135
  1. A. P. Ulyanov, Polydiagonal compactification of configuration spaces, Journal of Algebraic Geometry 11 (2002), 129-159 (also in A. P. Ulyanov, Polydiagonal compactification of configuration spaces, Ph.D. thesis, PennsylvaniaStateUniversity, May 8, 2000)
  1. R. Medina, Asymptotic behavior of Volterra difference equations, Computers & Mathematics with Applications 41 (2001), 679-687
  1. F. Luca, Equations involving arithmetic functions of Fibonacci and Lucas numbers, Fibonacci Quarterly 38 (2000), 49-55
  1. inEric Weisstein's World of Mathematics the web's most extensive mathematics resource, 1999
  1. L.C. Hsu and P. J. S. Shiue, On certain summation problems and generalizations of Eulerian polynomials and numbers, Discrete Mathematics 204 (1999), 237-247
  1. H. Cohen, On the 2-adic valuations of the truncated polylogarithm series, Fibonacci Quarterly 37 (1999), 117-121
  1. CRC Concise Encyclopedia of Mathematics: Lengyel’s Constant (p1069), CRC Press, 1998
  1. S. Plouffe, The Lengyel Constant, at 1997
  1. P. J. Cameron, On the probability of connectedness, Discrete Mathematics 167/168(1997), 175-187
  1. B. Van Cutsem, Combinatorial structures and structures for classification, Computational Statistics & Data Analysis 23(1996), 169-188
  1. A. Hardy, On the number of clusters, Computational Statistics & Data Analysis 23(1996), 83-96
  1. S. Finch, Lengyel's Constant, in the Favorite Mathematical Constants database, at 1996
  1. S. Plouffe, Lengyel's Constant, in the ISC database, at 1996
  1. N. J. A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995, M3649 (1, 1, 4, 32, 436, 9012, ...) ultradissimilarity relations on an n-set, ref.: EJC 5 313 84, ANAL 12 109 92
  1. M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Algebra and Its Applications 226-228(1995), 57-72
  1. F. Clarke, Hensel's Lemma and the divisibility by primes of Stirling-like numbers, Journal of Number Theory 52(1995), 69-84
  1. R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, 1994
  1. B. Van Cutsem and B. Ycart, Renewal-type behavior of absorption times in Markov chains, Advances in Applied Probability 26 (1994), 988-1005
  1. P. Flajolet, P. Zimmerman, and B. Van Cutsem, A calculus for the random generation of labeled combinatorial structures, Theoretical Computer Science 132 (1994), 1-35
  1. H.J. Runckel, Solution formulas for linear difference equations with applications to continued fractions, Constructive Approximation 10 (1994), 207-234
  1. V. L. Kocic and G. Ladas, Global Behavior of Nonlinear Difference Equations of Higher Order with Applications, Kluwer Academic Publishers, Series: Mathematics and Its Applications Series, #25, 1993
  1. P. Flajolet, P. Zimmermann and B. Van Cutsem, A calculus of random generation. Algorithms-ESA '93 (Bad Honnef, 1993), Lecture Notes in Computer Science 726, 169-180, Springer, Berlin, 1993.
  1. P. Flajolet, B. Salvy, Hierarchical set partitions and analytic iterates of the exponential function, 1990, 13 pp. (Manuscript on determining Lengyel's Constant)

10/9/2018page 1

  1. P. J. Cameron, Some treelike objects, Quarterly Journal of Mathematics (Oxford) 38(1987), 155-183
  1. A. D. Gordon, A review of hierarchical classification, Journal of the Royal Statistical Society Series A 150 (1987), 119-137
  1. F. Murtagh, Counting dendrograms: a survey, Discrete Applied Mathematics 7 (1984), 191-199

10/9/2018page 1