Related papers: Matroids with nine elements
The knowledge of isotopic and elemental abundances of the pristine solar system material provides a fundamental test of galactic chemical evolution models, while the composition of the solar photosphere is a reference pattern to understand…
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…
An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…
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,…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
The Jacobian group (also called the sandpile group, Picard group, or critical group) of a graph or, more generally, of a regular matroid has been well studied. Sixth-root-of-unity matroids, also called complex unimodular matroids, are…
This paper reviews past and ongoing efforts in using high-throughput ab-inito calculations in combination with machine learning models for materials design. The primary focus is on bulk materials, i.e., materials with fixed, ordered,…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
We prove that, as $n$ approaches infinity, the proportion of $n$-element matroids that are representable tends to zero.
For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label $l$ and replaces it by a new element that results in a new basis, and with the new element assigned label $l$. We prove that one…
The closure $\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this…
B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…
Electric-dipole matrix elements for ns-n'p, nd-n'p, and 6d-4f transitions in Rb are calculated using a relativistic all-order method. A third-order calculation is also carried out for these matrix elements to evaluate the importance of the…
The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…
Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve E with complex multiplication. We analyse the intersections of elements of the arrangement and their connected components as…
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
In the paper the generalisation of the well known "secretary problem" is considered. The aim of the paper is to give a generalised model in such a way that the chosen set of the possible best $k$ elements have to be independent of all…
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…