This site is supported by donations to The OEIS Foundation.

# CiteU

From OeisWiki

# CiteU

## 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 U.
- 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

- N. Uddin, S. Mohammed, Effect of an error in the forward difference based tabular values of the rate of enzymatic reaction based mathematical functions, International Journal of Pharmacology and Toxicology, 1 (2) (2013) 14-16; doi:10.14419/ijpt.v1i2.1076.
- Ryuhei Uehara, "Gift 1: Jangrams next to Tangram and Sei Shonagon Chie no Ita, Gift 2: Simple Polygons Folding to Three Boxes", Gathering For Gardner Gift Book, 2016, http://www.gathering4gardner.org/g4g12gift/Uehara_Ryuhei-Jangrams.pdf
- Victor Ufnarovski and Bo Ahlander, "How to Differentiate a Number", J. Integer Sequences, Volume 6, 2003, Article 03.3.4.
- I. F. Ugbene, E. O. Eze and S. O. Makanjuola, On the Number of Conjugacy Classes in the Injective Order-Decreasing Transformation Semigroup, The Pacific Journal of Science and Technology, Volume 14. Number 1. May 2013 (Spring), pp. 182-186; PDF.
- Ugbene, Ifeanyichukwu Jeff, Moses Anayo Mbah, and Gatta Bakare. "ON THE COMBINATORIAL PROPERTIES OF NILPOTENT AND IDEMPOTENT CONJUGACY CLASSES OF THE INJECTIVE ORDER-PRESERVING TRANSFORMATION SEMIGROUP." Preprint 2015.
- Frank Uhlig, Tin-Yau Tam, David Carlson, Directions in matrix theory, Auburn 1990, conference report, Linear Algebra and its Applications, Volumes 162-164, February 1992, Pages 711-797.
- S. Uijlen, B. Westerbaan, A Kochen-Specker system has at least 22 vectors, arXiv preprint arXiv:1412.8544, 2014
- A. M. Uludag, A. Zeytin and M. Durmus, Binary Quadratic Forms as Dessins, PDF, 2012.
- A. P. Ulyanov, Polydiagonal compactification of configuration spaces. J. Algebraic Geom. 11 (2002), no. 1, 129-159.
- A. Umar, Combinatorial Results for Semigroups of Orientation-Preserving Partial Transformations, Journal of Integer Sequences, 14 (2011), #11.7.5.
- R. Umar, W. Mesbah, Throughput-efficient joint coalition formation and bandwidth allocation in cognitive radio networks, in: Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM), 2014 9th International Conference on; 2-4 June 2014, pp. 1-6.
- R. Umar, W, Mesbah, Coordinated coalition formation in throughput‐efficient cognitive radio networks, Wireless Communications and Mobile Computing, Article first published online: 6 FEB 2015 doi:10.1002/wcm.2568
- R. G. Underwood, On the Content Bound for Real Quadratic Field Extensions, Axioms 2013, 2, 1-9; doi:10.3390/axioms2010001.
- Robert G. Underwood, Fundamentals of Modern Algebra, World Scientific, 2016, see page 215.
- Robert Underwood, A Class of Automatic Sequences, arXiv preprint arXiv:1712.10259, 2017
- W. Unger, Combinatorics of Lattice QCD at Strong Coupling, arXiv preprint arXiv:1411.4493, 2014
- Massimiliano Ungheretti, Free loop spaces and dihedral homology, arXiv preprint arXiv:1608.08140, 2016
- University of Szeged and Faculty of Sciences, University of Novi Sad, Organizers, Spring School on Mathematics and Computer-Aided Modeling in Sciences, Szeged - Novi Sad 2011; PDF
- Takeaki Uno, Ryuhei Uehara and Shin-ichi Nakano, Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression, in WALCOM: ALGORITHMS AND COMPUTATION, Lecture Notes in Computer Science, 2012, Volume 7157/2012, 5-16, doi:10.1007/978-3-642-28076-4_4
- J.-D. Urbina, J. Kuipers, Q. Hummel, K. Richter, Multiparticle correlations in complex scattering and the mesoscopic Boson Sampling problem, arXiv preprint arXiv:1409.1558, 2014
- Alasdair Urquhart, Henry M. Sheffer and Notational Relativity, History and Philosophy of Logic, Volume 33, Issue 1, 2012, pp. 33-47; doi:10.1080/01445340.2011.592261
- Hanna Uscka-Wehlou, Continued Fractions and Digital Lines with Irrational Slopes, in Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Volume 4992/2008, Springer-Verlag.
- Hanna Uscka-Wehlou, Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map, Pattern Recognition, Volume 42, Issue 10, October 2009, Pages 2247-2254.
- Mir Ali Usman, Phylogenetic trees, Masters Report 2009
- Alexey Ustinov, Supercontinuants, arXiv:1503.04497 [math.NT], 2015.
- Eda Uyanık, Olivier Sobrie, Vincent Mousseau, Marc Pirlot, Enumerating and categorizing positive Boolean functions separable by a
*k*-additive capacity. Discrete Applied Mathematics, Vol. 229, 1 October 2017, p. 17-30. doi:10.1016/j.dam.2017.04.010 - Sukran Uygun, Some Sum Formulas of (s, t)-Jacobsthal and (s, t)-Jacobsthal Lucas Matrix Sequences, Applied Mathematics, 7, (2016), 61-69; Published Online January 2016 in SciRes. doi:10.4236/am.2016.71005
- S. Uygun, On the k-Jacobsthal Lucas Numbers of Arithmetic Indexes, International Journal of Contemporary Mathematical Sciences, Vol. 11, 2016, no. 4, 173 - 183, http://dx.doi.org/10.12988/ijcms.2016.51263.
- P. Uznanski, All Permutations Supersequence is coNP-complete, arXiv preprint arXiv:1506.05079, 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**.