Results 31 to 40 of about 322,239 (148)
Asymptotically fast group operations on Jacobians of general curves
Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$.
Khuri-Makdisi, Kamal
core +2 more sources
Zero Triple Product Determined Matrix Algebras
Let A be an algebra over a commutative unital ring C. We say that A is zero triple product determined if for every C-module X and every trilinear map {⋅,⋅,⋅}, the following holds: if {x,y,z}=0 whenever xyz=0, then there exists a C-linear operator T:A3⟶X ...
Hongmei Yao, Baodong Zheng
doaj +1 more source
Biderivations and linear commuting maps on simple generalized Witt algebras over a field
Let $\mathfrak{W}$ be a simple generalizedWitt algebras over a field of characteristic zero. In this paper, weprove that each anti-symmetric biderivation of $\mathfrak{W}$ isinner. As an application of biderivations, we show that a linear map$\psi$ on $\mathfrak{W}$ is commuting if and only if $\psi$ is ascalar multiplication map on $\mathfrak{W}$. The
openaire +2 more sources
Monomial codes seen as invariant subspaces
It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known.
García-Planas María Isabel +2 more
doaj +1 more source
The symplectic ideal and a double centraliser theorem
Let G be a reductive connected linear algebraic group over an algebraically closed field of positive characteristic and let g be its Lie algebra. First we correct and generalise a well-known result about the Picard group of G.
Tange, Rudolf
core +3 more sources
Introduction . One of the tasks arising in cryptography is to ensure the safe and honest conduct of e-voting. This procedure provides that voters submit their votes electronically - for example, through electronic terminals.
Larisa V. Cherkesova +3 more
doaj +1 more source
Extended binary Golay codes by a group algebra of one group
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary self-dual codes with Hamming distance between arbitrary codewords which are multiples of 4 that has the highest possible minimum Hamming distance among ...
М. Ю. Бортош +1 more
doaj +1 more source
Wiedemann's paper, introducing his algorithm for sparse and structured matrix computations over arbitrary fields, also presented a pair of matrix preconditioners for computations over small fields. The analysis of the second of these is extended here in order to provide more explicit statements of the expected number of nonzero entries in the matrices ...
openaire +2 more sources
Distinguished principal series representations for GLn over a p-adic field [PDF]
In the following article, we give a description of the distingushed irreducible principal series representations of the general linear group over a p-adic field in terms of inducing datum.
Matringe, Nadir
core +2 more sources
Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or ...
A Kehrein +19 more
core +2 more sources

