相关论文: The impracticalities of multiplicatively-closed co…
In this paper an algebraic model for unbased rational homotopy theory from the perspective of curved Lie algebras is constructed. As part of this construction a model structure for the category of pseudo-compact curved Lie algebras with…
Low rank approximation of a matrix (LRA) is a highly important area of Numerical Linear and Multilinear Algebra and Data Mining and Analysis. One can operate with an LRA superfast -- by using much fewer memory cells and flops than an input…
A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…
For any field $\K$ and integer $n\geq 2$ we consider the Leavitt algebra $L_\K(n)$; for any integer $d\geq 1$ we form the matrix ring $S = M_d(L_\K(n))$. $S$ is an associative algebra, but we view $S$ as a Lie algebra using the bracket…
Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transformation may be given as input to a second one if metamodels match.…
The key assumption underlying linear Markov Decision Processes (MDPs) is that the learner has access to a known feature map $\phi(x, a)$ that maps state-action pairs to $d$-dimensional vectors, and that the rewards and transitions are…
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
Can linear systems be solved faster than matrix multiplication? While there has been remarkable progress for the special cases of graph structured linear systems, in the general setting, the bit complexity of solving an $n \times n$ linear…
The present paper contains a systematic study of the structure of metric Lie algebras, i.e., finite-dimensional real Lie algebras equipped with a non-degenerate invariant symmetric bilinear form. We show that any metric Lie algebra without…
Let L be a restricted Lie superalgebra with its enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We characterize L…
We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…
This paper investigates the Jordan--Kronecker invariant of finite dimensional complex Lie algebras. We present an explicit algorithm for determining the type of a given Lie algebra from its Jordan--Kronecker invariant. The algorithm is…
A method is obtained to compute the maximum number of functionally independent invariant functions under the action of a linear algebraic group as long as its Lie algebra admits a base of square-zero matrices. Some applications are also…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
The linear decomposition attack reveals a vulnerability in encryption algorithms operating within groups or monoids with excessively small representations. The representation gap, defined as the size of the smallest non-trivial…
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…
In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…
We introduce a machine-learning approach for identifying hidden structural features of open quantum dynamics under restricted experimental access. Unlike most existing data-driven methods which focus on detection or prediction of dynamical…
Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally intractable, while l1 minimization will do the job when a…
A topological group is called a pro-Lie group if it is isomorphic to a closed subgroup of a product of finite-dimensional real Lie groups. This class of groups is closed under the formation of arbitrary products and closed subgroups and…