Related papers: Entropic matroids and their representation

A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses…

We prove that the non-regular binary matroids with no $P_9^*$-minor have linear growth rate and the maximum size binary matroids with no $P_9^*$-minor are graphic. The main technique in the proof is the Strong Splitter Theorem using which…

A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here we point out that the existence of such a joint distribution imposes…

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

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,…

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…

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…

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…

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

Let $p$ be an odd prime, let $N$ be a prime with $N \equiv 1 \pmod{p}$, and let $\zeta_p$ be a primitive $p$-th root of unity. We study the $p$-rank of the class group of $\mathbb{Q}(\zeta_p, N^{1/p})$ using Galois cohomological methods and…

In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…

Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N}…

Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich…

We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We establish the existence of such an embedding for binary…

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…