Related papers: Radix and Pseudodigit Representations in Z^n
We consider a construction of the fundamental spin representations of the simple Lie algebras $\mathfrak{so}(n)$ in terms of binary arithmetic of fixed width integers. This gives the spin matrices as a Lie subalgebra of a…
Given a representation-finite algebra B and a subalgebra A of B such that the Jacobson radicals of A and B coincide, we prove that the representation dimension of A is at most three. By a result of Igusa and Todorov, this implies that the…
The aim of this paper is to extend the so called slice analysis to a general case in which the codomain is a real vector space of even dimension, i.e. is of the form $\mathbb{R}^{2n}$. We define a cone $\mathcal{W}_\mathcal{C}^d$ in…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…
Contact representations of graphs have a long history. Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fully-dimensional geometric objects such as spheres or cubes.…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…
We adapt methods from the theory of complex semisimple Lie algebras to develop a root theory for a class of simple $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded (color) Lie algebras, which we call basic. As an application, assuming that the…
Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…
A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…