相关论文: Partial Degree Formulae for Plane Offset Curves

The `linear orbit' of a plane curve of degree d is its orbit in P^{d(d+3)/2} under the natural action of PGL(3). We classify curves with positive dimensional stabilizer, and we compute the degree of the closure of the linear orbits of…

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

We discuss some research problems on affine monomial curves, from the perspective of computation.

We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.

The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…

We show that although the fundamental group of the complement of an algebraic affine plane curve is not easy to compute, it possesses a more accessible quotient, which we call the Orevkov invariant.

We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a…

We develop a theory and an algorithm for constructing minimal-degree polynomial moving frames for polynomial curves in an affine space. The algorithm is equivariant under volume-preserving affine transformations of the ambient space and the…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…

Given a curve over a finite field, we compute the number of stable bundles of not necessarily coprime rank and degree over it. We apply this result to compute the virtual Poincare polynomials of the moduli spaces of stable bundles over a…

We provide a tool how one can view a polynomial on the affine plane of bidegree $(a,b)$ - by which we mean that its Newton polygon lies in the triangle spanned by $(a,0)$, $(0,b)$ and the origin - as a curve in a Hirzebruch surface having…

We are interested in the study of caustics by reflection of irreducible algebraic planar curves (in the complex projective plane). We prove the birationality of the caustic map (for a generic light position). We also give simple formulas…

We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…

We present some results concerning the Saito module and the torsion submodule of an analytic plane curve, and we provide a method for computing them. Using this algorithm, we compute analytic invariants for plane curves with multiplicity…

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…