相关论文: Representability of $q$-matroids via rank-metric c…
Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…
Flag matroids are combinatorial abstractions of flags of linear subspaces, just as matroids are of linear subspaces. We introduce the flag Dressian as a tropical analogue of the partial flag variety, and prove a correspondence between: (a)…
We consider the vector linear solvability of networks over a field $\mathbb{F}_q.$ It is well known that a scalar linear solution over $\mathbb{F}_q$ exists for a network if and only if the network is \textit{matroidal} with respect to a…
We study a natural q-analogue of a class of matrices with noncommutative entries, which were first considered by Yu. I. Manin in 1988 in relation with quantum group theory, (called Manin Matrices in [5]) . These matrices we shall call…
In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which are described as matroid cryptomorphisms. A q-matroid is a q-analogue of a matroid where subspaces play the role of the…
We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the M\"obius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to…
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…
We discuss existence of mixed state of multicomponent system with given spectrum and given reduced density matrices. We give a complete solution of the problem in terms of linear inequalities on the spectra, accompanied with extensive…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$ there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having polynomial-time…
We classify all matroids with at most 8 elements that have the half-plane property, and we provide a list of some matroids on 9 elements that have, and that do not have the half-plane property. Furthermore, we prove that several classes of…
In this survey, we review some of the recent connections between the representation theory of (untwisted) quantum affine algebras and the representation theory of current algebras. We mainly focus on the finite-dimensional representations…
It is shown that the finite dimensional irreducible representations of the quantum matrix algebra $ M_q(n) $ ( the coordinate ring of $ GL_q(n) $ ) exist only when q is a root of unity ( $ q^p = 1 $ ). The dimensions of these…
Let $M=(E,{\cal I})$ be a matroid. A {\em $k$-truncation} of $M$ is a matroid {$M'=(E,{\cal I}')$} such that for any $A\subseteq E$, $A\in {\cal I}'$ if and only if $|A|\leq k$ and $A\in {\cal I}$. Given a linear representation of $M$ we…
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…
The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…
A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set $[n]$ is doubly exponential…
Let K be an arbitrary (commutative) field, and V be a linear subspace of M_n(K) such that codim V<n-1. Using a recent generalization of a theorem of Atkinson and Lloyd, we show that every linear embedding of V into M_n(K) which strongly…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…