This site is supported by donations to The OEIS Foundation.
CiteW
From OeisWiki
Contents |
CiteW
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
- Carl G. Wagner, "Partition Statistics and q-Bell Numbers (q = -1)", J. Integer Sequences, Volume 7, 2004, Article 04.1.1.
- S. Wagner, Graph-theoretical enumeration and digital expansions: an analytic approach, Dissertation, Fakult. f. Tech. Math. u. Tech. Physik, Tech. Univ. Graz, Austria, Feb., 2006.
- STEPHAN WAGNER, ENUMERATION OF HIGHLY BALANCED TREES, http://www.cs.sun.ac.za/~swagner/balanced.pdf
- S. Wagner, Asymptotic enumeration of extensional acyclic digraphs, in Proceedings of the SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO12); http://siam.omnibooksonline.com/2012ANALCO/data/papers/001.pdf
- S. G. Wagner, An identity for the cycle indices of rooted tree automorphism groups, Elec. J. Combinat., 13 (2006), #R00.
- M. Waldschmidt, Lectures on Multiple Zeta Values (IMSC 2011), http://www.math.jussieu.fr/~miw/articles/pdf/MZV2011IMSc.pdf
- Ian Walker, Explorations in Recursion with John Pell and the Pell Sequence, http://www.mth.pdx.edu/~caughman/Ian%20Walker%20501.pdf.
- Robert Walker, Similar Sloth Canon Number Sequences
- James Wan arXiv:1101.1132 Moments of products of elliptic integrals.
- Chao-Jen Wang, Applications of the Goulden-Jackson cluster method to counting Dyck paths by occurrences of subwords, http://people.brandeis.edu/~gessel/homepage/students/wangthesis.pdf.
- Wang, Weiping; Wang, Tianming, Matrices related to the Bell polynomials. Linear Algebra Appl. 422 (2007), no. 1, 139-154.
- Wang, Weiping; Wang, Tianming Matrices related to the idempotent numbers and the numbers of planted forests. Ars Combin. 98 (2011), 83-96.
- Zilong Wang and Guang Gong, New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts (2008) arXiv:0812.4487
- Zuoqin Wang, The twisted Mellin transform (2007), arXiv:0706.2642.
- Wanless, Ian M., Permanents of matrices of signed ones. Linear Multilinear Algebra 53 (2005), no. 6, 427-433.
- I. M. Wanless, A computer enumeration of small latin trades, Australas. J. Combin. 39, (2007) 247-258.
- Stefan de Wannemacker, Thomas Laffey and Robert Osburn, On a conjecture of Wilf (2006), arXiv:math/0608085.
- Wayne State University, College of Engineering, "COE YouTube channel reaches 2,000-view milestone", http://engineering.wayne.edu/news.php?id=7547
- A. Weingartner, On the Solutions of sigma(n) = sigma(n+k), Journal of Integer Sequences, Vol. 14 (2011), #11.5.5.
- F. V. Weinstein, Notes on Fibonacci Partitions (2003), arXiv:math/0307150.
- E. W. Weisstein, CRC Concise Encyclopedia of Mathematics. Boca Raton, FL: CRC Press, 1998. ISBN 0849396409.
- E. W. Weisstein's World of Mathematics.
- T. Weist, On the Euler characteristic of Kronecker moduli spaces, Arxiv preprint arXiv:1203.2740, 2012
- M. Werner, An Algorithmic Approach for the Zarankiewicz Problem, http://tubafun.bplaced.net/public/zarankiewicz_paper_presentation.pdf, 2012.
- Andrew West, Bound Optimization for Parallel Quadratic Sieving Using Large Prime Variations (A126726)
- Julian West, Sorting twice through a stack, Theoretical Computer Science, Volume 117, Issues 1-2, 30 August 1993, Pages 303-313.
- J. West, Permutation trees and the Catalan and Schroeder numbers, Discrete Math., 146: 247-262 (1995).
- Bruce W. Westbury, Invariant tensors for the spin representation of so(7) (2006), arXiv:math/0601209.
- Tad White, Counting free Abelian actions, arXiv:1304.2830
- Earl Glen Whitehead Jr., Stirling number identities from chromatic polynomials, Journal of Combinatorial Theory, Series A, Volume 24, Issue 3, May 1978, Pages 314-317.
- Ward. O. Whitt, Weirdness in CTMC's, Notes for Course IEOR 6711: Stochastic Models I, http://www.columbia.edu/~ww2040/6711F12/lect1129.pdf, 2012.
- Robin W. Whitty, Rook polynomials on two-dimensional surfaces and graceful labellings of graphs, Discrete Mathematics, Volume 308, Issues 5-6, 28 March 2008, Pages 674-683.
- Thomas Wieder, The number of certain k-combinations of a n-set, Applied Mathematics Electronic Notes, vol. 7 (2007), 45-52.
- Thomas Wieder, The number of certain rankings and hierarchies formed from labeled or unlabeled elements and sets, Appl. Math. Sci., vol. 3(55) (2009), 2707-2724.
- Thomas Wieder, doi:10.3968/j.pam.1925252820110201.010 Generation of All Possible Multiselections from a Multiset, Progress in Applied Mathematics, 2(1) (2011), 61-66.
- Thomas Wieder, The Debye scattering formula in n dimensions, Journal of Mathematical and Computational Science, vol. 2 no. 4 (2012), 1086-1090.
- Wikipedia, Dynamic Programming
- Wildforests, "Cicada", http://wiki.wildforests.co/topic/Cicada, See Footnote 15; visited Dec. 2012.
- D. Jacob Wildstrom, doi:10.1016/j.laa.2010.03.028 Dynamic resource location with tropical algebra, Lin. Alg. Applic. (2011) (in press)
- D. J. Wildstrom, Structural Qualities and Serial Construction of Tournament Braids, in Bridges 2012: Mathematics, Music, Art, Architecture, Culture; http://bridgesmathart.org/2012/cdrom/proceedings/98/paper_98.pdf
- Herbert S. Wilf, The Redheffer matrix of a partially ordered set, The Electronic Journal of Combinatorics, Volume 11(2), 2004, R#10.
- Herbert S. Wilf, Mathematics: An Experimental Science, 2005, Draft of a chapter for the forthcoming volume "The Princeton Companion to Mathematics," edited by Tim Gowers.
- Hugh Williams, R. K. Guy, doi:10.1142/S1793042111004587 Some fourth-order linear divisibility sequences, Intl. J. Number Theory vol. 7 (5) (2011) 1255-1277
- N. Williams, On Eliminating Square Paths in a Square Lattice, Master's Thesis, Rice University, 2000.
- Ryan Williams, Applying Practice to Theory (2008) arXiv:0811.1305
- David W. Wilson, "The Fifth Taxicab Number is 48988659276962496", J. Integer Sequences, Volume 2, 1999, Article 99.1.9.
- David Kofoed Wind, CONNECTED GRAPHS WITH FEWEST SPANNING TREES, BACHELOR THESIS, SPRING 2011, http://www.student.dtu.dk/~s082951/publications/thesis.pdf
- R. Winkel, An exponential formula for polynomial vector fields II. Lie series, exponential substitution and rooted trees. Adv. Math. 147 (1999), no. 2, 260-303.
- M. Winkler, On a stopping time algorithm of the 3n+ 1 function, http://mike-winkler.net/collatz_algorithm.pdf.
- J. Winter, M. M. Bonsangue and J. J. M. M. Rutten, Context-free coalgebras, 2013; http://oai.cwi.nl/oai/asset/21313/21313A.pdf
- H. M. Wiseman and J. Eisert, Nontrivial quantum effects in biology: A skeptical physicists' view (2007), arXiv:0705.1232.
- R. Witula, Ramanujan type trigonometric formulae, DEMONSTRATIO MATHEMATICA, Vol. XLV, No. 4, 2012, pp. 789-796; http://www.mini.pw.edu.pl/~demmath/archive/dm45_4/galleys/3.pdf
- Roman Witua and Damian Sota, "Quasi-Fibonacci Numbers of Order 11", J. Integer Sequences, Volume 10, 2007, Article 07.8.5.
- Roman Witua and Damian Sota, "New Ramanujan-Type Formulas and Quasi-Fibonacci Numbers of Order 7", J. Integer Sequences, Volume 10, 2007, Article 07.5.6.
- Roman Witua, Damian Sota and Adam Warzyski, "Quasi-Fibonacci Numbers of the Seventh Order", J. Integer Sequences, Volume 9, 2006, Article 06.4.3.
- Wen-Jin Woan, "Hankel Matrices and Lattice Paths", J. Integer Sequences, Volume 4, 2001, Article 01.1.2.
- Wen-jin Woan, "A Recursive Relation for Weighted Motzkin Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.1.6.
- Wen-jin Woan, "Animals And 2-Motzkin Paths", J. Integer Sequences, Volume 8, 2005, Article 05.5.6.
- Wen-jin Woan, "A Relation Between Restricted and Unrestricted Weighted Motzkin Paths", J. Integer Sequences, Volume 9, 2006, Article 06.1.7.
- Wen-jin Woan and Barbara Tankersley, "Exponential Generating Functions for Trees with Weighted Edges and Labeled Nodes", J. Integer Sequences, Volume 10, 2007, Article 07.8.4.
- J. Wodlinger, COSTAS ARRAYS, GOLOMB RULERS AND WAVELENGTH ISOLATION SEQUENCE PAIRS, M.S. Dissertation, Math. Dept., Simon Fraser University, Spring 2012; http://people.math.sfu.ca/~jed/Papers/Jane%20Wodlinger.%20Master's%20Thesis.%202012.pdf.
- Wójtowicz, Marek, Robin's inequality and the Riemann hypothesis. Proc. Japan Acad. Ser. A Math. Sci. 83 (2007), no. 4, 47-49.
- WolframAlpha, Timeline of Systematic Data and the Development of Computable Knowledge (see 1973).
- Elisabeth Wong, Brittany Baur, Saad Quader and Chun-Hsi Huang, Biological network motif detection: principles and practice, Briefings in Bioinformatics, 2011, doi:10.1093/bib/bbr033.
- Roger Woodford, "Bounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers", J. Integer Sequences, Volume 10, 2007, Article 07.1.3.
- E. Wulcan, Pattern avoidance in involutions (Masters thesis) (ps, pdf).
- B. G. Wybourne, Admissible partitions and the expansion of the square of the Vandermonde determinant in N variables, 2003.
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.
