Add to ORKGLet R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder-- Strassen bound R(A) 2 dim A \Gamma t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder--Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebraic complexity theory
AbstractA relatively compressed algebra with given socle degrees is an Artinian quotient A of a give...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the...
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative alge...
AbstractIf A is a finite-dimensional associative k-algebra with unit, then its rank R(A), i.e. its b...
AbstractA famous lower bound for the bilinear complexity of the multiplication in associative algebr...
AbstractDenote the rank ( = bilinear multiplicative complexity) of an associative k-algebra A by R(A...
Let $(A, *)$ be an associative algebra with involution over a field $F$ of characteristic zero, $T_...
Let A be a semisimple Banach algebra. We define the rank of a nonzero element a in the socle of A to...
AbstractThe exponent of a variety of algebras over a field of characteristic zero has been recently ...
This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of mon...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F) is the ...
Let $\mathcal{V}$ be a variety of associative algebras generated by an algebra with $1$ over a fie...
AbstractOur main result is a sharp bound for the number of vertices in a minimal forbidden subgraph ...
AbstractA relatively compressed algebra with given socle degrees is an Artinian quotient A of a give...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the...
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative alge...
AbstractIf A is a finite-dimensional associative k-algebra with unit, then its rank R(A), i.e. its b...
AbstractA famous lower bound for the bilinear complexity of the multiplication in associative algebr...
AbstractDenote the rank ( = bilinear multiplicative complexity) of an associative k-algebra A by R(A...
Let $(A, *)$ be an associative algebra with involution over a field $F$ of characteristic zero, $T_...
Let A be a semisimple Banach algebra. We define the rank of a nonzero element a in the socle of A to...
AbstractThe exponent of a variety of algebras over a field of characteristic zero has been recently ...
This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of mon...
AbstractWe introduce a new and easily applicable criterion called rank immunity for estimating the m...
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F) is the ...
Let $\mathcal{V}$ be a variety of associative algebras generated by an algebra with $1$ over a fie...
AbstractOur main result is a sharp bound for the number of vertices in a minimal forbidden subgraph ...
AbstractA relatively compressed algebra with given socle degrees is an Artinian quotient A of a give...
AbstractAlgebraic schemes of computation of bilinear forms over various rings of scalars are examine...
The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the...