Related papers: Plane quartics over $\mathbb{Q}$ with complex mult…
Aronhold's classical result states that a plane quartic can be recovered by the configuration of any Aronhold systems of bitangents, i.e. special 7-tuples of bitangents such that the six points at which any subtriple of bitangents touches…
In this paper, we characterize the polynomiality of surfaces of revolution by means of the polynomiality of an associated plane curve. In addition, if the surface of revolution is polynomial, we provide formulas for computing a polynomial…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
We study new families of curves that are suitable for efficiently parametrizing their moduli spaces. We explicitly construct such families for smooth plane quartics in order to determine unique representatives for the isomorphism classes of…
A plane curve $C$ in $\mathbb{P}^2$ defined over $\mathbb{F}_q$ is called plane-filling if $C$ contains every $\mathbb{F}_q$-point of $\mathbb{P}^2$. Homma and Kim, building on the work of Tallini, proved that the minimum degree of a smooth…
We give a conjectural characterisation of the stable reduction of plane quartics over local fields in terms of their Cayley octads. This results in p-adic criteria that efficiently give the stable reduction type amongst the 42 possible…
We study the geometry of spaces of planes on smooth complete intersections of three quadrics, with a view toward rationality questions.
In this paper, we give a Zariski triple of the arrangements for a smooth quartic and its four bitangents. A key criterion to distinguish the topology of such curves is given by a matrix related to the height pairing of rational points…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
In the present paper we study the geometry of plane quartics with large automorphism groups. We show results devoted to smooth plane quartics that are invariant under the action of the elementary abelian group of type $[2,2,2]$, and we…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We study smooth tropical plane quartic curves and show that they satisfy certain properties analogous to (but also different from) smooth plane quartics in algebraic geometry. For example, we show that every such curve admits either…
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
In this paper we consider the following problem: is it possible to recover a smooth plane curve of degree at least three from its inflection lines? We answer positively to the posed question for a general smooth plane quartic curve, making…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is…
We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves $S^1 \to R^2$. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…