This site is supported by donations to The OEIS Foundation.

CiteI

From OeisWiki
Jump to: navigation, search


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 I.
  • 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. Ionut E. Iacob, T. Bruce McLean and Hua Wang, The V-flex, Triangle Orientation, and Catalan Numbers in Hexaflexagons, The College Mathematics Journal, Vol. 43, No. 1 (January 2012), pp. 6-10.
  2. Kittitat Iamthong, Ji-Hwan Jung, Sergey Kitaev, Encoding labelled p-Riordan graphs by words and pattern-avoiding permutations, arXiv:2009.01410 [math.CO], 2020. (A047849)
  3. Douglas E. Iannucci, "The Kaprekar Numbers", J. Integer Sequences, Volume 3, 2000, Article 00.1.2.
  4. Douglas E. Iannucci, On the Equation σ(n) = n + φ(n), Journal of Integer Sequences, Vol. 20 (2017), Article 17.6.2.
  5. Douglas Edward Iannucci, On duplicate representations as 2x + 3y for nonnegative integers x and y, arXiv:1907.03347 [math.NT], 2019. (A004050, A085634, A207079)
  6. Douglas E. Iannucci, On sums of the small divisors of a natural number, arXiv:1910.11835 [math.NT], 2019. (A000203, A066839)
  7. Douglas E. Iannucci and Bertrum Foster, "Kaprekar Triples", J. Integer Sequences, Volume 8, 2005, Article 05.4.8.
  8. Douglas E. Iannucci and Urban Larsson, Game values of arithmetic functions, arXiv:2101.07608 [math.NT], 2021. (A003602, A026478, A078898, A167175)
  9. Douglas E. Iannucci and Donna Mills-Taylor, "On Generalizing the Connell Sequence", J. Integer Sequences, Volume 2, 1999, Article 99.1.7.
  10. Douglas E. Iannucci, Deng Moujie and Graeme L. Cohen, "On Perfect Totient Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.4.5.
  11. Sofía Ibarra, Luis Manuel Rivera, The automorphism groups of some token graphs, arXiv:1907.06008 [math.CO], 2019. (A085680)
  12. Aminu A. Ibrahim, An enumeration scheme and some algebraic properties of a special (132)-avoiding class of permutation patterns, Trends Apl. Sci. Res. 2 (4) (2007) 334-350
  13. A. A. Ibrahim, A counting scheme and some algebraic properties of a class of special permutation patterns, J. Disc. Math. Sci. Crypt. 10 (4) (2007) 537 doi:10.1080/09720529.2007.10698137
  14. A. M. Ibrahim, Extension of factorial concept to negative numbers, Notes on Number Theory and Discrete Mathematics, Vol. 19, 2013, 2, 30-42; http://www.nntdm.net/papers/nntdm-19/NNTDM-19-2-30_42.pdf
  15. G. R. Ibrahim, Some combinatorial results on Green's relation of partial injective transformation semigroup, Journal of Semigroup Theory and Applications, Vol 2015 (2015), Article ID 4.
  16. Garba Risqot Ibrahim, Olasunkanmi Jafar Lawal, Sulaiman Awwal Akinwunmi, Gatta N. Bakare, and Adeshola A. Dauda, Some Combinatorial Results on Star-Like Transformation Semigroup Tαω*n, Nig. J. Math. Appl. (2022) Vol. 32, 56-67.
  17. A. M. Ibrahim, A. E. Ezugwu, M. Isa, A Comparative Study of Positive and Negative Factorials, Mathematical Theory and Modeling, Vol. 5, No. 4, 2015, http://iiste.org/Journals/index.php/MTM/article/viewFile/21566/22120
  18. Aminu Alhaji Ibrahim, Sa’idu Isah Abubaka, Aunu Integer Sequence as Non-Associative Structure and Their Graph Theoretic Properties, Advances in Pure Mathematics, 2016, 6, 409-419; doi:10.4236/apm.2016.66028
  19. IFL Science, 15 Paradoxes That Will Make Your Head Explode, no date; http://www.iflscience.com/editors-blog/15-paradoxes-that-will-make-your-head-explode/all/
  20. Dmitry I. Ignatov, On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n = 6, Int'l Conf. Formal Concept Analysis, 2023. doi:10.1007/978-3-031-35949-1_11 (A000931, A001608, A284707) We would like to thank N.J.A. Sloane and OEIS editors for their assistance and the anonymous reviewers for their useful suggestions.
  21. Dmitry I. Ignatov, A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions, Int'l Conf. Concept. Struct. (ICCS 2023) Graph-Based Representation and Reasoning, 56–69. (A302250, A326358) doi:10.1007/978-3-031-40960-8_6 We would like to thank all the OEIS editors, especially Joerg Arndt, Michel Marcus, and N. J. A. Sloane.
  22. Kentaro Ihara, Derivations and automorphisms on non-commutative power series, Journal of Pure and Applied Algebra, Volume 216, Issue 1, January 2012, Pages 192-201; doi:10.1016/j.jpaa.2011.06.004
  23. Ferdinand Ihringer, Remarks on the Erdős Matching Conjecture for Vector Spaces, arXiv:2002.06601 [math.CO], 2020. (A000041)
  24. M. Iida, On Triangle of numbers, Josai Mathematical Monographs, Vol. 5 (2012), 61-70; http://libir.josai.ac.jp/infolib/user_contents/pdf/JOS-13447777-05_61.pdf
  25. Soichi Ikeda and Kaneaki Matsuoka, On the Lcm-Sum Function, Journal of Integer Sequences, Vol. 17 (2014), Article 14.1.7
  26. S. Ikeda, K. Matsuoka, On transcendental numbers generated by certain integer sequences, Siauliai Math. Semin., 8 (16) 2013, 63-69; {DF
  27. F. O. Ikpotokin, S. C. Chiemeke, Mathematical derivation of the multi-peg Tower of Hanoi algorithm, J. Disc. Math. Sci. Crypt. doi:10.1080/09720529.2007.10698144
  28. Aleksandar Ilic and Andreja Ilic, doi:10.2298/FIL1103191I On the number of restricted Dyck paths, Filomat 25:3 (2011), 191-201; PDF
  29. A. Ilic, S. Klavzar and Y. Rho, Parity index of binary words and powers of prime words, http://www.fmf.uni-lj.si/~klavzar/preprints/BalancedFibo-submit.pdf, 2012
  30. L. Ilie and V. Mitrana, Binary Self-Adding Sequences and Languages, TUCS Technical Reports No. 18, May 1996.
  31. N. Ilievska, D. Gligoroski, Error-Detecting Code Using Linear Quasigroups, ICT Innovations 2014, Advances in Intelligent Systems and Computing Volume 311, 2015, pp 309-318.
  32. Mee Seong Im and Can Ozan Oğuz, Mee Seong Im and Can Ozan Oğuz, (2021). Abstract (A006893)
  33. Images des Maths, CNRS, Lagrange et la variation des théorèmes (2013)
  34. Ergal Imamoglu, Algorithms for solving linear differential equations with rational function coefficients, Dissertation, Florida State University, 2017.
  35. E. Imamoglu, M. van Hoeij, Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions, in ISSAC’15, July 6–9, 2015, Bath, United Kingdom, 2015, doi:10.1145/2755996.2756651; http://www.math.fsu.edu/~hoeij/papers/2015/ISSAC_2015_submission_27.pdf.
  36. K. S. Immink, Coding Schemes for Multi-Level Channels that are Intrinsically Resistant Against Unknown Gain and/or Offset Using Reference Symbols, http://www.exp-math.uni-essen.de/~immink/pdf/jsac13.pdf, 2013.
  37. Kees A. S. Immink and Kui Cai, Properties and constructions of constrained codes for DNA-based data storage, IEEE Access, vol. 8, no. 1, pp. 49523-49531, 2020 doi:10.1109/ACCESS.2020.2980036
  38. Yoshinari Inaba, "Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix", J. Integer Sequences, Volume 8, 2005, Article 05.2.7.
  39. S. Indyk and V. Lysechko, The formation method of complex signals ensembles with increased volume based on the use of frequency bands, Control, Navigation and Communication Systems (Зв’язок, телекомунікаціїта радіотехніка) (2020) Vol. 4, No. 62, 119-121. doi:10.26906/SUNZ.2020.4.119
  40. Florian Ingels, Romain Azaïs, Enumeration of Unordered Forests, arXiv:2003.08144 [cs.DM], 2020. (A158691)
  41. Florian Ingels, Revisiting Tree Isomorphism: AHU Algorithm with Primes Numbers, arXiv:2309.14441 [cs.DS], 2023. See p. 13. (A000081, A087803)
  42. Takuya Inoue and Yusuke Nakamura, Stratified Ehrhart ring theory on periodic graphs, arXiv:2310.19569 [math.CO], 2023. See p. 34. (A313961 p. 30, p. 34: A313961, A314064, A314154, A315238, A315346, A315356)
  43. International Mathematical Union, Minutes of 17th Meeting of Organizing Committee, 2013; http://www.mathunion.org/fileadmin/CEIC/Minutes/17th_Minutes-OC.pdf
  44. Godofredo Iommi and Mario Ponce, Odometers in non-compact spaces, arXiv:2404.03768 [math.DS], 2024. See p. 19. (A020651)
  45. Andrew D. Ionaşcu, Intersecting semi-disks and the synergy of three quadratic forms, An. Şt. Univ. Ovidius Constantą, (2019) Vol. 27, 5-13. doi:10.2478/auom-2019-0016, also PDF (A155562)
  46. Eugen J. Ionascu, "A Parametrization of Equilateral Triangles Having Integer Coordinates", J. Integer Sequences, Volume 10, 2007, Article 07.6.7.
  47. Eugen J. Ionascu, A characterization of regular tetrahedra in Z^3 (2007); arXiv:0712.3951; Journal of Number Theory, Volume 129, Issue 5, May 2009, Pages 1066-1074.
  48. Eugen J. Ionascu, arXiv:math/0701111 Counting all equilateral triangles in {0,1,2,...,n}^3, (2007).
  49. E. J. Ionascu, Regular tetrahedra whose vertices have integer coordinates, Acta Math. Univ. Comenianae, Vol. LXXX, 2 (2011), pp. 161-170
  50. E. J. Ionascu, Ehrhart's polynomial for equilateral triangles in Z^3, Arxiv preprint arXiv:1107.0695, 2011.
  51. E. J. Ionascu, Lattice Platonic Solids and their Ehrhart polynomial, Arxiv preprint arXiv:1111.1150, 2011
  52. E. J. Ionascu, Ehrhart polynomial for lattice squares, cubes and hypercubes, arXiv preprint arXiv:1508.03643, 2015
  53. Eugen J. Ionascu, Bisecting binomial coefficients (II), arXiv preprint arXiv:1712.01243, 2017
  54. Ionascu, Eugen J.; and Markov, Andrei; doi:10.1016/j.jnt.2010.07.008 Platonic solids in Z^3, J. Number Theory 131 (2011), no. 1, 138-145.
  55. Eugen J Ionascu, T Martinsen, P Stanica, Bisecting binomial coefficients, arXiv preprint arXiv:1610.02063, 2016
  56. Eugen J. Ionascu and R. A. Obando, Cubes in {0,1,...,n}^3, INTEGERS, 12A (2012), #A9.
  57. Eugen J. Ionaşcu, A variation on bisecting the binomial coefficients, Discrete Applied Mathematics (2018). doi:10.1016/j.dam.2018.04.026
  58. Joseph T. Iosue, Adam Ehrenberg, Dominik Hangleiter, Abhinav Deshpande, and Alexey V. Gorshkov, Page curves and typical entanglement in linear optics, arXiv:2209.06838 [quant-ph], 2022. (A000984, A062991)
  59. Lawrence Ip, Catalan numbers and random matrices (1999)
  60. J. Iraids, K. Balodis, J. Cernenoks, M. Opmanis, R. Opmanis and K. Podnieks, Integer Complexity: Experimental and Analytical Results. Arxiv preprint arXiv:1203.6462, 2012.
  61. Mahdeyeh Iranmanesh, Morteza Jafarpour, Hossien Aghabozorgi, Jian Ming Zhan, Classification of Krasner Hyperfields of Order 4, Acta Mathematica Sinica, English Series (2020) Vol. 36, No. 8, 889–902. doi:10.1007/s10114-020-8282-z (A132590)
  62. Skylyn Irby, Sandra Spiroff, On conditionally defined Fibonacci and Lucas sequences and periodicity, Bull. Korean Math. Soc. (2020) Vol. 57, No. 4, 1033–1048. doi:10.4134/BKMS.b190723 (A229216)
  63. Seth Ireland, A bijection between strongly stable and totally symmetric partitions, arXiv:2302.02505 [math.CO], 2023. (A005157, A236691)
  64. Giovanni Cerulli Irelli, Xin Fang, Evgeny Feigin, Ghislain Fourier, Markus Reineke, Linear degenerations of flag varieties: partial flags, defining equations, and group actions, arXiv:1901.11020 [math.AG], 2019. (A000110)
  65. A. T. Irish, F. Quitin, U. Madhow, M. Rodwell, Achieving multiple degrees of freedom in long-range mm-wave MIMO channels using randomly distributed relays; http://www.ece.ucsb.edu/wcsl/Publications/Andrew_Asilomar13.pdf, 2014.
  66. E. Irurozki Sampling and learning distance-based probability models for permutation spaces, PhD Dissertation, Department of Computer Science and Artificial Intelligence of the University of the Basque Country, 2015; http://www.sc.ehu.es/ccwbayes/isg/administrator/components/com_jresearch/files/theses/tesis_ekhine_irurozki.pdf
  67. E. Irurozki, B. Calvo, J. Ceberio, J. A. Lozano, Mallows model under the Ulam distance: a feasible combinatorial approach, 2014; http://events.csa.iisc.ernet.in/NIPS-14-rankingsws/Papers/4_Mallows_model_under_Ulam_distance%20(2).pdf
  68. E. Irurozki, B. Calvo, J. A. Lozano, An R package for permutations, Mallows and Generalized Mallows models, 2014; PDF doi:/10.18637/jss.v071.i12 J. Stat. Softw 71 (2016) 1-30
  69. E. Irurozki, B. Calvo, J. A. Lozano, Sampling and learning the Mallows and Weighted Mallows models under the Hamming distance, 2014; https://addi.ehu.es/bitstream/10810/11240/1/tr14-3.pdf
  70. E. Irurozki, B. Calvo, J. A. Lozano, Sampling and learning the Mallows model under the Ulam distance, 2014; https://addi.ehu.es/bitstream/10810/11241/1/tr14-4.pdf
  71. Ekhine Irurozki, B Calvo, JA Lozano, PerMallows: An R Package for Mallows and Generalized Mallows Models, Journal of Statistical Software, August 2016, Volume 71, Issue 12. doi:10.18637/jss.v071.i12
  72. Ekhine Irurozki, Borja Calvo, Jose A. Lozano, Mallows and Generalized Mallows Model for Matchings, September 2016.
  73. Veronika Irvine, Lace Tessellations: A mathematical model for bobbin lace and an exhaustive combinatorial search for patterns, PhD Dissertation, University of Victoria, 2016.
  74. Veronika Irvine, Stephen Melczer, Frank Ruskey, Vertically constrained Motzkin-like paths inspired by bobbin lace, arXiv:1804.08725 [math.CO], 2018. (A002426, A026519, A026495, A026520, A026521, A026522, A026523, A026524, A082758, A099250, A214938)
  75. Benedict Irwin, On the Number of k-Crossing Partitions, Univ. of Cambridge (2021). doi:10.22541/au.162022396.68662845/v1 (A005316)
  76. M. Isachenkov, I. Kirsch, V. Schomerus, Chiral Primaries in Strange Metals, arXiv preprint arXiv:1403.6857, 2014
  77. Aaron Isaksen, M Ismail, SJ Brams, A Nealen, Catch-Up: A Game in Which the Lead Alternates, G&PD, vol. 1, no. 2, 2015, pp. 38–49; http://game.engineering.nyu.edu/wp-content/uploads/2015/10/catch-up-a-game-in-which-the-lead-alternates-2015.pdf, 2015.
  78. Hassan Isanloo, The volume and Ehrhart polynomial of the alternating sign matrix polytope, Cardiff University (Wales, UK 2019). PDF (A005130)
  79. Zehra İşbilir and Nurten Gürses, Pell–Padovan generalized quaternions, Notes on Num. Theory and Disc. Math. (2021) Vol. 27, No. 1, 171—187. doi:10.7546/nntdm.2021.27.1.171-187 (A0066983)
  80. Zehra İşbilir and Nurten Gürses, Generalized Tribonacci Dual Quaternions, (2021). Abstract
  81. Zehra İşbilir and Nurten Gürses, Examination of generalized Tribonacci dual quaternions, Acta Comment. Univ. Tartuensis Math. (2023) Vol. 27, No. 2. PDF
  82. ABRAHAM ISGUR, VITALY KUZNETSOV AND STEPHEN M. TANNY, A combinatorial approach for solving certain nested recursions with non-slow solutions, Arxiv preprint arXiv:1202.0276, 2012 and J. Difference Equ. Appl. 19, No. 4, 605-614 (2013) doi:10.1080/10236198.2012.662967.
  83. A. Isgur, R. Lech, S. Moore, S. Tanny, Y. Verberne, and Y. Zhang, Constructing New Families of Nested Recursions with Slow Solutions, SIAM J. Discrete Math., 30(2), 2016, 1128–1147. (20 pages); doi:10.1137/15M1040505
  84. A. Isgur, D. Reiss, Trees and meta-Fibonacci sequences, El. J. Combinat. 16 (2009) #R129
  85. Masado Ishii, Jacob Gores, Christof Teuscher, On the sparse percolation of damage in finite non-synchronous random Boolean networks, Physica D: Nonlinear Phenomena (2019) Vol. 398, 84-91. doi:10.1016/j.physd.2019.05.011
  86. Yasuhiro Ishitsuka, Tetsushi Ito, Tatsuya Ohshita, Takashi Taniguchi, and Yukihiro Uchida, Periods modulo p of integer sequences associated with division polynomials of genus 2 curves, arXiv:2310.01013 [math.NT], 2023. (A058231)
  87. Sh. T. Ishmukhametov, F. F. Sharifullina, On distribution of semiprime numbers, Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 8, pp. 53-59. English translation in Russian Mathematics, 2014, Volume 58, Issue 8 , pp 43-48; doi:10.3103/S1066369X14080052
  88. Dan Ismailescu and Peter Seho Park, On Pairwise Intersections of the Fibonacci, Sierpinski, and Riesel Sequences, Journal of Integer Sequences, 16 (2013), #13.9.8.
  89. Dan Ismailescu and Peter C. Shim, On numbers that cannot be expressed as a plus-minus weighted sum of a Fibonacci number and a prime, INTEGERS 14 (2014), #A65.
  90. Yukinao Isokawa, Series-Parallel Circuits and Continued Fractions, Applied Mathematical Sciences, Vol. 10, 2016, no. 27, 1321 - 1331; doi:10.12988/ams.2016.63103.
  91. Yukinao Isokawa, Listing up Combinations of Resistances, Bulletin of the Kagoshima University Faculty of Education. Bulletin of the Faculty of Education, Kagoshima University. Natural science, Vol. 67 (2016), pp. 1-8; Http://ir.kagoshima-u.ac.jp/bitstream/10232/26821/2/ Isokawa.pdf
  92. Genta Ito, Least change in the Determinant or Permanent of a matrix under perturbation of a single element: continuous and discrete cases (2008); arXiv:0805.2081
  93. Genta Ito, Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element (2008); arXiv:0805.2083
  94. Avraham Itzhakov, Michael Codish, Breaking Symmetries in Graph Search with Canonizing Sets, arXiv preprint arXiv:1511.08205, 2015.
  95. Avraham Itzhakov, Michael Codish, Incremental Symmetry Breaking Constraints for Graph Search Problems, Ben-Gurion University of the Negev (Beer-Sheva, Israel, 2019). PDF (A001349)
  96. Avraham Itzhakov and Michael Codish, Breaking Symmetries with High Dimensional Graph Invariants and Their Combination, Int'l Conf. Integration of Constraint Prog., Artif. Int., and Oper. Res. (CPAIOR 2023) Lecture Notes in Comp. Sci., Vol 13884. Springer, Cham. doi:10.1007/978-3-031-33271-5_10
  97. A. Iványi, Leader election in synchronous networks, Acta Univ. Sapientiae, Mathematica, 5, 2 (2013) 54-82.
  98. A. IVANYI, L. LUCZ, T. MATUSZKA and S. PIRZADA, Parallel enumeration of degree sequences of simple graphs, Acta Univ. Sapientiae, Informatica, 4, 2 (2012) 260-288.
  99. A. Ivanyi and J. E. Schoenfield, Deciding football sequences, Acta Univ. Sapientiae, Informatica, 4, 1 (2012) 130-183, http://www.acta.sapientia.ro/acta-info/C4-1/info41-7.pdf.
  100. H. Iwashita, J. Kawahara and S.-I. Minato, ZDD-Based Computation of the Number of Paths in a Graph, Division of Computer Science, Report Series A, September 18, 2012, Hokkaido University, 2012; http://www-alg.ist.hokudai.ac.jp/~thomas/TCSTR/tcstr_12_60/tcstr_12_60.pdf.
  101. Kozue Iwata, Shiro Ishiwata and Shin-ichi Nakano, A Compact Encoding of Unordered Binary Trees, in Theory and Applications of Models of Computation, Lecture Notes in Computer Science, 2011, Volume 6648/2011, 106-113, doi:10.1007/978-3-642-20877-5_11
  102. K. Viswanathan Iyer, A case for Intranet-based Online portal for undergraduate Computer Science education, arXiv:1408.1032
  103. V. K. Iyer, A dynamic intranet-based online-portal support for Computer Science teaching, in Education and Information Technologies The Official Journal of the IFIP Technical Committee on Education, ISSN: 1360-2357 (Print) 1573-7608 (Online), 2016; doi:10.1007/s10639-015-9459-4. Also arXiv:1701.02093
  104. Nikolay Sh. Izmailian, Ralph Kenna, and Vladimir V. Papoyan, Exact coefficients of finite-size corrections in the Ising model with Brascamp-Kunz boundary conditions and their relationships for strip and cylindrical geometries, arXiv:2303.03484 [cond-mat.stat-mech], 2023. (A012495)
  105. Nickolay Izmailian, Ralph Kenna, and Vladimir Papoyan, Exact coefficients of finite-size corrections in the Ising model with Brascamp-Kunz boundary conditions and their relationships forstrip and cylindrical geometries, J. Phys. A: Math. Theor. (2023). doi:10.1088/1751-8121/acf96b
  106. Anton Izosimov, Matrix polynomials, generalized Jacobians, and graphical zonotopes, arXiv preprint arXiv:1506.05179, 2015

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=CiteI&oldid=1659349"