This site is supported by donations to The OEIS Foundation.

CiteT

From OeisWiki
Jump to: navigation, search


CiteT

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • This section lists works in which the first author's name begins with T.
  • The full list of sections is: A Ba Bi Ca Ci D E F G H I J K L M N O P Q R Sa Sl T U V W X Y Z.
  • For further information, see the main page for Works Citing OEIS.

References

  1. Inder J. Taneja, Palindromic Prime Embedded Trees, RGMIA Res. Rep. Coll. 20 (2017), Art. 124. PDF (A053600)
  2. Inder J. Taneja, Selfie Numbers-IV: Addition, Subtraction and Factorial, RGMIA Research Report Collection, 19 (2016), #163, pp. 1-42, http://rgmia.org/v19.php
  3. Inder J. Taneja, Selfie Numbers, Fibonacci Sequence and Selfie Fractions, RGMIA Collection, 19 (2016), #167, pp. 1-24, http://rgmia.org/v19.php
  4. Hanqi Tang, Qifu Tyler Sun, Zongpeng Li, Xiaolong Yang, Keping Long, Circular-shift Linear Network Coding, arXiv:1707.02163 [cs.IT], 2017.
  5. M. Tang, Relatively Prime Sets and a Phi Function for Subsets of {1, 2, ... , n}, J. Int. Seq. 13 (2010) # 10.7.6.
  6. Tang, Min; Ren, Xiao-Zhi; Li, Meng On near-perfect and deficient-perfect numbers. Colloq. Math. 133 (2013), no. 2, 221-226.
  7. N. Benyahia Tani, Sadek Bouroubi, Enumeration of the Partitions of an Integer into Parts of a Specified Number of Different Sizes and Especially Two Sizes, J. Int. Seq. 14 (2011) # 11.3.6
  8. Yoshio Tanigawa, Wenguang Zhai, On the Gcd-Sum Function, J. Int. Sequ. 11 (2008) # 08.2.3
  9. Murray Tannock, Equivalence classes of mesh patterns with a dominating pattern, MSc Thesis, Reykjavik Univ., May 2016; https://skemman.is/bitstream/1946/25589/1/msc-tannock-2016.pdf
  10. Terence Tao, A remark on primality testing and decimal expansions (2008); arXiv:0802.3361
  11. A. A. Taranenko, Permanents of multidimensional matrices: Properties and applications, Journal of Applied and Industrial Mathematics, October 2016, Volume 10, Issue 4, pp 567–604
  12. Yuriy Tarannikov, "The Minimal Density of a Letter in an Infinite Ternary Square-Free Word is 0.2746...", J. Integer Sequences, Volume 5, 2002, Article 02.2.2.
  13. Boris V. Tarasov, The concrete theory of numbers : New Mersenne conjectures. Simplicity and other wonderful properties of numbers $L(n) = 2^{2n}\pm2^n\pm1$ (2008); arXiv:0804.3830
  14. Paul Tarau, Isomorphic Data Encodings and their Generalization to Hylomorphisms on Hereditarily Finite Data Types, 2009.
  15. Paul Tarau, Emulating Primality with Multiset Representations of Natural Numbers, in THEORETICAL ASPECTS OF COMPUTING, ICTAC 2011, Lecture Notes in Computer Science, 2011, Volume 6916/2011, 218-238, doi:10.1007/978-3-642-23283-1_15
  16. P. Tarau, Computing with Catalan Families, 2013, PDF
  17. P. Tarau, Towards a generic view of primality through multiset decompositions of natural numbers, Theoretical Computer Science, Volume 537, 5 June 2014, Pages 105-124.
  18. Paul Tarau, Two Mechanisms for Generating Infinite Families of Pairing Bijections, PDF, 2013.
  19. P. Tarau, A Generic Numbering System based on Catalan Families of Combinatorial Objects, arXiv preprint arXiv:1406.1796, 2014
  20. Paul Tarau, On a Uniform Representation for Combinators, Arithmetic, Lambda Terms and Types, preprint. (A000108, A220471)
  21. Paul Tarau, On Type-directed Generation of Lambda Terms, preprint (A001006, A006318, A135501, A220894, A220471)
  22. Paul Tarau, On logic programming representations of lambda terms: de Bruijn indices, compression, type inference, combinatorial generation, normalization, 2015; http://www.cse.unt.edu/~tarau/research/2015/dbx.pdf
  23. P. Tarau, A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations, arXiv preprint arXiv:1507.06944, 2015
  24. Paul Tarau, A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms, arXiv preprint arXiv:1608.03912, 2016
  25. Paul Tarau, Declarative Algorithms for Term Generation, Counting and Random Sampling of Term Algebras, 2017.
  26. Paul Tarau and Brenda Luderman, A Logic Programming Framework for Combinational Circuit Synthesis (2008); arXiv:0804.2095; in Logic Programming, Lecture Notes in Computer Science, Volume 4670/2007, Springer-Verlag.
  27. E Tartaglia, PA Pearce, Fused RSOS Lattice Models as Higher-Level Nonunitary Minimal Cosets, arXiv preprint arXiv:1509.07576, 2015
  28. G. Tasi, F. Mizukami, J. Csontos, W. Gyorffy and I. Palinko, "Quantum algebraic-combinatoric study of the conformational properties of n-alkanes. II", Journal of Mathematical Chemistry, vol. 27, (#3) (2000), pp. 191-199.
  29. J. J. Tattersall, Elementary Number Theory in Nine Chapters, 1999.
  30. Roberto Tauraso, The dinner table problem: the rectangular case, Integers: Electr. J. Combin. Numb. Th., vol 6 (2006), # A11. Also arXiv:math/0507293.
  31. R. Tauraso, Edge cover time for regular graphs, JIS 11 (2008) 08.4.4
  32. Peter Taylor, Counting distinct dimer hex tilings, Preprint 2015; http://cheddarmonk.org/papers/distinct-dimer-hex-tilings.pdf.
  33. P. J. Taylor, Conditions for C-alpha continuity of Bezier Curves, November 2001. [Broken link?]
  34. H. J. J. te Riele, Computational sieving applied to some classical number-theoretic problems, CWI Report, MAS R9821, October 1998.
  35. M. P. Technau, The Calkin-Wilf Tree and a Trace Condition, Master's Thesis, Julius-Maximilian’s University of Würzburg, Faculty for Mathematics and Computer Science, 2015; http://www.mathematik.uni-wuerzburg.de/~steuding/technau.pdf
  36. Zach Teitler, A note on Mustata's computation of multiplier ideals of hyperplane arrangements (2006), arXiv:math/0610303.
  37. A. Tekcan, M. Tayat, M. E. Ozbek, The diophantine equation 8x^2-y^2+8x(1+t)+(2t+1)^2=0 and t-balancing numbers, ISRN Combinatorics, Volume 2014, Article ID 897834, 5 pages, doi:10.1155/2014/897834. [An earlier version mentions the OEIS and sequences A000129 and A002203, although the published version omits these references]
  38. N. M. Temme, Asymptotic Methods for Integrals, Chapter 13: Examples of 3_F_2-polynomials, 2014; doi:10.1142/9789814612166_0013
  39. GLORIA TENG, JENNIFER HARLOW, DOMINIC LEE and RAAZESH SAINUDIIN, Posterior expectation of regularly paved random histograms; PDF.
  40. Tenner, Bridget Eileen, Pattern avoidance and the Bruhat order. J. Combin. Theory Ser. A 114 (2007), no. 5, 888-905.
  41. Bridget Eileen Tenner, Spotlight Tiling (2007), arXiv:0711.1819.
  42. Bridget Eileen Tenner, Optimizing linear extensions, SIAM J. Discr. Math. 23 (3) (2009) 1450-1454.
  43. B. E. Tenner, Repetition in reduced decompositions, Arxiv preprint arXiv:1106.2839, 2011
  44. B. E. Tenner, Mesh patterns with superfluous mesh, arXiv preprint arXiv:1302.1883, 2013.
  45. Hui Ting Teo, MFM Salleh, Three description lattice vector quantization for efficient data transmission, in TENCON 2015-2015 IEEE Region 10 Conference, 2015; doi:10.1109/TENCON.2015.7372712
  46. Venta Terauds, J Sumner, Circular genome rearrangement models: applying representation theory to evolutionary distance calculations, arXiv preprint arXiv:1712.00858, 2017
  47. P. TERZICH, ON THE FORM OF MERSENNE NUMBERS, vixra.org, 2012
  48. Olaf Teschke, Some heuristics about the ecosystem of mathematics research data, PAMM, Volume 16, Issue 1 October 2016 Pages 963–964 DOI: 10.1002/pamm.201610460
  49. Sam Tetruashvili, Inductive Inference of Integer Sequences, PDF
  50. Elmar Teufl and Stephan Wagner, Enumeration problems for classes of self-similar graphs, Journal of Combinatorial Theory, Series A, Volume 114, Issue 7, October 2007, Pages 1254-1277.
  51. Vasu Tewari, Operators on compositions and noncommutative Schur functions, PhD thesis, UBC (2015), see Acknowledgment ["I would also like to acknowledge the OEIS and Sage-Combinat (and the entire community developing it); the results in this thesis could not have been obtained without these resources."]
  52. Vasu Tewari, Gessel polynomials, rooks, and extended Linial arrangements, arXiv preprint arXiv:1604.06894, 2016
  53. J. Textor, A. Idelberger, M. Liskiewicz, Learning from Pairwise Marginal Independencies, Preprint 2015, http://tbb.bio.uu.nl/textor/papers/2015-uai.pdf.
  54. S. E. Thiel, Generating Functions for Fibonomial Coefficients and Fibonacci Products, PDF
  55. J. Thiel, Conway's RATS Sequences in Base 3, Journal of Integer Sequences, Vol. 15, 2012, #12.9.2.
  56. Matthias Thimm, On the expressivity of inconsistency measures, Artificial Intelligence, Volume 234, May 2016, Pages 120–151.
  57. Thitsa, M., On the radius of convergence of mixed cascades of analytic nonlinear input-output systems, System Theory (SSST), 2012 44th Southeastern Symposium on, Date of Conference: 11-13 March 2012, Pages: 231-236
  58. Thitsa, M.; Gray, W. S.; On the radius of convergence of cascaded analytic nonlinear systems: The SISO case, System Theory (SSST), 2011 IEEE 43rd Southeastern Symposium on, 14-16 March 2011, pp. 30-36.
  59. Makhin Thitsa and W. Steven Gray, On the Radius of Convergence of Cascaded Analytic Nonlinear Systems, 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), Orlando, FL, USA, December 12-15, 2011, pp. 3830-3835; PDF.
  60. M. Thitsa and W. S. Gray, On the Radius of Convergence of Interconnected Analytic Nonlinear Input-Output Systems, SIAM J. CONTROL OPTIM, Vol. 50, No. 5, pp. 2786-2813.
  61. Jason Joseph Thoma, A Generalization of Gelfand's Question to an Arbitrary Base, M.A. Thesis, San Diego State Univ., Spring 2017; https://search.proquest.com/openview/f087099d057bcae2e67aa65ed6f84d93/1?pq-origsite=gscholar&cbl=18750&diss=y
  62. Mark A. Thomas, Math Ontological Basis of Quasi Fine-Tuning in Ghc Cosmologies, HAL preprint Id: hal-01232022v3, https://hal.archives-ouvertes.fr/hal-01232022v3/document 2015
  63. Mark A. Thomas, Number Theoretic Structural Approach to Dimensionless Physics Forms, HAL preprint Id: hal-01580821 [math.NT], 2017
  64. Thurber, Edward G., Efficient generation of minimal length addition chains. SIAM J. Comput. 28 (1999), no. 4, 1247-1263 (electronic).
  65. Chao Tian, Vinay A. Vaishampayan and N. J. A. Sloane, Constant Weight Codes: A Geometric Approach Based on Dissections, PDF.
  66. A Tichai, J Langhammer, S Binder, R Roth, Hartree-Fock Many-Body Perturbation Theory for Nuclear Ground-States, arXiv preprint arXiv:1601.03703, 2016
  67. Todd Tichenor, A note on graph compositions and their connection to minimax of set partitions, arXiv:1709.00393 [math.CO], 2017
  68. John Y. C. Ting, Key Role of Dimensional Analysis Homogeneity in Proving Riemann Hypothesis and Providing Explanations on the Closely Related Gram Points, Journal of Mathematics Research; Vol. 8, No. 4; August 2016; doi:10.5539/jmr.v8n4p1
  69. VG Tkachenco, OV Sinyavsky, Blocks of Monotone Boolean Functions of Rank 5, Computer Science and Information Technology 4(4): 139-146, 2016;doi:10.13189/csit.2016.040402
  70. Ana Paula Tomás, On the Enumeration of Permutominoes, in Fundamentals of Computation Theory, Volume 9210 of the series Lecture Notes in Computer Science pp 41-52.
  71. A. I. Tomescu, Sets as Graphs, Ph. D. Thesis, Universita degli Studi di Udine , Dipartimento di Matematica e Informatica, Dottorato di Ricerca in Informatica, Dec. 2011; PDF
  72. D. Tondeur, Y. Fan, J.-M. Commenge, L. Luo, doi:10.1016/j.ces.2011.03.003 Flow and pressure distribution in linear discrete ladder-type fluidic circuits: An analytical approach], Chem. Engin. Sci. 66 (12) (2011) 2568-2686
  73. Daniel Tondeur and Lingai Luo, Flow Equipartition and Shape Optimization of Fluidic Channel Networks, Chapter 3 of L. Luo (ed.), Heat and Mass Transfer Intensification and Shape Optimization, Springer, 2013
  74. R. Tonelli, Fibonacci-like sequences and shift spaces in symbolic dynamics (2007), arXiv:0708.4370.
  75. Kevin Topley, Computationally Efficient Bounds for the Sum of Catalan Numbers, arXiv preprint arXiv:1601.04223, 2016
  76. A. Topuzoglu, The Carlitz rank of permutations of finite fields: A survey, Journal of Symbolic Computation, Online, Dec 07, 2013.
  77. M. Torelli, Increasing integer sequences and Goldbach's conjecture, preprint, 1996.
  78. M. Torelli, Partitions and Schubert polynomials, Presented at FPSAC'95.
  79. M. Torelli, doi:10.1051/ita:2006017 Increasing Integer sequences and Goldbach's conjecture], RAIRO - Inf. Theor. Appl. 40 (2006) 107-121
  80. Mauro Torelli, A proposito degli alberi rosso-neri, Note on the course "algorithms and data structures", (2007)
  81. B. Torrence, The Easiest Lights Out Games, The College Mathematics Journal, 42 (2011), 361-372.
  82. A. Martinez Torres, L. R. Dai, C. Koren, D. Jido and E. Oset. The KD, eta D_s interaction in finite volume and the D_{s^*0}(2317) resonance, Arxiv preprint arXiv:1109.0396, 2011
  83. D. F. M. Torres, Numeros Felizes e Sucessoes de Smarandache: Digressoes com o Maple, Smarandache Notions 14 (2004) 119.
  84. Agnes Toth, Graph colouring problems, BMe Research Grant Proposal, Budapest University of Technology and Economics, Faculty of Electrical Engineering and Computer Science, http://www.ttk.bme.hu/altalanos/nyilt/BMe-palyazat/2011/hallgato/toth_agnes/toth_agnes_en.htm, 2012
  85. Laszlo Toth, Regular integers modulo n (2007), arXiv:0710.1936.
  86. L. Toth, A gcd-sum function over regular integers modulo n, JIS 12 (2009) 09.2.5
  87. L. Toth, On the Bi-Unitary Analogues of Euler's Arithmetical Function and the Gcd-Sum Function, JIS 12 (2009) 09.5.2
  88. L. Toth, A survey of gcd-sum functions, J. Int. Seq. 13 (2010) # 10.8.1
  89. L. Toth, Weighted Gcd-Sum Functions, Journal of Integer Sequences, 14 (2011), #11.7.7.
  90. L. Toth, A survey of the alternating sum-of-divisors function, preprint arXiv:1111.4842, 2011
  91. L. Toth, The alternating sum-of-divisors function, 9th Joint Conf. on Math. and Comp. Sci., February 9-12, 2012, Siofok, Hungary; PDF
  92. Laszlo Toth, On the number of cyclic subgroups of a finite abelian group, Arxiv preprint arXiv:1203.6201, 2012
  93. L. Tóth, Multiplicative arithmetic functions of several variables: a survey, arXiv preprint arXiv:1310.7053, 2013
  94. L. Tóth, Counting solutions of quadratic congruences in several variables revisited, arXiv preprint arXiv:1404.4214, 2014
  95. Laszlo Tóth, Alternating sums concerning multiplicative arithmetic functions, arXiv preprint arXiv:1608.00795, 2016
  96. M. M. Tousi, An application of control system in strategic management, in Systems Conference (SysCon), 2011 IEEE, Issue Date: 4-7 April 2011, pp. 542 - 547. doi:10.1109/SYSCON.2011.5929076
  97. E. R. Toussaint and G. Toussaint, What is a Pattern?, Proceedings of Bridges 2014: Mathematics, Music, Art, Architecture, Culture, pp. 293-300; PDF
  98. Craig A. Tracy, H Widom, On the ground state energy of the delta-function Bose gas, arXiv preprint arXiv:1601.04677, 2016
  99. S. E. Tranter, Cluster Voting for Speaker Diarisation, citeseerx 10.1.1.2.5544
  100. Christain Trefftz, H McGuire, Z Kurmas, J Scripps, Exhaustive Community Enumeration in Parallel, Parallel Processing Letters, 26, 1650006 (2016) [16 pages] doi:10.1142/S0129626416500067
  101. Amitabha Tripathi, "A Note on the Postage Stamp Problem", J. Integer Sequences, Volume 9, 2006, Article 06.1.3.
  102. Pavel Trojovsky, On some identities for the Fibonomial coefficients via generating function, Discrete Applied Mathematics, Volume 155, Issue 15, 15 September 2007, Pages 2017-2024.
  103. John Tromp, John's Connect Four Playground, http://homepages.cwi.nl/~tromp/c4/c4.html, viewed Jan 23 2014.
  104. Tronícek, Zdenek; Shinohara, Ayumi, The size of subsequence automaton. Theoret. Comput. Sci. 341 (2005), no. 1-3, 379-384.
  105. H. Tronnolone, A tale of two primes, COLAUMS Space, #3, 2013, PDF
  106. M. Trott, Numerical Computations: The Mathematica GuideBook for Numerics, Springer-Verlag.
  107. W. Tschischik, R. Moessner, M. Haque, Breathing mode in the Bose-Hubbard chain with a harmonic trapping potential, arXiv preprint arXiv:1310.0281, 2013
  108. A. Tsuchiya, The delta-vectors of reflexive polytopes and of the dual polytopes, arXiv preprint arXiv:1411.2122, 2014
  109. Shealyn Tucker, Isomorphic Circulant Graphs and Applications to Homogeneous Linear Systems, Proceedings Of The National Conference On Undergraduate Research (NCUR) 2014, University of Kentucky, Lexington, KY, April 3-5, 2014.
  110. Zoe Tucker, Emergence and Complexity in Music, (2017), HMC Senior Theses, 101.
  111. Hans J. H. Tuenter, Walking into an absolute sum (2006), arXiv:math/0606080.
  112. A. J. Turner, J. F. Miller, Recurrent Cartesian Genetic Programming Applied to Famous Mathematical Sequences, 2014; PDF
  113. Paul Turner, Steve Thornton, "Addition chains: A reSolve lesson", Australian Senior Mathematics Journal, Vol. 31, No. 1 (2017), pp. 59-64.
  114. H Tyagi, A Vardy, Universal Hashing for Information Theoretic Security, Preprint 2015; https://www.ece.iisc.ernet.in/~htyagi/papers/ht-av15.pdf
  115. Dimitra Tzoumpa, Theodoros Karvounidis, and Christos Douligeris. Towards an Ontology Approach in Teaching Geometry. In Michael E. Auer, ed., David Guralnick, ed., James Uhomoibhi, ed. Interactive Collaborative Learning: Proceedings of the 19th ICL Conference. 1st ed., 2017, pp. 198-209.
  116. Apoloniusz Tyszka, A conjecture which implies that there are infinitely many primes of the form n!+1, Preprint, 2017; https://hal.archives-ouvertes.fr/hal-01625653/document
  117. Apoloniusz Tyszka, A common approach to the problem of the infinitude of twin primes, primes of the form n! + 1, and primes of the form n! − 1, 2018. PDF (A002981, A002982, A093804)

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • The full list of sections is: A Ba Bi Ca Ci D E F G H I J K L M N O P Q R Sa Sl T U V W X Y Z.
  • For further information, see the main page for Works Citing OEIS.
Retrieved from "https://oeis.org/w/index.php?title=CiteT&oldid=1622317"