Related papers: Representing some non-representable matroids
New definitions of determinant functionals over the quaternion skew field are given in this paper. The inverse matrix over the quaternion skew field is represented by analogues of the classical adjoint matrix. Cramer rule for right and left…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
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,…
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…
We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…
We give classifications of linear orbits of pairs of square matrices with non-vanishing discriminant polynomials over a field in terms of certain coherent sheaves with additional data on closed subschemes of the projective line. Our results…
We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…
In this paper we introduce valuated $\Delta$-matroids, a natural generalization of two objects of study in matroid theory: valuated matroids and $\Delta$-matroids. We show that these objects exhibit nice properties analogous to ordinary…
The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…
We introduce an operation on skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ called switching, and also define a class of skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ referred to as modular Eulerian matrices. We then…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.