Results 1 to 10 of about 9,142 (160)

Structure vs Randomness for Bilinear Maps [PDF]

open access: yesDiscrete Analysis, 2022
Structure vs randomness for bilinear maps, Discrete Analysis 2022:12, 21 pp. A _tensor_ can be thought of as a higher-dimensional analogue of a matrix (where a matrix is 2-dimensional).
Guy Moshkovitz, Alex Cohen
doaj   +3 more sources

On extensions of bilinear maps

open access: yesMathematica Slovaca, 2022
Abstract The paper deals with extension of bounded bilinear maps. It gives a necessary and sufficient condition for extending a bounded bilinear map on the Cartesian product of subspaces of Banach spaces. This leads to a full characterization for extension of bounded bilinear maps on the Cartesian product of arbitrary subspaces of ...
CARLOS S Kubrusly
exaly   +4 more sources

Downscaling the spatial resolution of satellite imagery based on morphometric parameters to estimate the Topographic Wetness Index using GIS tools [PDF]

open access: yesScientific Reports
Digital elevation models (DEMs) play a key role in extracting morphometric factors like fill sink, flow accumulation, profile, flow width, slope, plan curvature, aspect, and total catchment to estimate the Topographic Wetness Index (TWI) that provides ...
Haider Shabbir   +6 more
doaj   +2 more sources

Division, Adjoints, and Dualities of Bilinear Maps [PDF]

open access: yesCommunications in Algebra, 2013
The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the adjoint category is not a module category but nevertheless it is suitably familiar.
James B Wilson
exaly   +3 more sources

On orthosymmetric bilinear maps

open access: yesPositivity, 2009
In this paper the author proves, among other things, the following two result: the first one states that if \(A\) is an Archimedean almost \(f\)-algebra and if \(D\) is an order-bounded derivation on \(A\), then \(D(abc)=0\) and \((D(ab))^3=0\) for all \(a, b, c \in A\). This result has been obtained independently by \textit{A. Toumi} and \textit{M. A.
exaly   +8 more sources

Color Image Encryption Based on 3D-SBFCM with Dynamic Rectangular Partitioning and Dynamic S-Box Substitution [PDF]

open access: yesEntropy
Existing chaos-based color image encryption algorithms still face several challenges, including insufficient dynamical complexity of low-dimensional chaotic maps, residual boundary regularity caused by fixed block partitioning, and limited diffusion ...
Ting Wang   +4 more
doaj   +2 more sources

Bilinear cryptography using Lie algebras from p-groups [PDF]

open access: yesMathematics and Computational Sciences, 2021
Pairings are particular bilinear maps, and they have been defined based on elliptic curves whichare abelian groups. In cryptography and security problems use these pairings. Mrabet et al. proposedpairings from a tensor product of groups in 2013.
Elaheh Khamseh
doaj   +1 more source

Three Representation Types for Systems of Forms and Linear Maps

open access: yesMathematics, 2021
We consider systems of bilinear forms and linear maps as representations of a graph with undirected and directed edges. Its vertices represent vector spaces; its undirected and directed edges represent bilinear forms and linear maps, respectively.
Abdullah Alazemi   +4 more
doaj   +1 more source

Growth of bilinear maps [PDF]

open access: yesLinear Algebra and its Applications, 2021
12 pages, 1 figure; several minor revisions before ...
openaire   +2 more sources

Nonsingular bilinear maps revisited [PDF]

open access: yesProceedings of the Royal Society of Edinburgh: Section A Mathematics, 2020
AbstractA bilinear map $\varPhi :\mathbb {R}^r\times \mathbb {R}^s\to \mathbb {R}^n$ is nonsingular if $\varPhi (\overrightarrow {a},\overrightarrow {b})=\overrightarrow {0}$ implies $\overrightarrow {a}=\overrightarrow {0}$ or $\overrightarrow {b}=\overrightarrow {0}$.
Domínguez, Carlos, Lam, Kee Yuen
openaire   +3 more sources

Home - About - Disclaimer - Privacy