📖 Overview
Sinai Robins is a mathematician and researcher known for his work in discrete geometry and computational mathematics, particularly in the study of lattice polytopes and their properties.
His collaborative research with Matthias Beck resulted in the influential textbook "Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra," which has become a standard reference in discrete geometry and Ehrhart theory. The book bridges theoretical mathematics with practical computational methods.
Robins has made significant contributions to understanding the relationship between continuous and discrete geometry, including work on solid angles and lattice point enumeration. His research at San Francisco State University has focused on geometric and combinatorial problems involving polytopes and their discrete properties.
Through his academic career, Robins has published numerous papers in mathematical journals and participated in various research collaborations exploring the intersection of geometry, number theory, and combinatorics.
👀 Reviews
Not enough reader review data exists online to create a meaningful summary of public opinion about Sinai Robins or his works. While his textbook "Computing the Continuous Discretely" (co-authored with Matthias Beck) is used in mathematics courses, public reviews are limited.
The book has 4.5/5 stars on Amazon but with only 2 reviews. One reviewer noted its value for "understanding Ehrhart polynomials and their properties." No significant criticism appears in the available reviews.
Due to the specialized academic nature of his work, most discussion occurs within mathematical research communities rather than through public reader reviews. A meaningful summary of general reader sentiment cannot be compiled without more public review data.
📚 Books by Sinai Robins
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra (with Matthias Beck)
A comprehensive textbook covering fundamental concepts in discrete geometry and Ehrhart theory, focusing on the relationships between continuous geometric objects and their discrete counterparts through lattice point enumeration.
👥 Similar authors
Richard Stanley Developed fundamental theories in algebraic combinatorics and wrote "Enumerative Combinatorics." His work on generating functions and lattice point enumeration aligns closely with discrete geometry methods.
Michel Brion Studies algebraic geometry with focus on convex polytopes and toric varieties. His research on intersection theory and moment maps connects to polytope enumeration techniques.
Peter McMullen Made foundational contributions to polytope theory and wrote extensively on valuations of convex bodies. His work on f-vectors and polytope algebra provides key theoretical frameworks for discrete geometry.
Alexander Barvinok Specializes in computational aspects of convex geometry and integer programming. His methods for counting lattice points in polytopes advanced algorithmic approaches in discrete mathematics.
Herbert Scarf Developed computational methods for economic equilibria using geometric techniques from integer programming. His work connects discrete geometry to optimization and fixed point computations.
Michel Brion Studies algebraic geometry with focus on convex polytopes and toric varieties. His research on intersection theory and moment maps connects to polytope enumeration techniques.
Peter McMullen Made foundational contributions to polytope theory and wrote extensively on valuations of convex bodies. His work on f-vectors and polytope algebra provides key theoretical frameworks for discrete geometry.
Alexander Barvinok Specializes in computational aspects of convex geometry and integer programming. His methods for counting lattice points in polytopes advanced algorithmic approaches in discrete mathematics.
Herbert Scarf Developed computational methods for economic equilibria using geometric techniques from integer programming. His work connects discrete geometry to optimization and fixed point computations.