Related papers: Logarithmic derivations associated to line arrange…
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. In…
Let K be a field of characteristic zero. We describe an algorithm which requires a homogeneous polynomial F of degree three in K[x_0,x_1,x_2,x_3] and a zero A of F in P^3_K and ensures a linear pfaffian representation of V(F) with entries…
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
We show that mixed-characteristic and equi-characteristic small deformations of 3-dimensional canonical (resp. terminal) singularities with perfect residue field of characteristic $p>5$ are canonical (resp. terminal). We discuss…
The paper purposes to contribute to the classification of pointed Hopf algebras by the method of Andruskiewitsch and Schneider. The structure of arithmetic root systems is enlightened such that their relation to ordinary root systems…
This article deals with the irreducible components of the space of codimension one foliations in a projective space defined by logarithmic forms of a certain degree. We study the geometry of the natural parametrization of the logarithmic…
We determine all of lines in the moduli space $M$ of stable bundles for arbitrary rank and degree. A further application of minimal rational curves is also given in last section.
To each multiple point $p$ in a line arrangement $ \mathcal A$ in the complex projective plane we associate a local derivation $\tilde D_p \in D_0( \mathcal A)$. We show first that these derivations span the graded module of derivations…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
The ground field in the text is of characteristic 2. The classification of modulo 2 gradings of simple Lie algebras is vital for the classification of simple finite-dimensional Lie superalgebras: with each grading, a simple Lie superalgebra…
We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More precisely, we show that the minimal degree of a Jacobian…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
For fields with more than $2$ elements, the classification of the vector spaces of matrices with rank at most $2$ is already known. In this work, we complete that classification for the field $\mathbb{F}_2$. We apply the results to obtain…
In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen…
We describe several randomized collections of $3\times 3$ rotation matrices and analyze their associated logarithmic energy. The best one (i.e. the one attaining the lowest expected logarithmic energy) is constructed by choosing $r$…
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…