Related papers: 3264 Conics in a Second
The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GPI-Space, we have developed an infrastructure for massively…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…
We introduce several modifications of conic fitting in Geometric algebra for conics by incorporating additional conditions into the optimisation problem. Each of these extra conditions ensure additional geometric properties of a fitted…
We develop a circle of ideas involving pairs of lines in the plane, intersections of hyperbolically rotated elliptical cones and the locus of the centers of rectangles inscribed in lines in the plane.
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…
We recursively compute the Gromov-Witten invariants of the Hilbert scheme of two points in the plane. By studying the space of stable maps and computing virtual contributions, we use these invariants to enumerate hyperelliptic plane curves…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…
In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
We study real bitangents of real algebraic plane curves from two perspectives. We first show that there exists a signed count of such bitangents that only depends on the real topological type of the curve. From this follows that a generic…
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
We propose new algorithms for topic modeling when the number of topics is unknown. Our approach relies on an analysis of the concentration of mass and angular geometry of the topic simplex, a convex polytope constructed by taking the convex…