Related papers: Computational Explorations on Semifields
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.
We determine the tensor rank of all semifields of order 16 over $\mathbb{F}_2$ and of all semifields of order 81 over $\mathbb{F}_3$. Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite…
The main contribution of this note is to establish a framework to extend results of tensor functions over specific field to general field. As a consequence of this framework, we extend the existing work to more general settings: \emph{(1)}…
In this paper we study finite dimensional algebras, in particular finite semifields, through their correspondence with nonsingular threefold tensors. We introduce a alternative embedding of the tensor product space into a projective space.…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…
A finite semifield is a finite nonassociative ring with identity such that the set of its nonzero elements is closed under the product. From any finite semifield a projective plane can be constructed. In this paper we obtain new semifield…
In this article we introduce the notion of the BEL-rank of a finite semifield, prove that it is an invariant for the isotopism classes, and give geometric and algebraic interpretations of this new invariant. Moreover, we describe an…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…