A graph-theoretical notation for array concatenation represents arrays as bubbles with arms sticking out, each arm with a specified number of “fingers. ” Bub-bles with one arm are vectors, with two arms ma-trices, etc. Arrays can only hold hands, i.e., “con-tract ” along a given pair of arms, if the arms have the same number of fingers. There are three array concatenations: outer product, contraction, and di-rect sum. Special arrays are the unit vectors and the diagonal array, which is the branching point of sev-eral arms. Outer products and contractions are inde-pendent of the order in which they are performed and distributive with respect to the direct sum. Examples are given where this notation clarifies mathematical proofs.
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
We present an extension to the quantifier-free theory of integer arrays which allows us to express c...
AbstractWe produce a concise description of Sakata's algorithm for finding recursion relations that ...
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. Th...
The automatic transformation of sequential programs for efficient execution on parallel computers in...
The ability to describe array expressions in terms of the shapes of their arguments and the symbolic...
Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as num...
this report, we prove two NP-complete results that characterize precisely the problem and we give a...
An intuitive and user-friendly notation based on a diagrammatical way to visualize and manipulate N-...
Polygonal array graphs have been widely investigated, and they represent a relevant area of interest...
Abstract Array Algorithms are defined as functional algorithms where each step of the algorithm resu...
Triangular arrays display coefficients of polynomials in a way that allows mathematicians to find an...
The language of an array grammar has been defined as the set of finite, connected terminal arrays, s...
AbstractIn response to some recent questions of L.W. Shapiro, we develop a theory of triangular arra...
This paper develops a systematic way to fill any m-by-n numerical array where the row and column con...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
We present an extension to the quantifier-free theory of integer arrays which allows us to express c...
AbstractWe produce a concise description of Sakata's algorithm for finding recursion relations that ...
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. Th...
The automatic transformation of sequential programs for efficient execution on parallel computers in...
The ability to describe array expressions in terms of the shapes of their arguments and the symbolic...
Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as num...
this report, we prove two NP-complete results that characterize precisely the problem and we give a...
An intuitive and user-friendly notation based on a diagrammatical way to visualize and manipulate N-...
Polygonal array graphs have been widely investigated, and they represent a relevant area of interest...
Abstract Array Algorithms are defined as functional algorithms where each step of the algorithm resu...
Triangular arrays display coefficients of polynomials in a way that allows mathematicians to find an...
The language of an array grammar has been defined as the set of finite, connected terminal arrays, s...
AbstractIn response to some recent questions of L.W. Shapiro, we develop a theory of triangular arra...
This paper develops a systematic way to fill any m-by-n numerical array where the row and column con...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
We present an extension to the quantifier-free theory of integer arrays which allows us to express c...
AbstractWe produce a concise description of Sakata's algorithm for finding recursion relations that ...