Results 251 to 260 of about 4,312,015 (293)

Representability of the direct sum of q-matroids

open access: yesJournal of Algebraic Combinatorics
While there are many parallels between matroid theory and q-matroid theory, most notably on the level of cryptomorphisms, there are substantial differences when it comes to the direct sum.
Heide Gluesing-Luerssen
exaly   +7 more sources
Some of the next articles are maybe not open access.

Related searches:

On the Validity of the Direct Sum Conjecture

SIAM Journal on Computing, 1986
The direct sum conjecture states that the multiplicative complexity of disjoint sets of bilinear computations is the sum of their separate multiplicative complexities. This conjecture is known to hold for only a few specialized cases. In this paper, we establish its validity for large classes of computations.
Jean Takche
exaly   +4 more sources

Sum and direct sum of frame sequences

Linear and Multilinear Algebra, 2013
Casazza, Han and Larson characterized various properties of the direct sum of two frame sequences. We add characterizations of other properties and study the relationship between the direct sum and the sum of frame sequences. In particular, we find a necessary and sufficient condition for the sum of two strongly disjoint (orthogonal) frame sequences ...
Jae Kun Lim, Yoo Young Koo
exaly   +2 more sources

Direct sums of Rickart modules

open access: yesJournal of Algebra, 2012
A right \(R\)-module \(M\) with endomorphism ring \(S=\text{End}_R(M)\) is called a Rickart module if the right annihilator in \(M\) of any single element of \(S\) is a direct summand of \(M\). In general, the class of Rickart modules is not closed under direct sums, and it is interesting to study when it has this closure property.
Gangyong Lee   +2 more
exaly   +3 more sources

The direct sum of universal relations

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A note on direct sums of Friedbergnumberings

Journal of Symbolic Logic, 1989
We show that a translator ƒ: ω → ω from a Gödelnumbering φ into a direct sum η of a r.e. family of Friedbergnumberings satisfies ƒ ≰T0′. In particular, η cannot be a Gödelnumbering.In the following we use standard notation (cf.[3]): for i ≥ 1, Pi (respectively, Ri) is the set of partial (total) recursive i-place functions; φ is a Gödel numbering of P1.
openaire   +3 more sources

Compressions and direct sums

Advances in Operator Theory, 2023
Let \(A\) be a square matrix partitioned as follows: \[ A = \left[ \begin{array}{cc} B & C \\ D & E \end{array} \right]. \] The authors study several sufficient conditions on \(A\) to assure that \(A\) is a direct sum of \(B\) and \(C\), i.e., \(C=0\) and \(D=0\).
Hwa-Long Gau, Pei Yuan Wu
openaire   +1 more source

On a direct sum of irreducible groups

Mathematical Notes, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Direct sums of ADS* modules

Boletín de la Sociedad Matemática Mexicana, 2015
Let \(R\) be an associative ring with an identity element. A unital right \(R\)-module \(M\) is called ADS* if for any direct summand \(N\) of \(M\) and any supplement \(K\) of \(N\) in \(M\) one has \(M=N\oplus K\). The aim of this paper is to investigate direct sums of ADS* modules. First, the authors provide a bunch of examples of ADS* modules whose
KESKİN TÜTÜNCÜ, DERYA   +2 more
openaire   +3 more sources

On the extended direct sum conjecture

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89, 1989
We consider the quadratic complexity of certain sets of quadratic forms. We study a classes of direct sums of quadratic forms. For these classes of problems we show that the complexity of one direct sum is the sum of the complexity of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.
openaire   +1 more source

Home - About - Disclaimer - Privacy