Igor Rivin

Last updated
Igor Rivin
Born1961 (age 62–63)
Moscow, USSR
Nationality Canadian
Alma mater Princeton University
University of Toronto
Known forInscribable polyhedra
Awards Whitehead Prize (1998)
Scientific career
Fields Mathematics, Computer Science, Materials Science
Institutions University of St Andrews
Temple University
Caltech
University of Warwick
Institute for Advanced Study
Institut des Hautes Études Scientifiques
Doctoral advisor William Thurston
Doctoral students Michael Dobbins

Igor Rivin (born 1961 in Moscow, USSR) is a Russian-Canadian mathematician, working in various fields of pure and applied mathematics, computer science, and materials science. He was the Regius Professor of Mathematics at the University of St. Andrews from 2015 to 2017, and was the chief research officer at Cryptos Fund until 2019. He is doing research for Edgestream LP, in addition to his academic work.

Contents

Career

He received his B.Sc. (Hon) in mathematics from the University of Toronto in 1981, and his Ph.D. in 1986 [1] from Princeton University under the direction of William Thurston. Following his doctorate, Rivin directed development of QLISP and the Mathematica kernel, before returning to academia in 1992, where he held positions at the Institut des Hautes Études Scientifiques, the Institute for Advanced Study, the University of Melbourne, Warwick, and Caltech. Since 1999, Rivin has been professor of mathematics at Temple University. Between 2015 and 2017 he was Regius Professor of Mathematics at the University of St. Andrews.

Major accomplishments

Rivin's PhD thesis [1] [2] and a series of extensions [3] [4] [5] characterized hyperbolic 3-dimensional polyhedra in terms of their dihedral angles, resolving a long-standing open question of Jakob Steiner on the inscribable combinatorial types. These, and some related results in convex geometry, [6] have been used in 3-manifold topology, [7] theoretical physics, computational geometry, and the recently developed field of discrete differential geometry.

Rivin has also made advances in counting geodesics on surfaces, [8] the study of generic elements of discrete subgroups of Lie groups, [9] and in the theory of dynamical systems. [10]

Rivin is also active in applied areas, having written large parts of the Mathematica 2.0 kernel, and he developed a database of hypothetical zeolites in collaboration with M. M. J. Treacy.

Rivin is a frequent contributor to MathOverflow.

Igor Rivin is the co-creator, with economist Carlo Scevola, of Cryptocurrencies Index 30 (CCi30), [11] an index of the top 30 cryptocurrencies weighted by market capitalization. CCi30 is sometimes used by academic economists as a market index when comparing the cryptocurrency trading market as a whole with individual currencies. [12] [13]

Honors

Related Research Articles

<span class="mw-page-title-main">Polyhedron</span> 3D shape with flat faces, straight edges and sharp corners

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

<span class="mw-page-title-main">William Thurston</span> American mathematician

William Paul Thurston was an American mathematician. He was a pioneer in the field of low-dimensional topology and was awarded the Fields Medal in 1982 for his contributions to the study of 3-manifolds.

<span class="mw-page-title-main">Hugo Hadwiger</span> Swiss mathematician (1908–1981)

Hugo Hadwiger was a Swiss mathematician, known for his work in geometry, combinatorics, and cryptography.

<span class="mw-page-title-main">Geometric group theory</span> Area in mathematics devoted to the study of finitely generated groups

Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act.

<span class="mw-page-title-main">Net (polyhedron)</span> Edge-joined polygons which fold into a polyhedron

In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

<span class="mw-page-title-main">William Goldman (mathematician)</span> American mathematician

William Mark Goldman is a professor of mathematics at the University of Maryland, College Park. He received a B.A. in mathematics from Princeton University in 1977, and a Ph.D. in mathematics from the University of California, Berkeley in 1980.

<span class="mw-page-title-main">Midsphere</span> Sphere tangent to every edge of a polyhedron

In geometry, the midsphere or intersphere of a convex polyhedron is a sphere which is tangent to every edge of the polyhedron. Not every polyhedron has a midsphere, but the uniform polyhedra, including the regular, quasiregular and semiregular polyhedra and their duals all have midspheres. The radius of the midsphere is called the midradius. A polyhedron that has a midsphere is said to be midscribed about this sphere.

<span class="mw-page-title-main">Unknotting problem</span> Determining whether a knot is the unknot

In mathematics, the unknotting problem is the problem of algorithmically recognizing the unknot, given some representation of a knot, e.g., a knot diagram. There are several types of unknotting algorithms. A major unresolved challenge is to determine if the problem admits a polynomial time algorithm; that is, whether the problem lies in the complexity class P.

<span class="mw-page-title-main">Honeycomb (geometry)</span> Tiling of 3-or-more dimensional euclidian or hyperbolic space

In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space.

<span class="mw-page-title-main">Flexible polyhedron</span>

In geometry, a flexible polyhedron is a polyhedral surface without any boundary edges, whose shape can be continuously changed while keeping the shapes of all of its faces unchanged. The Cauchy rigidity theorem shows that in dimension 3 such a polyhedron cannot be convex.

In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.

<span class="mw-page-title-main">David B. A. Epstein</span> Mathematician (born 1937)

David Bernard Alper Epstein FRS is a mathematician known for his work in hyperbolic geometry, 3-manifolds, and group theory, amongst other fields. He co-founded the University of Warwick mathematics department with Christopher Zeeman and is founding editor of the journal Experimental Mathematics.

<span class="mw-page-title-main">Károly Bezdek</span> Hungarian-Canadian mathematician

Károly Bezdek is a Hungarian-Canadian mathematician. He is a professor as well as a Canada Research Chair of mathematics and the director of the Centre for Computational and Discrete Geometry at the University of Calgary in Calgary, Alberta, Canada. Also he is a professor of mathematics at the University of Pannonia in Veszprém, Hungary. His main research interests are in geometry in particular, in combinatorial, computational, convex, and discrete geometry. He has authored 3 books and more than 130 research papers. He is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM).

The Alexandrov uniqueness theorem is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s.

<span class="mw-page-title-main">Cornelia Druțu</span> Romanian mathematician

Cornelia Druțu is a Romanian mathematician notable for her contributions in the area of geometric group theory. She is Professor of mathematics at the University of Oxford and Fellow of Exeter College, Oxford.

In discrete and computational geometry, a set of points in the Euclidean plane or a higher-dimensional Euclidean space is said to be in convex position or convex independent if none of the points can be represented as a convex combination of the others. A finite set of points is in convex position if all of the points are vertices of their convex hull. More generally, a family of convex sets is said to be in convex position if they are pairwise disjoint and none of them is contained in the convex hull of the others.

In differential geometry the theorem of the three geodesics, also known as Lyusternik–Schnirelmann theorem, states that every Riemannian manifold with the topology of a sphere has at least three simple closed geodesics. The result can also be extended to quasigeodesics on a convex polyhedron, and to closed geodesics of reversible Finsler 2-spheres. The theorem is sharp: although every Riemannian 2-sphere contains infinitely many distinct closed geodesics, only three of them are guaranteed to have no self-intersections. For example, by a result of Morse if the lengths of three principal axes of an ellipsoid are distinct, but sufficiently close to each other, then the ellipsoid has only three simple closed geodesics.

<span class="mw-page-title-main">Jeremy Kahn</span> American mathematician

Jeremy Adam Kahn is an American mathematician. He works on hyperbolic geometry, Riemann surfaces and complex dynamics.

Albert Marden is an American mathematician, specializing in complex analysis and hyperbolic geometry.

<span class="mw-page-title-main">Ideal polyhedron</span> Shape in hyperbolic geometry

In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space.

References

  1. 1 2 Rivin, Igor (1986). On geometry of convex polyhedra in hyperbolic 3-space (PhD thesis). Princeton University. MR   2635205.
  2. ↑ Hodgson, C. D.; Rivin, I. (1993). "A characterization of compact convex polyhedra in hyperbolic 3-space". Inventiones Mathematicae. 111: 77–111. Bibcode:1993InMat.111...77H. doi:10.1007/BF01231281. S2CID   123418536.
  3. ↑ Rivin, Igor (1994). "Euclidean Structures on Simplicial Surfaces and Hyperbolic Volume". Annals of Mathematics. 139 (3): 553–580. doi:10.2307/2118572. JSTOR   2118572. S2CID   120299702.
  4. ↑ Rivin, Igor (1996). "A Characterization of Ideal Polyhedra in Hyperbolic 3-Space". Annals of Mathematics. 143 (1): 51–70. doi:10.2307/2118652. JSTOR   2118652.
  5. ↑ Rivin, I. (2003). "Combinatorial optimization in geometry". Advances in Applied Mathematics. 31: 242–271. arXiv: math/9907032 . doi:10.1016/S0196-8858(03)00093-9. S2CID   119153365.
  6. ↑ Rivin, I. (2009). "Asymptotics of convex sets in Euclidean and hyperbolic spaces". Advances in Mathematics . 220 (4): 1297–2013. doi: 10.1016/j.aim.2008.11.014 .
  7. ↑ Futer, David; Guéritaud, François (2011). "From angled triangulations to hyperbolic structures". In Champanerkar, Abhijit; Dasbach, Oliver; Kalfagianni, Efstratia; Kofman, Ilya; Neumann, Walter David; Stoltzfus, Neal W. (eds.). Interactions Between Hyperbolic Geometry, Quantum Topology and Number Theory. Vol. 541. Providence (R.I.): American Mathematical Soc. pp. 159–182. arXiv: 1004.0440 . doi:10.1090/conm/541/10683. ISBN   978-0-8218-4960-6. MR   2796632.
  8. ↑ Rivin, I. (2001). "Simple Curves on Surfaces". Geometriae Dedicata. 87: 345–360. arXiv: math/9907041 . doi:10.1023/A:1012010721583. S2CID   17338586.
  9. ↑ Rivin, I. (2008). "Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms". Duke Mathematical Journal. 142 (2): 353–379. arXiv: math/0703532 . doi:10.1215/00127094-2008-009. S2CID   10093564.
  10. ↑ Rivin, I. (2005). "On Some Mean Matrix Inequalites of Dynamical Interest". Communications in Mathematical Physics. 254 (3): 651–658. Bibcode:2005CMaPh.254..651R. doi:10.1007/s00220-004-1282-5. S2CID   9510842.
  11. ↑ "Cryptocurrency Index 30 - CCi30".
  12. ↑ Ajaz, Taufeeq; Kumar, Anoop S. (2018-06-01). "Herding in crypto-currency markets". Annals of Financial Economics. 13 (2): 1850006. doi:10.1142/S2010495218500069. ISSN   2010-4952. S2CID   158488687.
  13. ↑ Felix, Thomas Heine; von Eije, Henk (2019-04-03). "Underpricing in the cryptocurrency world: evidence from initial coin offerings" (PDF). Managerial Finance. 45 (4): 563–578. doi:10.1108/MF-06-2018-0281. ISSN   0307-4358. S2CID   159119639.
  14. ↑ "List of LMS prize winners | London Mathematical Society".
  15. ↑ "Berlin Mathematical School - Guests". Archived from the original on 2012-07-19. Retrieved 2012-08-26.
  16. ↑ List of Fellows of the American Mathematical Society, retrieved 2014-12-17
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.