This site is supported by donations to The OEIS Foundation.

CiteN

From OeisWiki

Jump to: navigation, search


Contents

CiteN

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 N.
  • 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. D. Nacin, The Minimal Non-Koszul A(Gamma), arXiv:1204.1534, 2012
  2. Rohit Nagpal, A Snowden, The module theory of divided power algebras, arXiv preprint arXiv:1606.03431, 2016
  3. G. Nagy, Invariant representation for rectilinear rulings, Journal of Electronic Imaging 23(6), 063011 (Nov∕Dec 2014); PDF
  4. B. K. Nakamura, Computational methods in permutation patterns, PhD Dissertation, Rutgers University, May 2013.
  5. Brian Nakamura, Elizabeth Yang, Competition graphs induced by permutations, arXiv preprint arXiv:1503.05617, 2015
  6. B. Nakamura and D. Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes, arXiv:1209.2353, 2012
  7. Nagatomo Nakamura, Pseudo-Normal Random Number Generation via the Eulerian Numbers</a>, Josai Mathematical Monographs, vol 8, p 85-95, 2015. PDF
  8. F. Nakano, T. Sadahiro, A generalization of carries process and Eulerian numbers, arXiv preprint arXiv:1306.2790, 2013
  9. K. Nakano, Shall We Juggle, Coinductively?, in Certified Programs and Proofs, Lecture Notes in Computer Science Volume 7679, 2012, pp 160-172, doi:10.1007/978-3-642-35308-6_14
  10. S. Narayanan, Improving the Speed and Accuracy of the Miller-Rabin Primality Test 2015; http://math.mit.edu/research/highschool/primes/materials/2014/Narayanan.pdf
  11. Lila Naranjani and Madjid Mirzavaziri, Full Subsets of N, Journal of Integer Sequences, Vol. 14 (2011), #11.5.3.
  12. Shyam Narayanan, Improving the Accuracy of Primality Tests by Enhancing the Miller-Rabin Theorem, 2014; http://web.mit.edu/primes/materials/2014/conf/5-1-Narayanan.pdf
  13. P Nataf, M Lajkó, A Wietek, K Penc, F Mila, AM Läuchli, Chiral spin liquids in triangular lattice SU (N) fermionic Mott insulators with artificial gauge fields, - arXiv preprint arXiv:1601.00958, 2016
  14. Melvyn B. Nathanson, Primitive sets and an Euler phi function for subsets of {1,2,...,n} (2006), arXiv:math/0608150.
  15. M. B. Nathanson, Growth polynomials for additive quadruples and (h, k)-tuples, arXiv preprint arXiv:1305.7172, 2013
  16. M. B. Nathanson, K. O'Bryant, A problem of Rankin on sets without geometric progressions, arXiv preprint arXiv:1408.2880, 2014
  17. Lexter R. Natividad, Notes on Jacobsthal and Jacobsthal-like Sequences, International Journal of Mathematics Trends and Technology (IJMTT), Volume 34 Number 2, 2016, p. 115-117. doi:10.14445/22315373/IJMTT-V34P519
  18. L. Naughton and G. Pfeiffer, Integer Sequences Realized by the Subgroup Pattern of the Symmetric Group, arXiv:1211.1911, 2012.
  19. Enrique Navarrete, Forbidden Substrings In Circular K-Successions, arXiv:1702.02637 [math.CO], 2017.
  20. Miguel Navascues, Tamas Vertesi, The limits of Matrix Product State models, arXiv:1509.04507 [quant-ph]
  21. S. P. Naveen, On The Asymptotics of Some Counting Problems in Physics, Thesis, Bachelor of Technology, DEPARTMENT OF PHYSICS, INDIAN INSTITUTE OF TECHNOLOGY, MADRAS, May 2011; PDF
  22. S. Nazardonyavi and S. Yakubovich, Superabundant numbers, their subsequences and the Riemann hypothesis, arXiv:1211.2147, 2012
  23. S. Nazardonyavi and S. Yakubovich, Delicacy of the Riemann hypothesis and certain subsequences of superabundant numbers, arXiv preprint arXiv:1306.3434, 2013
  24. S. Nazardonyavi, S. Yakubovich, Extremely Abundant Numbers and the Riemann Hypothesis, Journal of Integer Sequences, 17 (2014), Article 14.2.8.
  25. Nebe, G., Kneser-Hecke-operators in coding theory. Abh. Math. Sem. Univ. Hamburg 76 (2006), 79-90.
  26. G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
  27. D. Necas, I. Ohlidal, Consolidated series for efficient calculation of the reflection and transmission in rough multilayers, Optics Express, Vol. 22, 2014, No. 4; doi:10.1364/OE.22.004499
  28. Ion Nechita, Some analytical aspects of Hadamard matrices
  29. Z. Nedev, A Reduced Computational Complexity Strategy for the Magnus-Derek Game, International Mathematical Forum, Vol. 9, 2014, no. 7, pp. 325 - 333; doi:10.12988/imf.2014.411
  30. Z. Nedev and S. Muthukrishnan, The Nagger-Mover Game, DIMACS Tech. Report 2005-22.
  31. Z. Nedev, S. Muthukrishnan, The Magnus-Derek game, Theoretical Computer Science, Volume 393, Issues 1-3, 20 March 2008, Pages 124-132.
  32. T. Negadi, The genetic code invariance: when Euler and Fibonacci meet, arXiv preprint arXiv:1406.6092, 2014; Symmetry: Culture and Science, Vol. 25, No. 3, 261-278, 2014
  33. F. Negro, K. Keenan, D. Farina, Power spectrum of the rectified EMG: Influence of motor unit action potential shapes, in: Engineering in Medicine and Biology Society (EMBC), 2014 36th Annual International Conference of the IEEE, 26-30 Aug. 2014; Pages: 2193 - 2196; ISSN : 1557-170X doi:10.1109/EMBC.2014.6944053
  34. Denis Neiter, A Proag, Links Between Sums Over Paths in Bernoulli's Triangles and the Fibonacci Numbers, Journal of Integer Sequences, 2016, Vol. 19, #16.8.3.
  35. Roger B. Nelson, Multi-Polygonal Numbers, Mathematics Magazine, Vol. 89, No. 3 (June 2016), pp. 159-164.
  36. R. B. Nelsen and H. Schmidt, Jr., Chains in power sets, Math. Mag., 64 (1991), 23-31.
  37. Robert M. Nemba and Alphonse Emadak, "Direct Enumeration of Chiral and Achiral Graphs of a Polyheterosubstituted Monocyclic Cycloalkane", J. Integer Sequences, Volume 5, 2002, Article 02.1.6.
  38. Nemecek, Jan; Klazar, Martin, A bijection between nonnegative words and sparse abba-free partitions. Discrete Math. 265 (2003), no. 1-3, 411-416.
  39. G. Nemes, On the coefficients of the asymptotic expansion of n!, J. Integer Seqs. 13 (2010), 5.
  40. Gergo Nemes, On the coefficients of an asymptotic expansion related to Somos' quadratic recurrence constant, Applicable Analysis and Discrete Mathematics, Vol. 5, No. 1 (April 2011), pp. 60-66; http://www.jstor.org/stable/43666828
  41. Gergő Nemes, An Asymptotic Expansion for the Bernoulli Numbers of the Second Kind, J. Int. Seq. 14 (2011) # 11.4.8
  42. László Németh. Pascal pyramid in the space H2×R. arXiv:1701.06022, [math.CO]. 2017.
  43. Rafael I. Nepomechie and Francesco Ravanini, Completeness of the Bethe Ansatz solution of the open XXZ chain with nondiagonal boundary terms (2003), arXiv:hep-th/0307095.
  44. R. I. I. Nepomeche, F. Ravanini, doi:10.1088/0305-4470/36/45/003 Completeness of the Bethe Ansatz solution of the open XXZ chain with nondiagonal boundary terms, J. Phys A: Math. Gen. 36 (45) (2003) 11391.
  45. Neudauer, Nancy Ann; Stevens, Brett, Enumeration of the bases of the bicircular matroid on a complete bipartite graph. Ars Combin. 66 (2003), 165-178.
  46. N. Neumarker, Realizability of Integer Sequences as Differences of Fixed Point Count Sequences, JIS 12 (2009) 09.4.5
  47. E. Neuwirth, Computing Tournament Sequence Numbers Efficiently With Matrix Techniques, Séminaire Lotharingien de Combinatoire, B47h (2002), 12 pp.
  48. O. Nevzorova, N. Zhiltsov, A. Kirillovich, E. Lipachev, OntoMath^{PRO} Ontology: A Linked Data Hub for Mathematics, arXiv preprint arXiv:1407.4833, 2014
  49. Lee Aaron Newberg, The number of clone orderings, Discrete Applied Mathematics, Volume 69, Issue 3, 27 August 1996, Pages 233-245.
  50. L. A. Newberg, Finding, Evaluating, and Counting DNA Physical Maps (2002), Doctoral Thesis, University of California at Berkeley, 1993.
  51. R Newton, A R Camacho, Strangely dual orbifold equivalence I, arXiv preprint arXiv:1509.08069, 2015
  52. Hieu D. Nguyen, Mathematics by experiment: Exploring patterns of integer sequences
  53. Hieu D. Nguyen, Experimental Mathematics and Data Mining: Excavating the Online Encyclopedia of Integer Sequences, PDF, February 23, 2011
  54. H. D. Nguyen, A mixing of Prouhet-Thue-Morse sequences and Rademacher functions, http://www.rowan.edu/colleges/csm/departments/math/facultystaff/nguyen/papers/mixing-ptm-rademacher.pdf, 2014; Integers, 15 (2016), #A14.
  55. Hien D. Nguyen, GJ McLachlan, Progress on a Conjecture Regarding the Triangular Distribution, arXiv preprint arXiv:1607.04807, 2016
  56. Hieu D. Nguyen, Douglas Taggart, Mining the Online Encyclopedia of Integer Sequences (2013)
  57. Quynh Nguyen, Jean Pedersen, and Hien T. Vu, New Integer Sequences Arising From 3-Period Folding Numbers, Journal of Integer Sequences, #16.3.1, Vol. 19, 2016.
  58. T. Nickson, I. Potapov, Broadcasting Automata and Patterns on Z^2, arXiv preprint arXiv:1410.0573, 2014. Also in Automata, Universality, Computation; Emergence, Complexity and Computation; Volume 12, 2015, pp. 297-340; doi:10.1007/978-3-319-09039-9_14.
  59. H. Niederhausen, Catalan Traffic at the Beach, Electronic Journal of Combinatorics, Volume 9(1), 2002, article #R33.
  60. Heinrich Niederhausen, doi:10.1016/j.jspi.2005.02.013 Random walks in octants and related structures, J. Stat. Planning Inf. 135 (2005), no 1, 165-196.
  61. Heinrich Niederhausen, "A Note on the Enumeration of Diffusion Walks in the First Octant by Their Number of Contacts with the Diagonal", J. Integer Sequences, Volume 8, 2005, Article 05.4.3.
  62. Heinrich Niederhausen, Inverses of Motzkin and Schroeder Paths, arXiv:1105.3713, 2011. Also Integers: 12 (2012).
  63. Y Nikolayevsky, I Tsartsaflis, Cohomology of N-graded Lie algebras of maximal class over Z_2, arXiv preprint arXiv:1512.07676, 2015
  64. Nill, Benjamin, Volume and lattice points of reflexive simplices. Discrete Comput. Geom. 37 (2007), no. 2, 301-320.
  65. Johan Nilsson, arXiv:1001.3513 On the entropy of random Fibonacci words
  66. Johan Nilsson, arXiv:1110.4228 A space efficient algorithm for the calculation of the digit distribution in the Kolakoski sequence; J. Int. Seq. 15 (2012) #12.6.7
  67. J. Nilsson, Enumeration of basic ideals in type B, arXiv:1204.3771, 2012
  68. J. Nilsson, Letter Frequencies in the Kolakoski Sequence, Acta Physica Polonica A, 126 (2014), 549-552.
  69. J. Nilsson, On Counting the Number of Tilings of a Rectangle with Squares of Size 1 and 2, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.2.
  70. Mor Nitzan, Shmuel Nitzan, Erel Segal-Halevi, On Level-1 Consensus Ensuring Stable Social Choice, arXiv:1704.06037 [cs.GT], 2017.
  71. S. Nkonkobe, V. Murali, On Some Identities of Barred Preferential Arrangements, arXiv preprint arXiv:1503.06173, 2015
  72. Nkonkobe, S., and V. Murali. "A study of a family of generating functions of Nelsen–Schmidt type and some identities on restricted barred preferential arrangements." Discrete Mathematics, Vol. 340 (2017), 1122-1128.
  73. A. Nkwanta, Lattice paths and RNA secondary structures, in African Americans in Mathematics, ed. N. Dean, Amer. Math. Soc., 1997, pp. 137-147.
  74. Asamoah Nkwanta and Earl R. Barnes, Two Catalan-type Riordan Arrays and their Connections to the Chebyshev Polynomials of the First Kind, Journal of Integer Sequences, Article 12.3.3, 2012.
  75. A. Nkwanta, A. Tefera, Curious Relations and Identities Involving the Catalan Generating Function and Numbers, Journal of Integer Sequences, 16 (2013), #13.9.5.
  76. Laurent Noé, Spaced seed design on profile HMMs for precise HTS read-mapping efficient sliding window product on the matrix semi-group, in Rapide Bilan 2012-2013 Laurent LIFL, Université Lille 1 - INRIA Journées au vert 11 et 12 juin 2013 Laurent Année 2012-2013; PDF
  77. Tony D. Noe, On the Divisibility of Generalized Central Trinomial Coefficients, J. Integer Sequences, Volume 9, 2006, Article 06.2.7.
  78. T. D. Noe, JIS 11 (2008) 08.1.2
  79. Tony D. Noe and Jonathan Vos Post, "Primes in Fibonacci n-step and Lucas n-step Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.4.4.
  80. Diego Noja, Sergio Rolando, Simone Secchi, Standing waves for the NLS on the double-bridge graph and a rational-irrational dichotomy, arXiv:1706.09616 [math.AP], 2017.
  81. J. Noonan, The number of permutations containing exactly one increasing subsequence of length three. Discrete Math. 152 (1996), no. 1-3, 307-313.
  82. J. Noonan and D. Zeilberger, arXiv:math.CO/9806036 The Goulden-Jackson cluster method: extensions, applications and implementations
  83. J. Noonan and D. Zeilberger, The Goulden-Jackson Cluster Method: Extensions, Applications and Implementations, J. Difference Eq. Appl. 5 (1999), 355-377.
  84. ERIC NORDENSTAM AND BENJAMIN YOUNG, Correlations for the Novak process, arXiv:1201.4138, 2012
  85. S. Northshield, Stern's diatomic sequence 0, 1, 1, 2, 1, 3, 2, 3, 1, 4, ..., Amer. Math. Monthly, 117 (2010), 581-598.
  86. Sam Northshield, Three analogues of Stern's diatomic sequence, arXiv:1503.03433 [math.CO], 2015.
  87. S. Northshield, An Analogue of Stern's Sequence for Z[sqrt(2)], Journal of Integer Sequences, 18 (2015), #15.11.6.
  88. E. Norton, Symplectic Reflection Algebras in Positive Characteristic as Ore Extensions, arXiv preprint arXiv:1302.5411, 2013
  89. Eric John Leo Nöth, Analysis of grammar-based tree compression, Dissertation, Eingereicht bei der Naturwissenschaftlich-Technischen Fakultat der Universitat Siegen, Siegen 2016; http://dokumentix.ub.uni-siegen.de/opus/volltexte/2016/1019/pdf/Dissertation_Eric_John_Leo_Noeth.pdf
  90. Mathilde Noual, Dynamics of Circuits and Intersecting Circuits, in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, Lecture Notes in Computer Science, 2012, Volume 7183/2012, 433-444, doi:10.1007/978-3-642-28332-1_37, arXiv:1011.3930.
  91. Mathilde Noual and Sylvain Sene, Towards a theory of modelling with Boolean automata networks-I. Theorisation and observations, arXiv:1111.2077, 2011
  92. J. Novak, Three lectures on free probability, arXiv:1205.2097, 2012
  93. J.-C. Novelli, m-dendriform algebras, arXiv preprint arXiv:1406.1616, 2014
  94. Novelli, Jean-Christophe; Reutenauer, Christophe; Thibon, Jean-Yves Generalized descent patterns in permutations and associated Hopf algebras. European J. Combin. 32 (2011), no. 4, 618-627.
  95. J.-C. Novelli and J.-Y. Thibon, arXiv:math.CO/0405597 Free quasi-symmetric functions of arbitrary level
  96. J.-C. Novelli and J.-Y. Thibon, arXiv:math.CO/0511200 Hopf algebras and dendriform structures arising from parking functions, Fund. Math. 193 (2007), no. 3, 189-241.
  97. J.-C. Novelli and J.-Y. Thibon, arXiv:math.CO/0512570 Noncommutative Symmetric Functions and Lagrange Inversion; Advances in Applied Mathematics, Volume 40, Issue 1, January 2008, Pages 8-35.
  98. J.-C. Novelli and J.-Y. Thibon, arXiv:math.CO/0605061 Polynomial realizations of some trialgebras, Proc. Formal Power Series and Algebraic Combinatorics 2006 (San-Diego, June 2006)
  99. Jean-Christophe Novelli and Jean-Yves Thibon, A one-parameter family of dendriform identities (2007), arXiv:0709.3235.
  100. Jean-Christophe Novelli and Jean-Yves Thibon, Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions (2008); arXiv:0806.3682. Discrete Math. 310 (2010), no. 24, 3584-3606.
  101. Jean-Christophe Novelli and Jean-Yves Thibon, Superization and (q,t)-specialization in combinatorial Hopf algebras (2008); arXiv:0803.1816
  102. J.-C. Novelli and J.-Y. Thibon, Duplicial algebras and Lagrange inversion, arXiv:1209.5959, 2012
  103. J.-C. Novelli and J.-Y. Thibon, Binary shuffle bases for quasi-symmetric functions, arXiv preprint arXiv:1305.5032, 2013
  104. J.-C. Novelli, J.-Y. Thibon, Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962, 2014
  105. Jean-Christophe Novelli, Jean-Yves Thibon, On composition polynomials, arXiv:1510.03033 [math.CO], (11-October-2015)
  106. J.-C. Novelli, J.-Y. Thibon and N. M. Thiéry, Algèbres de Hopf de graphes, C.R. Acad. Sci. Paris (Comptes Rendus Mathematique), 339 (2004), 607-610.
  107. Jean-Christophe Novelli, Jean-Yves Thibon, Nicolas M. Thiéry, Hopf Algebras of Graphs (2008) arXiv:0812.3407
  108. Jean-Christophe Novelli, Jean-Yves Thibon, Frédéric Toumazet, Noncommutative Bell polynomials and the dual immaculate basis, arXiv:1705.08113 [math.CO], 2017.
  109. A. Novocin, D. Saunders, A. Stachnik, B. Youse, 3-ranks for strongly regular graphs, in Proceeding PASCO '15 Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, Pages 101-108 ACM New York, NY, USA, doi:10.1145/2790282.2790295
  110. W. G. Nowak and L. Tóth, On the average number of subgroups of the group Z_m X Z_n, arXiv preprint arXiv:1307.1414, 2013
  111. R. J. Nowakowski, G. Renault, E. Lamoureux, S. Mellon and T. Miller, The Game of timber!, http://www.labri.fr/perso/grenault/NRLMM.pdf, 2013.
  112. Marc Noy, Graph enumeration, Chapter 6 in 'Handbook of enumerative combinatorics' (2013)
  113. Marc Noy, Juanjo Rue, Counting polygon dissections in the projective plane, Advances in Applied Mathematics, Volume 41, Issue 4, October 2008, Pages 599-619.
  114. Numberphile, Can a number be boring? (feat 14972), https://www.youtube.com/watch?v=VDYzSzDaHuM, 2014.
  115. G. Nyul, G. Rácz, The r-Lah numbers, Discrete Mathematics, 338 (2015), 1660-1666.
  116. J.-P. Nzali, K. T. Porguy, H. Tapamo, Algorithme de Calcul du degré de retournement d'un graphe planaire topologique, Arima, Volume 1 - 2002.

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/wiki/CiteN"
Personal tools