Related papers: Constructions of New q-Cryptomorphisms
Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related to almost affine codes. In this paper, we introduce and study…
The concept of structural invariance previously introduced by the authors is used to argue that the connection between random matrix theory and quantum systems with a chaotic classical counterpart is in fact largely exact in the…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…
We study based one-dimensional modules of quantum symmetric pairs over the field $\mathbb{Q}(q)$. We provide a complete classification of one-dimensional $\mathbf{B}$-modules that appear as submodules of simple finite-dimensional based…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
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,…
In classical physics, a single measurement can in principle reveal the state of a system. However, quantum theory permits numerous non-equivalent measurements on a physical system, each providing only limited information about the state.…
We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along…
Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…
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 order to see the behavior of $\imath$canonical bases at $q = \infty$, we introduce the notion of $\imath$crystals associated to an $\imath$quantum group of certain quasi-split type. The theory of $\imath$crystals clarifies why…
In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…
The fundamental correspondence between quantum chaotic single-particle systems and random matrix theory is well-understood via periodic orbit theory. In contrast, we show that many-body systems with explicit subsystem structure possess…
The standard oracle model for matroid algorithms assumes that each independence query can be answered in constant time, regardless of the size of the queried set. While this abstraction has underpinned much of the theoretical progress in…
Quantum theory is extremely successful in explaining most physical phenomena, and is not contradicted by any experiment. Yet, the theory has many puzzling features : the occurrence of probabilities, the unclear distinction between the…
A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
We consider structural properties of $\mathcal{L}$-polymatroids, especially those defined on a finite complemented modular lattice $\mathcal{L}$. We introduce a set of cover-weight axioms and establish a cryptomorphism between these axioms…