相关论文: On algorithms to obtain linear determinantal repre…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
In this note, we study linear determinantal representations of smooth plane cubics over finite fields. We give an explicit formula of linear determinantal representations corresponding to rational points. Using Schoof's formula, we count…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
We give examples of smooth plane quartics over $\mathbb{Q}$ with complex multiplication over $\overline{\mathbb{Q}}$ by a maximal order with primitive CM type. We describe the required algorithms as we go, these involve the reduction of…
We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
Can a smooth plane cubic be defined by the determinant of a square matrix with entries in linear forms in three variables? If we can, we say that it admits a linear determinantal representation. In this paper, we investigate linear…
We study the arithmetic of bitangents of smooth quartics over global fields. With the aid of computer algebra systems and using Elsenhans--Jahnel's results on the inverse Galois problem for bitangents, we show that, over any global field of…
We prove that the defining equations of the Fermat curves of prime degree cannot be written as the determinant of symmetric matrices with entries in linear forms in three variables with rational coefficients. In the proof, we use a relation…
The discriminant of a smooth plane cubic curve over the complex numbers can be written as a product of theta functions. This provides an important connection between algebraic and analytic objects. In this paper, we perform a new approach…
We provide explicit equations of some smooth complex quartic surfaces with many lines, including all 10 quartics with more than 52 lines. We study the relation between linear automorphisms and some configurations of lines such as twin lines…
A smooth plane curve is said to admit a symmetric determinantal representation if it can be defined by the determinant of a symmetric matrix with entries in linear forms in three variables. We study the local-global principle for the…
In this paper we consider plane quartics with to involutions. We compute the Dixmier invariants, the bitangents and the Matrix representation problem of these curves, showing that they have symbolic solutions for the last two questions.
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and…
We show that the classical Fermat quartic has exactly three smooth spatial models. As a generalization, we give a classification of smooth spatial (as well as some other) models of singular $K3$-surfaces of small discriminant. As a…
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 describe the Hilbert scheme components parametrizing lines and conics on the space of determinantal nets of conics, N. As an application, we use the quantum Lefschetz hyperplane principle to compute the instanton numbers of rational…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number…