Related papers: Archimedes' Revenge
We show that the cohomology intersection number of a twisted Gauss-Manin connection with regularization condition is a rational function. As an application, we obtain a new quadratic relation associated to period integrals of a certain…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…
We prove a law of large numbers for the volumes of families of random hyperbolic mapping tori and Heegaard splittings providing a sharp answer to a conjecture of Dunfield and Thurston.
A $\sqrt{n}$ estimate in the hyperplane problem with arbitrary measures has recently been proved in \cite{K3}. In this note we present analogs of this result for sections of lower dimensions and in the complex case. We deduce these…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
A ball polyhedron is the intersection of a finite number of closed balls in $\mathbb{R}^3$ with the same radius. In this note, we study ball polyhedra in which the set of centers defining the balls have the maximum possible number of…
In this paper, we continue the study of intersections of closed curves on translation surfaces, initiated in by S. Cheboui, A. Kessi and D. Massart for a family of arithmetic Veech surfaces and the author, E. Lanneau and D. Massart for a…
The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…
We proposed a purely 3-D geometrical solution to Mathematics Magazine Problem 2065. Let $\mathcal{Q}$ be a cube centered at the origin of $\mathbb{R}^3$. Choose a unit vector $(a,b,c)$ uniformly at random on the surface of the unit sphere…
We compute explicitly the Riemannian volume, with respect to the Fubini-Study metric, of a domain bounded by a Hermitian quadric in complex projective space. The volume is a rational function of the eigenvalues of the defining quadratic…
We develop a new method for the computation of $(3,3)$-isogenies between principally polarized abelian surfaces. The idea is to work with models in $\mathbb{P}^8$ induced by a symmetric level-$3$ theta structure. In this setting, the action…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
We give a refined upper bound for the hyperbolic volume of an alternating link in terms of the first three and the last three coefficients of its colored Jones polynomial.
Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…
Define a body A to be able to hide behind a body B if the orthogonal projection of B contains a translation of the corresponding orthogonal projection of A in every direction. In two dimensions, it is easy to observe that there exist two…
We classify completely the intersections of the Hermitian curve with parabolas in the affine plane. To obtain our results we employ well-known algebraic methods for finite fields and geometric properties of the curve automorphisms. In…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…