Related papers: Representations of torsion-free arithmetic matroid…
We show that the reduction mod p of an orthogonal linear representation is orthogonal, and we generalize this fact to representations of algebras with involution.The proofs make an essential use of the notion of " middle lattices ".
In this paper we study the representation theory for certain ``half lattice vertex algebras.'' In particular we construct a large class of irreducible modules for these vertex algebras. We also discuss how the representation theory of these…
In this paper we extend the theory of oriented matroids to Lagrangian orthogonal matroids and their representations, and give a completely natural transformation from a representation of a classical oriented matroid to a representation of…
We present a constructive solution to the N-representability problem---a full characterization of the conditions for constraining the two-electron reduced density matrix (2-RDM) to represent an N-electron density matrix. Previously known…
This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
We study a representation of an antimatroid by Horn rules, motivated by its recent application to computer-aided educational systems. We associate any set $\mathcal{R}$ of Horn rules with the unique maximal antimatroid…
We study purely atomic representations of C*-algebras associated to row-finite and source-free higher-rank graphs. We describe when purely atomic representations are unitarily equivalent and we give necessary and sufficient conditions for a…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
In this paper, we give a cancellation-free antipode formula (for uniform matroids) for the restriction-contraction matroid Hopf algebra, using the technique of splitting and merging via a sign-reversing involution. The cancellation-free…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…
We present a new class of hermitian one-matrix models originated in the W-infinity algebra: more precisely, the polynomials defining the W-infinity generators in their fermionic bilinear form are shown to expand the orthogonal basis of a…
A new fast algebraic method for obtaining an $\mathcal{H}^2$-approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum-volume principle to select…
Given a simple finite-dimensional Lie algebra and an automorphism of finite order, one defines the notion of a twisted toroidal Lie algebra. In this paper, we construct representations of twisted toroidal Lie algebras from twisted modules…
Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of…
This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here…
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially…
Tropical oriented matroids were defined by Ardila and Develin in 2007 in analogy to (classical) oriented matroids. In this paper we present one tropical analogue for the Topological Representation Theorem.
$W$-representation realizes partition functions by an action of a cut-and-join-like operator on the vacuum state with a zero-mode background. We provide explicit formulas of this kind for $\beta$- and $q,t$-deformations of the simplest…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…