This site is supported by donations to The OEIS Foundation.

CiteY

From OeisWiki
Jump to: navigation, search


"Our enumerative results establish further connections to the OEIS sequences and some classical combinatorial objects, such as restricted permutations, weighted ordered trees and set partitions. ... The On-Line Encyclopedia of Integer Sequences created by Neil Sloane is very helpful in this research.''" [Chunyan Yan and Zhicong Lin, 2019]

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 Y.
  • 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. Anila Yadavalli, Quadrant marked mesh patterns in words, Undergraduate Thesis, UCSD, 2012, PDF
  2. Tülay Yağmur, On Leonardo quaternions, Aksaray Üniversitesi (Turkey 2021). Abstract
  3. Tülay Yaǧmur, On Gaussian Leonardo Hybrid Polynomials, Symmetry (2023) Vol. 15, No. 7, 1422. doi:10.3390/sym15071422 (A001595)
  4. A. Yajima, How to calculate the number of stereoisomers of inositol-homologs, Bull. Chem. Soc. Jpn. 2014, 87, 1260-1264 doi:10.1246/bcsj.20140204
  5. S. Yakoubov, Pattern Avoidance in Extensions of Comb-Like Posets, arXiv preprint arXiv:1310.2979, 2013
  6. Yu. Yakubovich, Integer partitions with fixed subsums, Elect. J. Combinatorics 12 (2005) N7.
  7. Y. Yakubovich, Ergodicity of multiplicative statistics, Journal of Combinatorial Theory, Series A 119 (2012) 1250-1279.
  8. Seda Yamaç Akbiyik, On the nickel Fibonacci numbers, Abstract Book II, Int'l Conf. Math. Appl. Sci. Eng. (ICMASE 2021), see p. 160. PDF
  9. Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa, Ladder-Lottery Realization, 30th Canadian Conference on Computational Geometry (CCCG 2018) Winnipeg. PDF (A006245)
  10. Katsuhisa Yamanaka, Takashi Horiyama, and Kunihiro Wasa, Optimal Reconfiguration of Optimal Ladder Lotteries, Theoretical Computer Science (2021) Vol. 859, 57-69. doi:10.1016/j.tcs.2021.01.009
  11. Katsuhisa Yamanaka and Shin-ichi Nakano, Enumeration, Counting, and Random Generation of Ladder Lotteries, IEICE Transactions on Information and Systems, Vol. E100.D (2017) No. 3 pp. 444-451. doi:10.1587/transinf.2016FCP0015
  12. K. Yamanaka, S.-i. Nakano, Y. Matsui, R. Uehara, K. Nakada, doi:10.1016/j.tcs.2010.01.002, Efficient enumeration of all ladder lotteries and its application, Theor. Comp. Sci. 411 (2010) 1714-1722.
  13. Kazuaki Yamazaki, Mengze Qian, and Ryuhei Uehara, Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs, Disc. Appl. Math. (2024) Vol. 342, 190-199. doi:10.1016/j.dam.2023.09.002
  14. Chunyan Yan, Zhicong Lin, Inversion sequences avoiding pairs of patterns, arXiv:1912.03674 [math.CO], 2019. (A000027, A000045, A000071, A000079, A000108, A000110, A000124, A000325, A001519, A006318, A026898, A034943, A047970, A074664, A086211, A088921, A106228, A117106, A212198, A279555, A279559, A279561, A279564, A279566, A279573) Our enumerative results establish further connections to the OEIS sequences and some classical combinatorial objects, such as restricted permutations, weighted ordered trees and set partitions. The On-Line Encyclopedia of Integer Sequences created by Neil Sloane is very helpful in this research.
  15. Jun Yan, Results on pattern avoidance in parking functions, arXiv:2404.07958 [math.CO], 2024. (A000012, A000217, A000254, A000255, A000262, A001003, A001045, A001333, A001339, A001710, A001764, A001906, A002627, A003168, A003319, A005408, A007489, A007680, A034015, A038507, A051296, A059171, A065475, A070960, A088368, A088716, A105163, A109081, A122553, A132624, A136128, A243675, A243676, A243677, A243678, A243679, A243682, A243683, A243693, A243694, A243695, A243696, A243697, A243698, A243699, A338112, A362744, A364922, A371398)
  16. Sherry H. F. Yan, "From (2,3)-Motzkin Paths to Schröder Paths", J. Integer Sequences, Volume 10, 2007, Article 07.9.1.
  17. Sherry H. F. Yan, Schroeder Paths and Pattern Avoiding Partitions], arXiv:0805.2465 [math.CO]
  18. Yan, Sherry H. F. doi:10.1016/j.ejc.2013.12.007 Ascent sequences and 3-nonnesting set partitions. Eur. J. Comb. 39, 80-94 (2014)
  19. Sherry H.F. Yan, Xuezi Liu, 2-noncrossing trees and 5-ary trees, Discrete Mathematics, 309 (20) (2009) 6135-6138 doi:10.1016/j.disc.2009.03.044
  20. Yan, Sherry H., Qin, G., Jin, Z., & Zhou, R. D. (2017). On (2k+ 1, 2k+ 3)-core partitions with distinct parts. Discrete Mathematics, 340(6), 1191-1202.
  21. T. Yanagita, T. Ichinomiya, Thermodynamic Characterization of Synchronization-Optimized Oscillator-Networks, arXiv preprint arXiv:1409.1979, 2014.
  22. Lin Yang, Yu-Yuan Zhang, and Sheng-Liang Yang, Enumeration of the Motzkin paths above a line of rational slope, Disc. Math. (2024) Vol. 347, Issue 7, 114013. doi:https://doi.org/10.1016/j.disc.2024.114013 (A001006, A006605)
  23. Hengjie Yang and Richard D. Wesel, Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback, arXiv:2307.14507 [cs.IT], 2023. (A065442)
  24. Lin Yang, Feng-Yun Ren, and Sheng-Liang Yang, Some refined enumerations of hybrid binary trees, Indian J Pure Appl Math (2022). doi:10.1007/s13226-022-00350-6
  25. Lin Yang and Shengliang Yang, Protected Branches in Ordered Trees, J. Math. Study (2023) Vol. 56, No. 1, 1-17. doi:10.4208/jms.v56n1.23.01 (A001700, A002694, A051924, A076540, A091187, A091894, A097613, A119308, A127531)
  26. Lin Yang, Yu-Yuan Zhang, and Sheng-Liang Yang, The halves of Delannoy matrix and Chung-Feller properties of the m-Schröder paths, Linear Alg. Appl. (2024). doi:10.1016/j.laa.2023.12.021 (A001850, A006318, A026000, A026001, A144097, A260332, A331329, A363006, A341491)
  27. Jane Y. X. Yang, Combinatorial proofs and generalizations on conjectures related with Euler's partition theorem, arXiv:1801.06815 [math.CO], 2018. (A034296, A090867)
  28. Yang, Joyce C.; Pippenger, Nicholas doi:10.1090/bproc/27 On the enumeration of interval graphs</a> Proc. Am. Math. Soc., Ser. B 4, 1-3 (2017).
  29. J. Y. X. Yang, M. X. X. Zhong, R. D. P. Zhou, On the Enumeration of (s, s+ 1, s+2)-Core Partitions, arXiv preprint arXiv:1406.2583, 2014
  30. J. Z. Yang, Graphical Numerical Inference (a.k.a. Brain Surgery for Excel), PDF, 2012.
  31. Jizhen Yang, Zhizheng Zhang, Some identities of the generalized Fibonacci and Lucas sequences, Applied Mathematics and Computation (2018) Vol. 339, Pages 451-458. doi:10.1016/j.amc.2018.07.054
  32. Lin Yang and Sheng-Liang Yang, The parametric Pascal rhombus. Fib. Q., 57:4 (2019), 337-346.
  33. Lin Yang and Sheng-Liang Yang, A Chung–Feller property for the generalized Schröder paths, Discrete Mathematics (2020) Vol. 343, Issue 5, 111826. doi:10.1016/j.disc.2020.111826
  34. Lin Yang and Sheng-Liang Yang, Weakly Protected Points in Ordered Trees, Graphs and Combinatorics (2021) Vol. 37, 775–788. doi:10.1007/s00373-021-02278-w
  35. Lin Yang and Sheng-Liang Yang, Riordan arrays, Łukasiewicz paths and Narayana polynomials, Linear Algebra and its Applications (2021) Vol. 622, 1-18. doi:10.1016/j.laa.2021.03.012
  36. Lin Yang and Sheng-Liang Yang, Enumeration of Lattice paths with infinite types of steps and the Chung-Feller property, Disc. Math. (2021) Vol. 344, Issue 8, 112452. doi:10.1016/j.disc.2021.112452
  37. Lin Yang and Sheng-Liang Yang, Combinatorial matrices derived from generalized Motzkin paths, Indian J. Pure Appl. Math. (2021) Vol. 52, 599–613. doi:10.1007/s13226-021-00096-7
  38. Lin Yang, Sheng-Liang Yang, and Tian-Xiao He, Generalized Schröder matrices arising from enumeration of lattice paths, Czechoslovak Mathematical Journal (2019), 1-23. doi:10.21136/CMJ.2019.0348-18
  39. Mingjia Yang and Doron Zeilberger, Increasing Consecutive Patterns in Words. arXiv:1805.06077 [math.CO], 2018. (A049774, A117158, A177523, A177533, A177553, A177555, A177558, A177564, A177574, A177594, A177596, A177599, A177605, A177615, A177635, A177637, A177640, A177646, A177656, A177676, A230051, A230231)
  40. Mingjia Yang and Doron Zeilberger, Systematic Counting of Restricted Partitions, arXiv:1910.08989 [math.CO], 2019. See also Integers (2020) Vol. 20, #A62. PDF (A000009, A000041, A000726, A001935, A003114, A035957, A070047, A116931)
  41. Mingjia Yang, An experimental walk in patterns, partitions, and words, Ph. D. Dissertation, Rutgers University (2020). doi:10.7282/t3-d9z1-aw94 (A000041, A001212, A117158, A177523, A177533, A177553, A177555, A177558, A177564, A177574, A177594, A177596, A177599, A177605, A177615, A177635, A177637, A177640, A177646, A177656, A177676, A230051, A230231)
  42. Yang, Sheng-Liang, Yan-Ni Dong, and Tian-Xiao He. "Some matrix identities on colored Motzkin paths." Discrete Mathematics 340.12 (2017): 3081-3091.
  43. Sheng-Liang Yang, Yan-Ni Dong, Tian-Xiao He, Yan-Xue Xu, A unified approach for the Catalan matrices by using Riordan arrays, Linear Algebra and its Applications (2018) Vol. 558, 25-43. doi:10.1016/j.laa.2018.07.037
  44. Sheng-Liang Yang and Yuan-Yuan Gao, The Pascal rhombus and Riordan arrays, Fib. Q., 56:4 (2018), 337-347.
  45. Sheng-liang Yang and Mei-yang Jiang, Pattern avoiding problems on the hybrid d-trees, J. Lanzhou Univ. Tech., (China, 2023) Vol. 49, No. 2, 144-150. (in Mandarin) Abstract (A000027, A000045, A006318, A007863, A027307, A118969, A144079, A215654, A233832, A234505, A239107, A239108, A260332)
  46. Sheng-Liang Yang, LJ Wang, Taylor expansions for the m-Catalan numbers, AUSTRALASIAN JOURNAL OF COMBINATORICS, Volume 64(3) (2016), Pages 420–431.
  47. Shichun Yang, Alain Togbé, On the estimates of the upper and lower bounds of Ramanujan primes, The Ramanujan Journal, 40 (2) (2016) 245-255 doi:10.1007/s11139-015-9706-8
  48. Shiyun Yang, Algorithms for fast linear system solving and rank profile computation, Thesis, Computer Science, Waterloo, 2014; PDF
  49. Yang, Winston C. Derivatives are essentially integer partitions. Discrete Math. 222 (2000), no. 1-3, 235-245.
  50. Sheng-Liang Yang and Mei-yang Jiang, The m-Schröder paths and m-Schröder numbers, Disc. Math. (2021) Vol. 344, Issue 2, 112209. doi:10.1016/j.disc.2020.112209
  51. Yongzhi Yang and Johann Leida, Pascal decompositions of geometric arrays in matrices, Fib. Quart. 42 (No. 3, 2004), 205-215.
  52. Yutong Yang, From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers, (2017), Honors College Capstone and Theses, 13.
  53. F. Yano and H. Yoshida, Some set partition statistics in non-crossing partitions and generating functions, Discr. Math., 307 (2007), 3147-3160.
  54. Bowen Yao, A Note on Fraction Decompositions of Integers, American Mathematical Monthly (2020) Vol. 127, Issue 10, 928-932. doi:10.1080/00029890.2020.1815481 (A000058)
  55. Yukun Yao, Doron Zeilberger, An Experimental Mathematics Approach to the Area Statistic of Parking Functions, arXiv:1806.02680 [math.CO], 2018. (A000435)
  56. Yukun Yao and Doron Zeilberger, <a href="http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/peaceable.pdf">Numerical and Symbolic Studies of the Peaceable Queens Problem</a>, Feb 14, 2019, see also arXiv:1902.05886 (A250000)
  57. Kai Ting Keshia Yap, David Wehlau, Imed Zaguia, Permutations Avoiding Certain Partially-ordered Patterns, arXiv:2101.12061 [math.CO], 2021. (A025192, A045925, A084509, A111281, A214663, A232164)
  58. D. Yaqubi, M. Farrokhi, D. G. H. Gahsemian Zoeram, Lattice paths inside a table, I. arXiv:1612.08697 (2016)
  59. Danile Yaqubi, Madjid Mirzavaziri, Yasin Saeednezhad, Mixed r-stirling numbers of the second king arXiv:1412.6239 (2019)
  60. Daniel Yaqubi, Toufik Mansour, Madjid Mirzvaziri, The twelvefold way, the nonintersecting circles problem, and partitions of multisets, Turkish Journal of Mathematics (2019) Vol. 43, 765–782. doi:10.3906/mat-1805-72
  61. Aleksandr Yaroslavskiy, Central Limit Theorems for Tableaux Related to the Partially Asymmetric Simple Exclusion Process, Ph. D. Thesis, Drexel University (2020). Preview
  62. O. Yayenie, A note on generalized Fibonacci sequences, Appl. Math. Comput. 217 (2011) 5603-5611 doi:10.1016/j.amc.2010.12.038
  63. Yazdi, S. M. Hossein Tabatabaei; Savari, Serap A. On the relationships among optimal symmetric fix-free codes. IEEE Trans. Inform. Theory 60 (2014), no. 8, 4567-4583.
  64. James M. Yearsley, The propagator for the step potential and delta function potential using the path decomposition expansion, arXiv:0804.2391 [quant-ph]
  65. James M Yearsley, Aspects of Time in Quantum Theory, arXiv:1110.5790 [quant-ph]
  66. Yeats, Karen Rearranging Dyson-Schwinger equations. With a foreword by Dirk Kreimer. Mem. Amer. Math. Soc. 211 (2011), no. 995, x+82 pp. ISBN: 978-0-8218-5306-1
  67. Karen Yeats, A study on prefixes of c_2 invariants. arXiv:1805.11735 [math.CO], 2018. (A000110)
  68. Damir Yeliussizov, Bounds on the number of higher-dimensional partitions, arXiv:2302.04799 [math.CO], 2023. (A000293, A000294)
  69. Joseph D. Yelk, Molecular Dynamics Investigations of Duplex Columnar Liquid Crystal Phases of Nucleoside Triphosphates, Ph. D. thesis, Northwestern University (2008). PDF (A051437)
  70. D. Yeliussizov, Permutation Statistics on Multisets, Ph.D. Dissertation, Computer Science, Kazakh-British Technical University, 2012; PDF
  71. Yen, Lily, Arc-coloured permutations PSAC 2012 (Paris, June 23-28, 2013) Proc. DMTCS (2013) 743-754
  72. Lily Yen, A Bijection for Crossings and Nestings, arXiv preprint arXiv:1209.3082, 2012
  73. Lily Yen, Crossings and Nestings for Arc-Coloured Permutations and Automation, Electronic Journal of Combinatorics, 22(1) (2015), #P1.14
  74. Oleksandra Yezerska, Sergiy Butenko, The Maximum Clique and Vertex Coloring, Handbook of Heuristics. Springer, Cham, 2018, 1-31. doi:10.1007/978-3-319-07153-4_47-1 (A265032)
  75. T. Yi, A Tree in a Brain Tumor, Proceedings Thirty-fourth Annual Meeting, Florida Section, Mathematical Association of America.
  76. V. Yildiz, General combinatorical structure of truth tables of bracketed formulae connected by implication, Arxiv preprint arXiv:1205.5595, 2012.
  77. Volkan Yildiz, Some divisibility properties of Jacobsthal numbers, arXiv:2212.08814 [math.CO], 2022. (A014551, A345963)
  78. Çiğdem Zeynep Yılmaz and Gülsüm Yeliz Sentürk, On some identities for DGC Leonardo-like sequence, Yildiz Tech. Univ. (Turkey, 2023). Abstract
  79. Fatih Yılmaz and Mustafa Özkan, On the Generalized Gaussian Fibonacci Numbers and Horadam Hybrid Numbers: A Unified Approach, Axioms (2022) Vol. 11, No. 6, 255. doi:10.3390/axioms11060255 (A000032, A000045, A000129, A001045, A002203, A006130, A006190, A006497, A014551, A075118)
  80. Yasar Yilmaz Atas, Quelques aspects du chaos quantique dans les systems de N-corps en interaction chaines des spins quantiques et matrice aleatoires, Phd Thesis, Universite Paris-Sud (2014), page 19.
  81. Chris Ying, Enumerating Unique Computational Graphs via an Iterative Graph Invariant, arXiv:1902.06192 [cs.DM], 2019. (A000088, A003024, A057500, A240955)
  82. Martha Yip, Rook Placements and Jordan Forms of Upper-Triangular Nilpotent Matrices, arXiv:1703.00057 [math.CO], 2017; The Electronic Journal of Combinatorics 25(1) (2018), #P1.68. (A009766)
  83. Anssi Yli-Jyra, On Dependency Analysis via Contractions and Weighted FSTs, in "Shall We Play the Festschrift Game?", Springer, 2012, pp. 133-158; doi:10.1007/978-3-642-30773-7_10
  84. Anssi Yli-Jyrä, Transition-Based Coding and Formal Language Theory for Ordered Digraphs, Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, Association for Computational Linguistics (Dresden, Germany 2019), 118-131. doi:10.18653/v1/W19-3115 (seq) Hoppe and Petrone have exhaustively enumerated all simple, connected graphs of a finite order and computed a selection of invariants over the sets in order to discover and add 141 new integer sequences to the Online Encyclopedia of Integer Sequences (OEIS)
  85. Anssi Yli-Jyrä and Carlos Gómez-Rodríguez, Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing, arXiv:1706.03357 [cs.CL], 2017.
  86. Emre Yolcu, Xinyu Wu, Marijn J. H. Heule, Mycielski graphs and PR proofs, Carnegie Mellon University (2020). PDF (A122695)
  87. Alexander Yong, The Joseph Greenberg problem: combinatorics and comparative linguistics, arXiv preprint arXiv:1309.5883, 2013.
  88. Soowhan Yoon, Analytic connection between Fibonacci sequence and diagonal sums of binomial coefficients, (2020). Abstract (A000032)
  89. K. Yordzhev, Fibonacci sequence related to a combinatorial problem on binary matrices, arXiv preprint arXiv:1305.6790, 2013.
  90. K. Yordzhev, On an Algorithm for Isomorphism-Free Generations of Combinatorial Objects, International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), Web Site: www.ijettcs.org, Volume 2, Issue 6, November - December 2013, ISSN 2278-6856
  91. K. Yordzhev, Semi-canonical binary matrices, arXiv preprint arXiv:1506.04642, 2015.
  92. Krasimir Yordzhev, The bitwise operations in relation to obtaining Latin squares, arXiv preprint arXiv:1605.07171, 2016.
  93. Krasimir Yordzhev, On the Concept of Bitwise Operations in the Programming Courses, Mathematics and Informatics (Математика и информатика, Национално издателство за образование и наука „Аз-буки“, 2019) Vol. 62, Issue 3, 325-339. Abstract
  94. Brent A. Yorgey, DISCO: A Functional Programming Language for Discrete Mathematics, Hendrix College (2022). PDF (A000108) The oeis module is inessential, but can be a fun way for students to explore integer sequences and the OEIS
  95. Na You, Chang Xuan Mao, On hierarchical loglinear models in capturerecapture studies, Computational Statistics & Data Analysis 53 (12) (2009) 3916-3920 doi:10.1016/j.csda.2009.04.022
  96. Xu You, Di-Rong Chen, Improved continued fraction sequence convergent to the Somos' quadratic recurrence constant, Mathematical Analysis and Applications, Volume 436, Issue 1, 1 April 2016, Pages 513–520
  97. Xu You, Shouyou Huang, D-irong Chen, Some new continued fraction sequence convergent to the Somos quadratic recurrence constant, J. Ineq. Applic. 2016 # 91 doi:10.1186/s13660-016-1035-y
  98. Donovan Young, The Number of Domino Matchings in the Game of Memory, J. Int. Seq., Vol. 21 (2018), Article 18.8.1. HTML (A000045, A001883, A046741, A079267, A178523, A265167, A318243, A318244, A318267, A318268, A318269, A318270)
  99. Donovan Young, Generating Functions for Domino Matchings in the 2 × k Game of Memory, J. Int. Seq., Vol. 22 (2019), Article 19.8.7. Abstract (A000045, A001883, A046741, A055140, A079267, A178523, A265167, A318243, A318244, A318267, A318268, A318269, A318270, A325753, A325754)
  100. Donovan Young, Linear k-Chord Diagrams, J. Int. Seq., Vol. 23 (2020), Article 20.9.1. HTML ((A000806, A062993, A091320, A334056, A334057, A334058, A334059, A334060, A334061, A334062, A334063)
  101. Donovan Young, Counting Bubbles in Linear Chord Diagrams, arXiv:2311.01569 [math.CO], 2023. (A367000)
  102. Paul Thomas Young, From Madhava–Leibniz to Lehmer's Limit, Amer. Math. Monthly (2022). doi:10.1080/00029890.2022.2051405
  103. G. S. Yovanof, H. Taylor, doi:10.1016/S0898-1221(00)00105-X B2-sequences and the distinct distance constant, Computers & Mathematics with Applications, Volume 39, Issue 11, June 2000, Pages 37-42.
  104. Feng Yu, A cohomological gravity in D=11, Int'l J. of Mod. Phys. A (2020) Vol. 35, No. 29, 2050181. doi:10.1142/S0217751X2050181X
  105. Han Yu, Fractal projections with an application in number theory, arXiv:2004.05924 [math.NT], 2020. (A030979)
  106. Shaoxiong (Steven) Yuan, Generalized Identities of Certain Continued Fractions, arXiv:1907.12459 [math.NT], 2019. (A001076, A049666, A049669, A104449, A169985, A305413)
  107. Fumitaka Yura, Hankel Determinant Solution for Elliptic Sequence, arXiv preprint arXiv:1411.6972, 2014
  108. A. A. Yurchenko, M. A. Antyukhova and P. N. Vorontsov-Velyaminov, Study of the polymer interaction with a surface by entropic sampling, JOURNAL OF STRUCTURAL CHEMISTRY, Volume 52, Number 6 (2011), 1179-1186, doi:10.1134/S0022476611060254
  109. A. V. Yurkin, On similarity of systems of geometrical and arithmetic triangles, in Mathematics, Computing, Education Conference XIX, 2012. http://www.mce.biophys.msu.ru/eng/archive/abstracts/mce19/sect1138/doc150220/
  110. A. V. Yurkin, New view on the diffraction discovered by Grimaldi and Gaussian beams, arXiv preprint arXiv:1302.6287, 2013
  111. A. V. Yurkin, About the evident description of distribution of beams and "wavy geometrical trajectories" in long thin pipes, http://www.mce.biophys.msu.ru/eng/archive/abstracts/mce22/sect1138/doc216454/, 2014 (original in Russian)
  112. A. V. Yurkin, Symmetric triangle of Pascal and non-linear arithmetic parallelepiped, Book Manuscript, 2015; https://www.researchgate.net/profile/Alexander_Yurkin/publication/274072415_Symmetric_triangle_of_Pascal_and_arithmetic_parallelepiped_On_possibility_of_new_evident_geometrical_interpretation_of_processes_in_long_pipes/links/55143cf50cf23203199d19b3.pdf
  113. Raphael Yuster, Vector clique decompositions, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2019), 1221-1238. doi:10.1137/1.9781611975482.75 (A051337)
  114. Raphael Yuster, Almost k-union closed set systems, arXiv:2302.12276 [math.CO], 2023. (A108267)
  115. Raphael Yuster, On tournament inversion, arXiv:2312.01910 [math.CO], 2023. (A000568)

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=CiteY&oldid=1659345"