Related papers: Representations of torsion-free arithmetic matroid…
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…
Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure…
In this paper, we give a cancellation-free antipode formula for the matroid-minor Hopf algebra. We then explore applications of this formula. For example, the cancellation-free formula expresses the antipode of uniform matroids as a sum…
A new kind of deformed calculus was introduced recently in studying of parabosonic coordinate representation. Based on this deformed calculus, a new deformation of Hermite polynomials is proposed, its some properties such as generating…
We prove that, if A is a strongly simply connected algebra of polynomial growth, then A is torsionless-finite. In particular, its representation dimension is at most three.
This paper studies the combinatoric structure of the set of all representations, up to equivalence, of a finite-dimensional semisimple Lie algebra. This has intrinsic interest as a previously unsolved problem in representation theory, and…
An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…
The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank $r$ can be represented as a pseudosphere arrangement on the $(r-1)$-dimensional sphere $S^{r-1}$, is one of the most…
A coherent state representation of the expectation value of an arbitrary (but still polynomial) normal ordered quantum operator is discussed. This serves as a basis for developing a fast and easy-to-handle algorithm, based on series of…
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…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…
We discuss the construction of real matrix representations of PT-symmetric operators. We show the limitation of a general recipe presented some time ago for non-Hermitian Hamiltonians with antiunitary symmetry and propose a way to overcome…
For the standard lattice model of information structures, we derive a reduced poset representation which provides the same informational content as the complete lattice structure which derives it. Rational agents can recover the complete…
In this paper, we consider a finiteness problem of saturated subsheaves of a hermitian locally free sheaf on an arithmetic variety. As an application, we could prove the unique existence of an arithmetic Harder-Narasimham filtration.
In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement. We give some results on the uniqueness of the representation of…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
For a natural number $c$, a $c$-arrangement is an arrangement of dimension $c$ subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a multiple of $c$. Matroids arising as normalized rank…
We present novel equivalences in random matrix and tensor models between complex and self-adjoint theories with nontrivial quadratic terms in the action, established through an intermediate field representation. More precisely, we show that…