Search

Haagerup’s proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded maps may be used to show that the commutative Grothendieck inequality follows from the little commutative inequality, and that this passage may be given a geometric form as a relation between a pair of compact convex sets of positive matrices, which, in turn, characterizes the little constant kCG., Haagerup's proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded maps may be used to show that the commutative Grothendieck inequality follows from the little commutative inequality, and that this passage may be given a geometric form as a relation between a pair of compact convex sets of positive matrices, which, in turn, characterizes the little constant kGC.

Haagerup’s proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded maps may be used to show that the commutative Grothendieck inequality follows from the little commutative inequality, and that this passage may be given a geometric form as a relation between a pair of compact convex sets of positive matrices, which, in turn, characterizes the little constant kCG., Haagerup's proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded maps may be used to show that the commutative Grothendieck inequality follows from the little commutative inequality, and that this passage may be given a geometric form as a relation between a pair of compact convex sets of positive matrices, which, in turn, characterizes the little constant kGC.

Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. The latter can be seen as a generalisation of matrix rank, being the minimum number of terms a tensor can be decomposed as. However, in contrast to matrix rank there is no general method of computing tensor ranks, with many values being unknown for important three-dimensional tensors. To further improve the theoretical bounds of the time complexity of matrix multiplication, support rank of tensors has been introduced, which is the lowest rank of tensors with the same support in some basis. The goal of this master's thesis has been to go through the history of faster matrix multiplication, as well as specifically examining the properties of support rank for general tensors. In regards to the latter, a complete classification of rank structures of support classes is made for the smallest non-degenerate tensor product space in three dimensions. From this, the size of a support can be seen affecting the pool of possible ranks within a support class. At the same time, there is in general no symmetry with regards to support size occurring in the rank structures of the support classes, despite there existing a symmetry and bijection between mirrored supports. Discussions about how to classify support rank structures for larger tensor product spaces are also included., Från och med forskning gjord av Volker Strassen har flera algoritmer för matrismultiplikation utvecklats som är effektivare visavi tidskomplexitet än standardalgoritmen som utgår från defintionen av multiplikation. Generellt sett har metoden varit att se den bilinjära avbildningen som matrismultiplikation är som en tredimensionell tensor. Där används att det finns en exakt korrespondens mellan multiplikationsalgoritmens tidskomplexitet och tensorrang. Det sistnämnda är ett slags generalisering av matrisrang, och är minsta antalet termer en tensor kan skrivas som. Till skillnad frpn matrisrang finns ingen allmän metod för att beräkna tensorrang, och många värden är okända även för välstuderade och viktiga tensorer. För att hitta fler övre begränsningar på matrismultiplikations tidskomplexitet har stödrang av tensorer införts, som är den lägsta rangen bland tensor med samma stöd i en viss bas. Målet med detta examensarbete har varit att göra en genomgång av historien om snabbare matrismultiplikation, samt att specifikt undersöka egenskaper av stödrang för allmänna tredimensionella tensorer. För det sistnämnda görs en fullständig klassificering av rangstrukturer bland stödklasser för den minsta icke-degenererade tensorprodukten av tre vektorrum. Slutsatser är bl.a. att storleken av ett stöd kan ses påverka antalet möjliga ranger inom en stödklass. Samtidigt finns i allmänhet ingen symmetri med avseende på stödstorlek i stödklassernas rangstrukturer. Detta trots att det finns en symmetri och bijektion mellan speglade stöd. I arbetet ingår även en diskussion om hur stödrangstrukturer skulle kunna klassificeras för större tensorprodukter.

We establish interpolation formulae for operator spaces that are components of a given quasi-normed operator ideal., DGES, Ministerio de Educación y Ciencia, Depto. de Análisis Matemático y Matemática Aplicada, Fac. de Ciencias Matemáticas, TRUE, pub

Using elementary techniques, an algorithmic procedure to construct skew-symmetric matrices realizing the real irreducible representations of so(3) is developed. We further give a simple criterion that enables one to deduce the decomposition of an arbitrary real representation R of so(3) into real irreducible components from the characteristic polynomial of an arbitrary representation matrix., Ministerio de Economía y Competitividad (MINECO), Depto. de Álgebra, Geometría y Topología, Fac. de Ciencias Matemáticas, Instituto de Matemática Interdisciplinar (IMI), TRUE, pub

We study the extension of bilinear and multilinear forms from a given subspace of a Banach space to the whole space. Precisely, an isomorphic embedding j : E --> X is said to be (linearly) N-exact if N-linear forms on E can be (linear and continuously) extended to X through j. We present some necessary and sufficient conditions for j to be 2-exact, as well as several examples of 2-exact embeddings. We answer a problem of Zalduendo: in a cotype 2 space bilinear extendable and integral forms coincide., DGICYT, Depto. de Análisis Matemático y Matemática Aplicada, Fac. de Ciencias Matemáticas, TRUE, pub

Dedicated to the memory of Klaus Floret (1941-2002), Here we show how, in the general context of locally convex spaces, it is possible to get an n-tensor topology (on spaces of n-tensor products) from an n-tensor topology on spaces of symmetric n-tensors products. Indeed, given an n-tensor topology on the spaces of symmetric n-tensor products we construct an n-tensor topology on the spaces of all n-tensor products whose restriction to the symmetric ones gives the original topology. Moreover, we prove that when one starts with an n-tensor topology, restricts it to symmetric tensors and then extends it, the original topology is obtained when it is symmetric, and we also obtain some results on complementation with applications to spaces of polynomials. Part of these results generalize to the context of locally convex spaces some Floret's results in [17] and [18]., Depto. de Análisis Matemático y Matemática Aplicada, Fac. de Ciencias Matemáticas, TRUE, pub

Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. The latter can be seen as a generalisation of matrix rank, being the minimum number of terms a tensor can be decomposed as. However, in contrast to matrix rank there is no general method of computing tensor ranks, with many values being unknown for important three-dimensional tensors. To further improve the theoretical bounds of the time complexity of matrix multiplication, support rank of tensors has been introduced, which is the lowest rank of tensors with the same support in some basis. The goal of this master's thesis has been to go through the history of faster matrix multiplication, as well as specifically examining the properties of support rank for general tensors. In regards to the latter, a complete classification of rank structures of support classes is made for the smallest non-degenerate tensor product space in three dimensions. From this, the size of a support can be seen affecting the pool of possible ranks within a support class. At the same time, there is in general no symmetry with regards to support size occurring in the rank structures of the support classes, despite there existing a symmetry and bijection between mirrored supports. Discussions about how to classify support rank structures for larger tensor product spaces are also included., Från och med forskning gjord av Volker Strassen har flera algoritmer för matrismultiplikation utvecklats som är effektivare visavi tidskomplexitet än standardalgoritmen som utgår från defintionen av multiplikation. Generellt sett har metoden varit att se den bilinjära avbildningen som matrismultiplikation är som en tredimensionell tensor. Där används att det finns en exakt korrespondens mellan multiplikationsalgoritmens tidskomplexitet och tensorrang. Det sistnämnda är ett slags generalisering av matrisrang, och är minsta antalet termer en tensor kan skrivas som. Till skillnad frpn matrisrang finns ingen allmän metod för att beräkna tensorrang, och många värden är okända även för välstuderade och viktiga tensorer. För att hitta fler övre begränsningar på matrismultiplikations tidskomplexitet har stödrang av tensorer införts, som är den lägsta rangen bland tensor med samma stöd i en viss bas. Målet med detta examensarbete har varit att göra en genomgång av historien om snabbare matrismultiplikation, samt att specifikt undersöka egenskaper av stödrang för allmänna tredimensionella tensorer. För det sistnämnda görs en fullständig klassificering av rangstrukturer bland stödklasser för den minsta icke-degenererade tensorprodukten av tre vektorrum. Slutsatser är bl.a. att storleken av ett stöd kan ses påverka antalet möjliga ranger inom en stödklass. Samtidigt finns i allmänhet ingen symmetri med avseende på stödstorlek i stödklassernas rangstrukturer. Detta trots att det finns en symmetri och bijektion mellan speglade stöd. I arbetet ingår även en diskussion om hur stödrangstrukturer skulle kunna klassificeras för större tensorprodukter.

Categorical aspects of the theory of modules over trusses are studied. Tensor product of modules over trusses is defined and its existence established. In particular, it is shown that bimodules over trusses form a monoidal category. Truss versions of the Eilenberg-Watts theorem and Morita equivalence are formulated. Projective and small-projective modules over trusses are defined and their properties studied., SCOPUS: ar.j, info:eu-repo/semantics/inPress

Large agricultural field trials may display irregular spatial trends that cannot be fully captured by a purely randomization-based analysis. For this reason, paralleling the development of analysis-of-variance procedures for randomized field trials, there is a long history of spatial modeling for field trials, starting with the early work of Papadakis on nearest neighbor analysis, which can be cast in terms of first or second differences among neighboring plot values. This kind of spatial modeling is amenable to a natural extension using splines, as has been demonstrated in recent publications in the field. Here, we consider the P-spline framework, focusing on model options that are easy to implement in linear mixed model packages. Two examples serve to illustrate and evaluate the methods. A key conclusion is that first differences are rather competitive with second differences. A further key observation is that second differences require special attention regarding the representation of the null space of the smooth terms for spatial interaction, and that an unstructured variance–covariance structure is required to ensure invariance to translation and rotation of eigenvectors associated with that null space. We develop a strategy that permits fitting this model with ease, but the approach is more demanding than that needed for fitting models using first differences. Hence, even though in other areas, second differences are very commonly used in the application of P-splines, our conclusion is that with field trials, first differences have advantages for routine use.

We study the tensor product decomposition of the split real quantum group Uqq~(sl(2 , R)) from the perspective of finite-dimensional representation theory of compact quantum groups. It is known that the class of positive representations of Uqq~(sl(2 , R)) is closed under taking tensor product. In this paper, we show that one can derive the corresponding Hilbert space decomposition, given explicitly by quantum dilogarithm transformations, from the Clebsch-Gordan coefficients of the tensor product decomposition of finite-dimensional representations of the compact quantum group Uq(sl2) by solving certain functional equations arising from analytic continuation and using normalization arising from tensor products of canonical basis.

[EN] Using some representation results for Kothe-Bochner spaces of vector valued functions by means of vector measures, we analyze the maximal extension for some classes of linear operators acting in these spaces. A factorization result is provided, and a specific representation of the biggest vector valued function space to which the operator can be extended is given. Thus, we present a generalization of the optimal domain theorem for some types of operators on Banach function spaces involving domination inequalities and compactness. In particular, we show that an operator acting in Bochner spaces of p-integrable functions for any 1

We study the tensor product decomposition of the split real quantum group Uqq~(sl(2 , R)) from the perspective of finite-dimensional representation theory of compact quantum groups. It is known that the class of positive representations of Uqq~(sl(2 , R)) is closed under taking tensor product. In this paper, we show that one can derive the corresponding Hilbert space decomposition, given explicitly by quantum dilogarithm transformations, from the Clebsch-Gordan coefficients of the tensor product decomposition of finite-dimensional representations of the compact quantum group Uq(sl2) by solving certain functional equations arising from analytic continuation and using normalization arising from tensor products of canonical basis.

We prove that the tensor product of a simple and a finite dimensional sln-module has finite type socle. This is applied to reduce classification of simple q(n)-supermodules to that of simple sln-modules. Rough structure of simple q(n)-supermodules, considered as sln-modules, is described in terms of the combinatorics of category O.

We prove that the tensor product of a simple and a finite dimensional sln-module has finite type socle. This is applied to reduce classification of simple q(n)-supermodules to that of simple sln-modules. Rough structure of simple q(n)-supermodules, considered as sln-modules, is described in terms of the combinatorics of category O.

We prove that the tensor product of a simple and a finite dimensional sln-module has finite type socle. This is applied to reduce classification of simple q(n)-supermodules to that of simple sln-modules. Rough structure of simple q(n)-supermodules, considered as sln-modules, is described in terms of the combinatorics of category O.

We prove that the tensor product of a simple and a finite dimensional sln-module has finite type socle. This is applied to reduce classification of simple q(n)-supermodules to that of simple sln-modules. Rough structure of simple q(n)-supermodules, considered as sln-modules, is described in terms of the combinatorics of category O.

We study the tensor product decomposition of the split real quantum group Uqq~(sl(2 , R)) from the perspective of finite-dimensional representation theory of compact quantum groups. It is known that the class of positive representations of Uqq~(sl(2 , R)) is closed under taking tensor product. In this paper, we show that one can derive the corresponding Hilbert space decomposition, given explicitly by quantum dilogarithm transformations, from the Clebsch-Gordan coefficients of the tensor product decomposition of finite-dimensional representations of the compact quantum group Uq(sl2) by solving certain functional equations arising from analytic continuation and using normalization arising from tensor products of canonical basis.

Contextuality is a key signature of quantum non-classicality, which has been shown to play a central role in enabling quantum advantage for a wide range of information-processing and computational tasks. We study the logic of contextuality from a structural point of view, in the setting of partial Boolean algebras introduced by Kochen and Specker in their seminal work. These contrast with traditional quantum logic à la Birkhoff and von Neumann in that operations such as conjunction and disjunction are partial, only being defined in the domain where they are physically meaningful. We study how this setting relates to current work on contextuality such as the sheaf-theoretic and graph-theoretic approaches. We introduce a general free construction extending the commeasurability relation on a partial Boolean algebra, i.e. the domain of definition of the binary logical operations. This construction has a surprisingly broad range of uses. We apply it in the study of a number of issues, including: - establishing the connection between the abstract measurement scenarios studied in the contextuality literature and the setting of partial Boolean algebras; - formulating various contextuality properties in this setting, including probabilistic contextuality as well as the strong, state-independent notion of contextuality given by Kochen-Specker paradoxes, which are logically contradictory statements validated by partial Boolean algebras, specifically those arising from quantum mechanics; - investigating a Logical Exclusivity Principle, and its relation to the Probabilistic Exclusivity Principle widely studied in recent work on contextuality as a step towards closing in on the set of quantum-realisable correlations; - developing some work towards a logical presentation of the Hilbert space tensor product, using logical exclusivity to capture some of its salient quantum features.

The X-rank of a point p in projective space is the minimal number of points of an algebraic variety X whose linear span contains p. This notion is naturally submultiplicative under tensor product. We study geometric conditions that guarantee strict submultiplicativity. We prove that in the case of points of rank two, strict submultiplicativity is entirely characterized in terms of the trisecant lines to the variety. Moreover, we focus on the case of curves: we prove that for curves embedded in an even-dimensional projective space, there are always points for which strict submultiplicativity occurs, with the only exception of rational normal curves.

We prove that the tensor product of a simple and a finite dimensional sln-module has finite type socle. This is applied to reduce classification of simple q(n)-supermodules to that of simple sln-modules. Rough structure of simple q(n)-supermodules, considered as sln-modules, is described in terms of the combinatorics of category O.

Given two m x n matrices A = (aij) and B = (bij) with entries in B(H) for some Hilbert space H, the Schur block product is the m x n matrix A□B:= (aijbij). There exists an mxn matrix S = (sij) with entries from B(H) such that S is a contraction operator and The analogus result for the block Schur tensor product defined by Horn and Mathias in [7] holds too. This kind of decomposition of the Schur product seems to be unknown, even for scalar matrices. Based on the theory of random matrices we show that the set of contractions S, which may appear in such a decomposition, is a thin set in the ball of all contractions.

We construct a unital locally matrix algebra of uncountable dimension that (1) does not admit a primary decomposition, (2) has an infinite locally finite Steinitz number. It gives negative answers to questions from [V. M. Kurochkin, On the theory of locally simple and locally normal algebras, Mat. Sb., Nov. Ser. 22(64)(3) (1948) 443–454; O. Bezushchak and B. Oliynyk, Unital locally matrix algebras and Steinitz numbers, J. Algebra Appl. (2020), online ready]. We also show that for an arbitrary infinite Steinitz number s there exists a unital locally matrix algebra A having the Steinitz number s and not isomorphic to a tensor product of finite-dimensional matrix algebras.

We construct a unital locally matrix algebra of uncountable dimension that (1) does not admit a primary decomposition, (2) has an infinite locally finite Steinitz number. It gives negative answers to questions from [V. M. Kurochkin, On the theory of locally simple and locally normal algebras, Mat. Sb., Nov. Ser. 22(64)(3) (1948) 443–454; O. Bezushchak and B. Oliynyk, Unital locally matrix algebras and Steinitz numbers, J. Algebra Appl. (2020), online ready]. We also show that for an arbitrary infinite Steinitz number s there exists a unital locally matrix algebra A having the Steinitz number s and not isomorphic to a tensor product of finite-dimensional matrix algebras.

The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to another without passing through forbidden states. Analyzing this version raises the question of the treewidth of Hanoi graphs. We find this number exactly for three-peg puzzles and provide nearly-tight asymptotic bounds for larger numbers of pegs.

This paper presents a new efficient tool for simultaneous optimization of topology and geometry of truss structures. Force density method is applied to formulate optimization problem to minimize compliance under constraint on total structural volume, and objective and constraint functions are expressed as explicit functions of force density only. This method does not need constraints on nodal locations to avoid coalescent nodes, and enables to generate optimal solutions with a variety in topology and geometry. Furthermore, for the purpose of controlling optimal shapes, tensor product Bézier surface is introduced as a design surface. The optimization problem is solved using sensitivity coefficients and the optimizer is compiled as a component compatible with Grasshopper, an algorithmic modeling plug-in for Rhinoceros, which is a popular 3D modeling software. Efficiency and accuracy of the proposed method are demonstrated through two numerical examples of semi-cylindrical and semi-spherical models.

[EN] Given s-finite measure spaces ( 1, 1, mu 1) and ( 2, 2, mu 2), we consider Banach spaces X1(mu 1) and X2(mu 2), consisting of L0(mu 1) and L0(mu 2) measurable functions respectively, and study when the completion of the simple tensors in the projective tensor product X1(mu 1). p X2(mu 2) is continuously included in the metric space of measurable functions L0(mu 1. mu 2). In particular, we prove that the elements of the completion of the projective tensor product of L p-spaces are measurable functions with respect to the product measure. Assuming certain conditions, we finally showthat given a bounded linear operator T : X1(mu 1). p X2(mu 2). E (where E is a Banach space), a norm can be found for T to be bounded, which is ` minimal' with respect to a given property (2-rectangularity). The same technique may work for the case of n-spaces.

We introduce and investigate a new notion of the approximation property AP([c]), where c = (c(n)) is an arbitrary positive real sequence, tending to infinity. Also, we study the corresponding notion of [c]-nuclear operators in Banach spaces. Some characterization of the AP([c]) in terms of tensor products, as well as sufficient conditions for a Banach space to have the AP([c]), are given. We give also sufficient conditions for a positive answer to the question: When it follows from the [c]-nuclearity of an adjoint operator the nuclearity of the operator itself. Obtained results are applied then to the study of properties of nuclear operators in some spaces of analytical functions. Many examples are given.

A function f:[n_1] x ... x[n_d]->F_2 is a direct sum if it is of the form f (a_1,...,a_d) = f_1(a_1) oplus ... oplus f_d (a_d), for some d functions f_i:[n_i]->F_2 for all i=1,..., d, and where n_1,...,n_d in N. We present a 4-query test which distinguishes between direct sums and functions that are far from them. The test relies on the BLR linearity test (Blum, Luby, Rubinfeld, 1993) and on the direct product test constructed by Dinur & Steurer (2014). We also present a different test, which queries the function (d+1) times, but is easier to analyze. In multiplicative +/- 1 notation, this reads as follows. A d-dimensional tensor with +/- 1 entries is called a tensor product if it is a tensor product of d vectors with +/- 1 entries, or equivalently, if it is of rank 1. The presented tests can be read as tests for distinguishing between tensor products and tensors that are far from being tensor products.

[EN] While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of infinite-dimensional separable quotients in some Banach spaces of vector-valued functions, linear operators and vector measures. Most of the presented results are consequences of known facts, some of them relative to the presence of complemented copies of the classic sequence spaces c_0 and lp. Also recent results of Argyros, Dodos, Kanellopoulos [see 1 in the paper] and Sliwa [see 64 in the paper] are provided. This makes our presentation supplementary to a previous survey (1997) due to Mujica.

[EN] While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of infinite-dimensional separable quotients in some Banach spaces of vector-valued functions, linear operators and vector measures. Most of the presented results are consequences of known facts, some of them relative to the presence of complemented copies of the classic sequence spaces c_0 and lp. Also recent results of Argyros, Dodos, Kanellopoulos [see 1 in the paper] and Sliwa [see 64 in the paper] are provided. This makes our presentation supplementary to a previous survey (1997) due to Mujica.

The operator Schmidt rank of an operator acting on the tensor product Cn⊗Cm is the number of terms in a decomposition of the operator as a sum of simple tensors with factors forming orthogonal families in their respective matrix algebras. It has been known that for unitary operators acting on two copies of C2, the operator Schmidt rank can only take the values 1, 2, and 4, the value 3 being forbidden. In this paper, we settle an open question, showing that the above obstruction is the only one occurring. We do so by constructing explicit examples of bipartite unitary operators of all possible operator Schmidt ranks, for arbitrary dimensions (n,m)≠(2,2).

This paper examines tensor products of complete lattices in which one factor is com- pletely distributive. At least five characterizations of complete distributivity involving tensor products of complete lattices are given, among them this one: M is a completely distributive lattice if and only if for every complete lattice L the tensor product M ⊗ L is order isomorphic to the partially ordered set of all join- and meet-reversing maps from the complete lattice of all upclosed subsets of L to the lattice M. Some of these characterizations are then applied to give explicit descriptions of the multiplication of the tensor product of two quantales one of which is completely distributive.

A restriction in the traditional language of mathematics is that every formula has an underlying tree structure, wherein an expression decomposes into subexpressions that each contribute one result to the whole. Some modern mathematics (especially in higher algebra and differential geometry) is however not so well catered for by this tree paradigm, and would be much better off if this restriction was lifted; it is not that the mathematics requires a generalised formula language, but it becomes a whole lot easier to state and do when you use one. This poster shows the formula language of networks that arises when one relaxes the tree restriction to instead allow an underlying directed acyclic graph (DAG) structure. Evaluation of networks is non-obvious, but can be carried out in any PROP/symocat; conversely, evaluation of networks characterises PROPs in much the same way as evaluation of words characterises monoids. Networks are isomorphic to the abstract index interpretation of Einstein convention tensor expressions, and demonstrate that these can in fact be given a coordinate-free interpretation. Special cases of the network notation that have been invented independently include the Penrose graphical notation and quantum gate arrays.

We provide a tensor product representation of Kothe-Bochner function spaces of vector valued integrable functions. As an application, we show that the dual space of a Kothe-Bochner function space can be understood as a space of operators satisfying a certain extension property. We apply our results in order to give an alternate representation of the dual of the Bochner spaces of p-integrable functions and to analyze some properties of the natural norms that are defined on the associated tensor products.

We provide a tensor product representation of Kothe-Bochner function spaces of vector valued integrable functions. As an application, we show that the dual space of a Kothe-Bochner function space can be understood as a space of operators satisfying a certain extension property. We apply our results in order to give an alternate representation of the dual of the Bochner spaces of p-integrable functions and to analyze some properties of the natural norms that are defined on the associated tensor products.

We refactor the universal law for the tensor product to express matrix multiplication as the product . MN of two matrices . M and . N thus making possible to use such matrix product to encode and transform algorithms performing matrix multiplication using techniques from linear algebra. We explore such possibility and show two stepwise refinements transforming the composition . MN into the Naïve and Strassen's matrix multiplication algorithms. The inspection of the stepwise transformation of the composition of matrices . MN into the Naïve matrix multiplication algorithm evidences that the steps of the transformation correspond to apply Gaussian elimination to the columns of . M and to the lines of . N therefore providing explicit evidence on why "Gaussian elimination is not optimal", the aphorism serving as the title to the succinct paper introducing Strassen's matrix multiplication algorithm. Although the end results are equations involving matrix products, our exposition builds upon previous works on the category of matrices (and the related category of finite vector spaces) which we extend by showing: why the direct sum . (⊕,0) monoid is not closed, a biproduct encoding of Gaussian elimination, and how to further apply it in the derivation of linear algebra algorithms.

The aim of this work is to study the incidence functions and the tensor product of two incidence algebras. We show that the tensor product of two incidence algebras is an incidence algebra. We believe that our result is true for uncountable locally partial order sets. We present some examples of incidence functions. We study the Jacobson radical of the tensor product of the incidence algebras as well as when a tensor incidence algebra is an algebraic algebra over a field.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

Fusion dimensions are integer-valued quantities equal to the dimensions of the spaces of conformal blocks, which describe the interactions of a conformal field theory (CFT). Our focus was on the Wess-Zumino-Witten models, a particularly interesting type of CFT, whose primary fields correspond to representations of affine Lie groups. Arguably, affine fusion tadpoles are the simplest g>0 fusion dimension, having only a single incoming field and g=1. We study the symmetries of the SU(N) tadpole and Verlinde formula with the intention of finding a non-negative-integer decomposition. Such a decomposition might be indicative of a combinatorial atom for fusion. From produced tables we found that tadpole values appeared to be polynomial in the level k. Several conjectures were made and we sketch a method obtaining general forms of SU(N) tadpoles via dominant weight sums.

We review and study the Künneth theorem for tensor products of C^*-algebras，which is obtained by Claude Schochet.