Results 241 to 250 of about 109,360 (279)

Note on Continuous Bilinear Mappings

Note on Continuous Bilinear Mappings
openaire  

Some of the next articles are maybe not open access.

Related searches:

Bilinear maps and graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio J. Calderón Martín, Francisco J. Navarro Izquierdo   +1 more
openaire   +3 more sources

On surjective bilinear mappings

Journal of Soviet Mathematics, 1992
See the review in Zbl 0742.15014.
openaire   +1 more source

Canonical Realization of Bilinear Input/Output Maps

SIAM Journal on Control and Optimization, 1979
The idea of extending the comprehensive theory of state space realization for linear systems to certain classes of nonlinear systems has been the subject of much recent research in mathematical system theory. One such class are those systems with a bilinear input/output map, first considered by Kalman [Pattern recognition properties of multi-linear ...
Pearlman, J. G., Denham, M. J.
openaire   +1 more source

Cocharacters of Bilinear Mappings and Graded Matrices

Algebras and Representation Theory, 2012
Let \(M_k(F)\) be the algebra of \(k\times k\) matrices over a field \(F\) of characteristic zero. Let \(G\) be any group, consider \(M_k(F)\) with the elementary grading induced by the \(k\)-tuple \((1,\ldots,1,g)\), where \(g\in G\), \(g^2\neq 1\). Then the graded identities of \(M_k(F)\) depending only on variables of homogeneous degrees \(g\) and \(
Aquè, Stefania, Giambruno, Antonio
openaire   +1 more source

Towards Ideal Self-bilinear Map

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018
Bilinear maps (also called pairings) have been used for constructing various kinds of cryptographic primitives including (but not limited to) short signatures, identity-based encryption, attribute-based encryption, and non-interactive zero-knowledge proof systems.
openaire   +1 more source

Arithmetic Garbling from Bilinear Maps

2019
We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation from predicate encryption which makes only blackbox calls to the underlying primitive.
Fleischhacker N., Malavolta G., Schroder D.   +2 more
openaire   +2 more sources

Definable invariants of bilinear mappings

Siberian Mathematical Journal, 1990
Elementary theories of bilinear mappings are studied. The interest in these questions is explained by the fact that different model-theoretic problems of algebra reduce largely to the corresponding problems for bilinear mappings. Bilinear mappings in rings arise most naturally --- the multiplication operation itself generates them.
openaire   +1 more source

Characterizations of compact bilinear maps

Linear and Multilinear Algebra, 1989
A factorization theorem for compact bilinear operators was given (Theorem 2.7) by Ramanujan and Schock in [5]. Their proof is not complete, and in fact the truth of the theorem as stated may be in doubt. In this paper, a similar theorem is stated and proved.
openaire   +1 more source