Von Staudt Constructions for Skew-Linear and Multilinear Matroids

DOI10.5070/C63160429MaRDI QIDQ6355995arXivFDO

Authors Lukas Kühne, R. A. Pendavingh, Geva Yashfe

Publication date 14 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.5070/C63160429

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Combinatorial aspects of matroids and geometric lattices (05B35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

arXiv classification

math.COmath.LOmath.RA

Abstract: This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction, by which we translate our problems to algebra. After giving an exposition of a simple variant of the von Staudt construction we present the following results: $$ Undecidability of several matroid representation problems over division rings. $$ An example of a matroid with an infinite multilinear characteristic set, but which is not multilinear in characteristic $0$. $$ An example of a skew-linear matroid that is not multilinear.

This page was built for publication: Von Staudt Constructions for Skew-Linear and Multilinear Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355995)