This site is supported by donations to The OEIS Foundation.
CiteZ
From OeisWiki
Contents |
CiteZ
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 is one of 26 sections, which have been partitioned according to the first letter of the first author's last name.
- The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
- For further information, see the main page for Works Citing OEIS.
References
- Mike Zabrocki, The Joy of Set. To be presented at FPSAC'01 at Arizona State University in May, 2001.
- D. Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta-function. Topology 40 (2001), no. 5, 945-960.
- M. P. Zaletel and R. S. K. Mong, Exact Matrix Product States for Quantum Hall Wave Functions, Arxiv preprint arXiv:1208.4862, 2012.
- A. A. Zaslavskii, Geometry of paired comparisons, Automation and Remote Control, Volume 68, Number 3 / March, 2007.
- Thomas Zaslavsky, A new distribution problem of balls into urns and how to color a graph by different-sized sets (2006), arXiv:math/0609049.
- D. Zeilberger, 1998 Steele Prizes, Notices of the AMS, April 1998.
- D. Zeilberger, The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks, Electronic Journal of Combinatorics, Volume 8(1), 2001, article #R28.
- Doron Zeilberger, There are More Than 2**(n/17) n-Letter Ternary Square-Free Words (1998), arXiv:math/9809135.
- Doron Zeilberger, In How Many Ways Can You Reassemble Several Russian Dolls?, arXiv:0909.3453 [math.CO]
- Doron Zeilberger, Opinion 124: A Database is Worth a Thousand Mathematical Articles: An Ode to Neil Sloane's On-line Encyclopedia of Integer Sequences (OEIS), http://www.math.rutgers.edu/~zeilberg/Opinion124.html
- J. Zelinsky, "A Partial Proof of a Conjecture and Other Results", J. Integer Sequences, Volume 5, 2002, Article 02.2.8.
- Cheng Zhang and Jianpeng Ma, Counting Solutions for the N-queens and Latin Square Problems by Efficient Monte Carlo Simulations (2008); arXiv:0808.4003
- Cheng Zhang and Jianpeng Ma, doi:10.1103/PhysRevE.79.016703 Counting solutions for the N-queens and latin-square problems by Monte Carlo simulations, Phys. Rev. E 79 (2009) 016703
- Hao Zhang and Daniel Gildea, "Enumeration of Factorizable Multi-Dimensional Permutations", J. Integer Sequences, Volume 10, 2007, Article 07.5.8.
- Tianping Zhang and Yuankui Ma, "On Generalized Fibonacci Polynomials and Bernoulli Numbers", J. Integer Sequences, Volume 8, 2005, Article 05.5.3.
- X.-M. Zhang and X.-D. Zhang, Trees with given degree sequences that have minimal subtrees, Arxiv preprint arXiv:1209.0273, 2012
- X.-M. Zhang, X.-D. Zhang, D. Gray and H. Wang, Trees with the most subtrees--an algorithmic approach, arXiv preprint arXiv:1210.2871, 2012
- Ying Zhang, An elementary proof of uniqueness of Markoff numbers which are prime powers (2006), arXiv:math/0606283.
- Zhang, Ying, Congruence and uniqueness of certain Markoff numbers. Acta Arith. 128 (2007), no. 3, 295-301.
- T. Zhao, B. K. Ben Mahmoud, M. A. Toumi et al Some new properties of applied-physics related Boubaker polynomials
- Y. Zhao, doi:10.1016/j.jnt.2009.11.005 Constructing MSTD sets using bidirectional ballot sequences, J. Numb. Theory 130 (50 (2010) 1212-1220
- Frank Zielen, Rigorose und perturbative Konstruktion von phi^4-Trajektorien, (1998) MSc Thesis, Inst. f. Theoretische Physik, Westf. Wilhelms-Uni. Münster
- Robert M. Ziff, "On Cardy's formula for the critical crossing probability in 2d percolation," J. Phys. A. 28, 1249-1255 (1995).
- P. Zimmermann, Gaia: a package for the random generation of combinatorial structures, Maple Technical Newsletter vol. 1 nb. 1.
- P. Zimmermann, Introduction to Automatic Analysis, http://www.stat.purdue.edu/~mdw/ChapterIntroductions/AutomaticAnalysisZimmermann.pdf, 2012
- E. Ziv, R. Koytcheff, M. Middendorf and C. Wiggins, doi:10.1103/PhysRevE.71.0161100 Systematic identification of statistically significant network measures, Phys. Rev. E 71 (2005) 0161100
- M. Zivkovic, arXiv:math.CO/0511636 Classification of small (0,1) matrices, Linear Algebra and its Applications, 414 (2006), 310-346.
- W. Zudilin, A generating function of the squares of Legendre polynomials, arXiv preprint arXiv:1210.2493, 2012
- Michael Zuker and David Sankoff, RNA secondary structures and their prediction, Bulletin of Mathematical Biology, Volume 46, Issue 4, 1984, Pages 591-621.
- Roland Zumkeller, doi:10.1007/11814771_35 Formal Global Optimisation with Taylor Models], Lect. Notes Comp. Sci. (LNCS) 4130 (2006) 408-422.
- K. T. Zwierzynski, Generating Integral Graphs Using PRACE Research Infrastructure, Partnership for Advanced Computing in Europe, 2013; http://www.prace-ri.eu/IMG/pdf/wp58_generating_integral_graphs_using_the_prace_research_infrastructure.pdf
- Daniel Zwillinger, Editor in Chief, CRC Standard Mathematical Tables and Formulae, 31st Edition, Chapman & Hall / CRC Press, Boca Raton, 2003. See especially 1.2.14 Integer Sequences, 25-31, & 807, 817. See also later editions.
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 is one of 26 sections, which have been partitioned according to the first letter of the first author's last name.
- The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
- For further information, see the main page for Works Citing OEIS.
