Sinai Robins
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sinai Robins has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Giancarlo Travaglini
Università di Milano-Bicocca, Milano, Italy
2 shared publications - Leonardo Colzani
Dipartimento di Matematica e Applicazioni, Università di Milano-Bicocca, Milano, Italy
2 shared publications - Luca Brandolini
Dipartimento di Ingegneria Gestionale, dell’Informazione e della Produzione, Università degli Studi di Bergamo, Dalmine, Italy
2 shared publications - Alex Iosevich
Department of Mathematics, University of Rochester, Rochester, USA
1 shared publication - Alexander Kolpakov
University of Austin, Austin TX, USA
1 shared publication - Arnaldo Mandel
Dept. of Mathematics, Univ. of São Paulo, São Paulo, Brazil
1 shared publication
Latest Publications
- 18 July 2023
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 150 (2) , 1-11
The null set of a polytope, and the Pompeiu property for polytopes
- 18 July 2023
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 150 (2) , 1-11
The null set of a polytope, and the Pompeiu property for polytopes
- 8 October 2021
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 375 (01) , 151-172
An Euler-MacLaurin formula for polygonal sums
- 8 October 2021
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 375 (01) , 151-172
An Euler-MacLaurin formula for polygonal sums
- Open Access
An Euler-Maclaurin formula for polygonal sums
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit of Pick's theorem on the number of integer points in an integer polygon and involves weighted Riemann sums, using tools from Harmonic analysis. Finally, we also exhibit a classical trick, dating back to Huygens and Newton, to accelerate convergence of these Riemann sums.
Open AccessAn Euler-Maclaurin formula for polygonal sums
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit of Pick's theorem on the number of integer points in an integer polygon and involves weighted Riemann sums, using tools from Harmonic analysis. Finally, we also exhibit a classical trick, dating back to Huygens and Newton, to accelerate convergence of these Riemann sums.
- 17 December 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (324) , 2031-2046
Spherical tetrahedra with rational volume, and spherical Pythagorean triples
We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive examples that confirm this conjecture. As a by-product, we also obtain a classification of all spherical Pythagorean triples, previously found by Smith.
- 17 December 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (324) , 2031-2046
Spherical tetrahedra with rational volume, and spherical Pythagorean triples
We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive examples that confirm this conjecture. As a by-product, we also obtain a classification of all spherical Pythagorean triples, previously found by Smith.
- Open Access
Dragging the roots of a polynomial to the unit circle
Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such polynomial $p$, and define $\mathscr{cn}(p)$, $\mathscr{il}(p)$ to be the sharp threshold values of $\alpha$ that guarantee that, for all larger values of the parameter, $p_\alpha$ has, respectively, all roots in the unit circle and all roots interlacing the roots of unity of the same degree. Interlacing implies circle rootedness, hence $\mathscr{il}(p)\geq\mathscr{cn}(p)$, and this inequality is often used for showing circle rootedness. Both $\mathscr{cn}(p)$ and $\mathscr{il}(p)$ turn out to be semi-algebraic functions of the coefficients of $p$, and some useful bounds are also presented, entailing several known results about roots in the circle. The study of $\mathscr{il}(p)$ leads to a rich classification of real self-inversive polynomials of each degree, organizing them into a complete polyhedral fan. We have a close look at the class of polynomials for which $\mathscr{il}(p)=\mathscr{cn}(p)$, whereas in general the quotient $\frac{\mathscr{il}(p)}{\mathscr{cn}(p)}$ is shown to be unbounded as the degree grows. Several examples and open questions are presented.Open AccessDragging the roots of a polynomial to the unit circle
Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such polynomial $p$, and define $\mathscr{cn}(p)$, $\mathscr{il}(p)$ to be the sharp threshold values of $\alpha$ that guarantee that, for all larger values of the parameter, $p_\alpha$ has, respectively, all roots in the unit circle and all roots interlacing the roots of unity of the same degree. Interlacing implies circle rootedness, hence $\mathscr{il}(p)\geq\mathscr{cn}(p)$, and this inequality is often used for showing circle rootedness. Both $\mathscr{cn}(p)$ and $\mathscr{il}(p)$ turn out to be semi-algebraic functions of the coefficients of $p$, and some useful bounds are also presented, entailing several known results about roots in the circle. The study of $\mathscr{il}(p)$ leads to a rich classification of real self-inversive polynomials of each degree, organizing them into a complete polyhedral fan. We have a close look at the class of polynomials for which $\mathscr{il}(p)=\mathscr{cn}(p)$, whereas in general the quotient $\frac{\mathscr{il}(p)}{\mathscr{cn}(p)}$ is shown to be unbounded as the degree grows. Several examples and open questions are presented. - 17 October 2018
- Published by Springer Nature in Analysis Mathematica
- Vol. 44 (4) , 433-449
Tiling, Circle Packing and Exponential Sums over Finite Fields
- 17 October 2018
- Published by Springer Nature in Analysis Mathematica
- Vol. 44 (4) , 433-449
Tiling, Circle Packing and Exponential Sums over Finite Fields
- Open Access
Simple proofs and expressions for the restricted partition function and its polynomial part
In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an average of the partition function.
Open AccessSimple proofs and expressions for the restricted partition function and its polynomial part
In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an average of the partition function.
- Open Access
A continuous analogue of lattice path enumeration
Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions of binomials and multinomials, and describe some identities and partial differential equations they satisfy. Finally, we illustrate a general process to recover discrete combinatorial quantities from their continuous analogs.
Open AccessA continuous analogue of lattice path enumeration
Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions of binomials and multinomials, and describe some identities and partial differential equations they satisfy. Finally, we illustrate a general process to recover discrete combinatorial quantities from their continuous analogs.
- Open Access
Algebraic vertices of non-convex polyhedra
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of $P$. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier--Laplace transform. We show that a point $\mathbf{v}$ is an algebraic vertex of a generalized polyhedron $P$ if and only if the tangent cone of $P$, at $\mathbf{v}$, has non-zero Fourier--Laplace transform.Open AccessAlgebraic vertices of non-convex polyhedra
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of $P$. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier--Laplace transform. We show that a point $\mathbf{v}$ is an algebraic vertex of a generalized polyhedron $P$ if and only if the tangent cone of $P$, at $\mathbf{v}$, has non-zero Fourier--Laplace transform. - Open Access
Tiling the integer lattice with translated sublattices
When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a theoretical framework, based on multiple residues and dual groups, to provide a set of necessary and sufficient conditions for such a lattice tiling to exist. We also investigate the question of when a lattice tiling must possess at least two translated sublattices which are translates of one another.Open AccessTiling the integer lattice with translated sublattices
When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a theoretical framework, based on multiple residues and dual groups, to provide a set of necessary and sufficient conditions for such a lattice tiling to exist. We also investigate the question of when a lattice tiling must possess at least two translated sublattices which are translates of one another.