Related papers: Vectors of matroids over tracts
We introduce the concept of a higher algebroid, generalizing the notions of an algebroid and a higher tangent bundle. Our ideas are based on a description of (Lie) algebroids as vector bundle comorphisms - differential relations of a…
Geometrically, the eigenvectors of a square matrix $\mathbf{A}$ are not rotated by $\mathbf{A}$. Here we consider vectors that are rotated $\pi/2$ by $\mathbf{A}$; that is, vectors orthogonal to their images. We call these vectors…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
A generalised notion of connection on a fibre bundle E over a manifold M is presented. These connections are characterised by a smooth distribution on E which projects onto a (not necessarily integrable) distribution on M and which, in…
We consider vector fields on knot/link complements in $S^3$ which are transverse to the fibres of a fibration of the complement over a circle. We prove that a large class of fibred knots/links, including all non-torus fibred 2-bridge knots,…
A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…
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…
Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
A natural explicit condition is given ensuring that an action of the multiplicative monoid of non-negative reals on a manifold F comes from homotheties of a vector bundle structure on F, or, equivalently, from an Euler vector field. This is…
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…
A real vector space combined with an inverse for vectors is sufficient to define a vector continued fraction whose parameters consist of vector shifts and changes of scale. The choice of sign for different components of the vector inverse…
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…
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,…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
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,…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…