Related papers: Rank three matroids are Rayleigh
We establish a new relationship between monotonicity and contractivity and use this connection to describe a new general class of weakly contractive reaction networks. The new class is characterized by the stoichiometry matrix of the…
It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions,…
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…
We call an oriented matroid Mandel if it has an extension in general position which makes all programs with that extension Euclidean. If $L$ is the minimum number of mutations adjacent to an element of the groundset, we call an oriented…
We show that almost every matroid contains the rank-3 whirl $\mathcal{W}^3$ or the complete-graphic matroid $M(K_4)$ as a minor.
Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.
We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.
Using linear algebra methods we study certain algebraic properties of monomial rings and matroids. Let I be a monomial ideal in a polynomial ring over an arbitrary field. If the Rees cone of I is quasi-ideal, we express the normalization of…
Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals…
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 banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly…
We prove that the set of all paths of a fixed length in a complete multipartite graph is the bases of a matroid. Moreover, we discuss the Cohen-Macaulayness and depth of powers of $t$-path ideals of a complete multipartite graph.
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
This paper develops matroidal analogues of classical results on matchings in abelian groups. By embedding matroid ground sets in an abelian group, we introduce base matchings between matroid bases, recover the group-theoretic setting in the…
It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and…
We work on the notions of rail arcs and rail isotopy in $\mathbb{R}^3$, and we introduce the notions of rail knotoid diagrams and their equivalence. Our main result is that two rail arcs in $\mathbb{R}^3$ are rail isotopic if and only if…
We constructively prove that every deep ReLU network can be rewritten as a functionally identical three-layer network with weights valued in the extended reals. Based on this proof, we provide an algorithm that, given a deep ReLU network,…