Related papers: Plane quartics over $\mathbb{Q}$ with complex mult…

Welschinger invariants enumerate real nodal rational curves in the plane or in another real rational surface. We analyze the existence of similar enumerative invariants that count real rational plane curves having prescribed non-nodal…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…

We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…

We investigate Zariski multiples of plane curves $Z_1, \dots, Z_N$ such that each $Z_i$ is a union of a smooth quartic curve, some of its bitangents, and some of its 4-tangent conics. We show that, for plane curves of this type, the…

We study plane curves over finite fields whose tangent lines at smooth $\mathbb{F}_q$-points together cover all the points of $\mathbb{P}^2(\mathbb{F}_q)$.

In this review paper we present a stable Lagrangian numerical method for computing plane curves evolution driven by the fourth order geometric equation. The numerical scheme and computational examples are presented.

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.

We give normal forms of determinantal representations of a smooth projective plane cubic in terms of Moore matrices. Building on this, we exhibit matrix factorizations for all indecomposable vector bundles of rank 2 and degree 0 without…

We study iteration maps of recurrence relations arising from mutation periodic quivers of arbitrary period. Combining tools from cluster algebra theory and (pre)symplectic geometry, we show that these cluster iteration maps can be reduced…

Using the results of Dalla Piazza, Fiorentino and Salvati Manni, we determine an explicit modular form defining the locus of plane quartics with a hyperflex among all plane quartics. As a result, we provide a direct way to compute the…

Nonsingular plane curves over a finite field $\mathbb{F}_q$ of degree $q+2$ passing through all the $\mathbb{F}_q$-points of the plane admita representation by $3\times 3$ matrices over $\mathbb{F}_q$. We classify their degenerations by…

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…

We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits…

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a…