Search arXivSearch

arXiv · 1506.06425

A Note on an Analytic Approach to the Problem of Finite Matroid Representability, The Cardinality of Sets of k-Independent Vectors over Finite Fields and the Maximum Distance Separable Conjecture

Abstract

We introduce various quantities that can be defined for an arbitrary finite matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a finite matroid of rank $r$, we examine the proportion of size-$(r-k)$ subsets that are dependent, and give bounds, in terms of the cardinality of the matroid and $q$, for this proportion, below which the matroid is not representable over $\mathbb{F}_q$. We also explore connections between the defined quantities and demonstrate that they can be used to prove that random matrices have high proportions of subsets of columns independent. Our study relates to the results of our papers [4,5,11] dealing with the cardinality of sets of $k$-independent vectors over $\mathbb{F}_q$ and the Maximal Distance Separation Conjecture over $\mathbb{F}_q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. Sun, S. B. Damelin. 2026-09-15. A Note on an Analytic Approach to the Problem of Finite Matroid Representability, The Cardinality of Sets of k-Independent Vectors over Finite Fields and the Maximum Distance Separable Conjecture. https://arxiv.org/abs/1506.06425

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO