Related Research Articles
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In the mathematical field of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled. Dynkin diagrams arise in the classification of semisimple Lie algebras over algebraically closed fields, in the classification of Weyl groups and other finite reflection groups, and in other contexts. Various properties of the Dynkin diagram correspond to important features of the associated Lie algebra.
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups, and finite Coxeter groups were classified in 1935.
In graph theory, a quiver is a directed graph where loops and multiple arrows between two vertices are allowed, in other words a multidigraph. They are commonly used in representation theory: a representation V of a quiver assigns a vector space V(x) to each vertex x of the quiver and a linear map V(a) to each arrow a.
In mathematics, a triangular matrix is a special kind of square matrix. A square matrix is called lower triangular if all the entries above the main diagonal are zero. Similarly, a square matrix is called upper triangular if all the entries below the main diagonal are zero.
In mathematics, the ADE classification is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in. The complete list of simply laced Dynkin diagrams comprises
In mathematics, a reductive group is a type of linear algebraic group over a field. One definition is that a connected linear algebraic group G over a perfect field is reductive if it has a representation that has a finite kernel and is a direct sum of irreducible representations. Reductive groups include some of the most important groups in mathematics, such as the general linear group GL(n) of invertible matrices, the special orthogonal group SO(n), and the symplectic group Sp(2n). Simple algebraic groups and (more generally) semisimple algebraic groups are reductive.
In mathematics, the term Cartan matrix has three meanings. All of these are named after the French mathematician Élie Cartan. Amusingly, the Cartan matrices in the context of Lie algebras were first investigated by Wilhelm Killing, whereas the Killing form is due to Cartan.
In mathematics, a Lie algebra is semisimple if it is a direct sum of simple Lie algebras..
A logical matrix, binary matrix, relation matrix, Boolean matrix, or (0, 1)-matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets. It is an important tool in combinatorial mathematics and theoretical computer science.
In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors. It describes a kaleidoscopic construction: each graph "node" represents a mirror and the label attached to a branch encodes the dihedral angle order between two mirrors, that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees. An unlabeled branch implicitly represents order-3, and each pair of nodes that is not connected by a branch at all represents a pair of mirrors at order-2.
Numerical linear algebra, sometimes called applied linear algebra, is the study of how matrix operations can be used to create computer algorithms which efficiently and accurately provide approximate answers to questions in continuous mathematics. It is a subfield of numerical analysis, and a type of linear algebra. Computers use floating-point arithmetic and cannot exactly represent irrational data, so when a computer algorithm is applied to a matrix of data, it can sometimes increase the difference between a number stored in the computer and the true number that it is an approximation of. Numerical linear algebra uses properties of vectors and matrices to develop computer algorithms that minimize the error introduced by the computer, and is also concerned with ensuring that the algorithm is as efficient as possible.
In mathematics, and more specifically in graph theory, a directed graph is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
In mathematics, a matrix is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object.
In mathematics, Gabriel's theorem, proved by Pierre Gabriel, classifies the quivers of finite type in terms of Dynkin diagrams.
Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky. A cluster algebra of rank n is an integral domain A, together with some subsets of size n called clusters whose union generates the algebra A and which satisfy various conditions.
In mathematics, the McKay graph of a finite-dimensional representation V of a finite group G is a weighted quiver encoding the structure of the representation theory of G. Each node represents an irreducible representation of G. If χ i, χ j are irreducible representations of G, then there is an arrow from χ i to χ j if and only if χ j is a constituent of the tensor product Then the weight nij of the arrow is the number of times this constituent appears in For finite subgroups H of the McKay graph of H is the McKay graph of the canonical representation of H.
In the mathematical theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations are analogous to group representations; both types of representation provide abstract algebraic structures with concrete descriptions in terms of linear algebra.
Andrei Vladimirovich Roiter was a Ukrainian mathematician, specializing in algebra.
Lyudmyla Oleksandrivna Nazarova is a Ukrainian mathematician specializing in linear algebra and representation theory.
References
- ↑ Nazarova, L. A. (1974), "Representations of partially ordered sets of infinite type", Funkcional'nyi Analiz i ego Priloženija, 8 (4): 93–94, MR 0354455
- ↑ Gabriel, P.; Nazarova, L. A.; Roĭter, A. V.; Sergeĭchuk, V. V.; Vossieck, D. (1993), "Tame and wild subspace problems", Akademīya Nauk Ukraïni, 45 (3): 313–352, doi:10.1007/BF01061008, MR 1238674, S2CID 122603779
- ↑ Shavarovskiĭ, B. Z. (2004), "On some "tame" and "wild" aspects of the problem of semiscalar equivalence of polynomial matrices", Matematicheskie Zametki, 76 (1): 119–132, doi:10.1023/B:MATN.0000036747.26055.cb, MR 2099848, S2CID 120324840
- ↑ Drozd, Yuriy A.; Golovashchuk, Natalia S.; Zembyk, Vasyl V. (2017), "Representations of nodal algebras of type E", Algebra and Discrete Mathematics, 23 (1): 16–34, hdl:123456789/155928, MR 3634499
- ↑ Mesbahi, Afshin; Haeri, Mohammad (2015), "Conditions on decomposing linear systems with more than one matrix to block triangular or diagonal form", IEEE Transactions on Automatic Control, 60 (1): 233–239, doi:10.1109/TAC.2014.2326292, MR 3299432, S2CID 27053281
 | This linear algebra-related article is a stub. You can help Wikipedia by expanding it. |