相关论文: Bounding the signed count of real bitangents to pl…

Enumerative algebraic geometry counts the solutions to certain geometric constraints. Numerical algebraic geometry determines these solutions for any given instance. This article illustrates how these two fields complement each other. Our…

Analysing the cubic sectors of a real polynomial of degree n, a modification of the Newton Rule is Signs is proposed with which stricter upper bound on the number of real roots can be found. A new necessary condition for reality of the…

We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…

We classify up to signature all the ways the alternating group $A_n$ can act on a compact Riemann surfaces when the quotient genus is greater than $0$. In particular, we prove that for $A_n$ with $n>6$ every potential signature for the…

We study spaces of lines that meet a smooth hypersurface X in P^n to high order. As an application, we give a polynomial upper bound on the number of planes contained in a smooth degree d hypersurface in P^5 and provide a proof of a result…

We consider the signature rank of the units in real multiquadratic fields. When the three quadratic subfields of a real biquadratic field $K$ either (a) all have signature rank 2 (that is, fundamental units of norm $-1$), or (b) all have…

We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…

We prove that for every natural number k there are simply connected topological four-manifolds which have at leat k distinct smooth structures supporting Einstein metrics, and also have infinitely many distinct smooth structures not…

This paper is an addition to the book [54] on Compact projective planes. Such planes, if connected and finite-dimensional, have a point space of topological dimension 2, 4, 8, or 16, the classical example in the last case being the…

We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$…

We prove that every set of n points in the plane has at most $(16+5/6)^n$ rectangulations. This improves upon a long-standing bound of Ackerman. Our proof is based on the cross-graph charging-scheme technique.

Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…

The purpose of this note is to show that $2K$ of any smooth compact complex two ball quotient is very ample, except possibly for four pairs of fake projective planes of minimal type, where $K$ is the canonical line bundle. For the four…

There exist knots having positive and negative four-dimensional clasp numbers zero but having four-genus, and hence clasp number, arbitrarily large. Such examples were first constructed by Allison Miller, answering a question of…

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

After surveying some known properties of compact convex sets in the plane, we give a two rigorous proofs of the general feeling that supporting lines can be slide-turned slowly and continuously. Targeting a wide readership, our treatment is…

A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and…

Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…