Multilinear forms which are products of linear forms
author
Abstract:
The conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. Also we generalize a result due to S.Kurepa for 2n-functionals in a group G.
similar resources
multilinear forms which are products of linear forms
the conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. also we generalize a result due to s.kurepa for 2n-functionals in a group g.
full textMultilinear forms
Proposition 1.1. α1, . . . , αn forms a basis for V ∗ (called the dual basis). In particular, this shows that V and V ∗ are vector spaces of the same dimension. However, there is no natural way to choose an isomorphism between them, unless we pick some additional structure on V (such as a basis or a nondegenerate bilinear form). On the other hand, we can construct an isomorphism ψ from V to (V ...
full textCongruence of Multilinear Forms
Let F : U × · · · × U → K, G : V × · · · × V → K be two n-linear forms with n > 2 on vector spaces U and V over a field K. We say that F and G are symmetrically equivalent if there exist linear bijections φ1, . . . , φn : U → V such that F (u1, . . . , un) = G(φi1u1, . . . , φinun) for all u1, . . . , un ∈ U and each reordering i1, . . . , in of 1, . . . , n. The forms are said to be congruent ...
full textSymmetric multilinear forms and polarization of polynomials
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in n variables. The main tool is combinatorial polarization, and the approach is applicable even when n! is not invertible in the underlying field.
full textApplications of Multilinear Forms to Cryptography
We study the problem of finding efficiently computable non-degenerate multilinear maps from G1 to G2, where G1 and G2 are groups of the same prime order, and where computing discrete logarithms in G1 is hard. We present several applications to cryptography, explore directions for building such maps, and give some reasons to believe that finding examples with n > 2
full textAlgebras of Multilinear Forms on Groups
For locally compact groups Gi, i = 1, 2, · · · , n, let CB(G1, · · · , Gn) denote the Banach space of completely bounded multilinear forms on C0(G1)×· · ·×C0(Gn) in the completely bounded norm. CB(G1, · · · , Gn) has the structure of a Banach ∗-algebra under a multiplication and adjoint operation which agree with the convolution structure on the measure algebra M(G1 ×· · ·×Gn). If the Gi are al...
full textMy Resources
Journal title
volume 5 issue 2
pages 123- 129
publication date 2014-07-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023