اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPerfect matroids over hyperfields
205
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate valuated matroids with an additional algebraic structure on their residue matroids. We encode the structure in terms of representability over stringent hyperfields. A hyperfield $H$ is {em stringent} if $aboxplus b$ is a singleton unless $a=-b$, for all $a,bin H$. By a construction of Marc Krasner, each valued field gives rise to a stringent hyperfield. We show that if $H$ is a stringent skew hyperfield, then the vectors of any weak matroid over $H$ are orthogonal to its covectors, and we deduce that weak matroids over $H$ are strong matroids over $H$. Also, we present vector axioms for matroids over stringent skew hyperfields which generalize the vector axioms for oriented matroids and valuated matroids.
قيم البحث
اقرأ أيضاً
We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular matroids. We
give a structural characterization of the class of delta-graphic matroids. We also show that every forbidden minor for the class of delta-graphic matroids has at most $48$ elements.
Kapranovs theorem is a foundational result in tropical geometry. It states that the set of tropicalisations of points on a hypersurface coincides precisely with the tropical variety of the tropicalisation of the defining polynomial. The aim of this p
aper is to generalise Kapranovs theorem, replacing the role of a valuation map, from a field to the real numbers union negative infinity, with a more general class of hyperfield homomorphisms, whose target is the tropical hyperfield and satisfy a relative algebraic closure condition. To provide an example of such a hyperfield homomorphism, the map from the complex tropical hyperfield to the tropical hyperfield is investigated. There is a brief outline of sufficient conditions for a hyperfield homomorphism to satisfy the relative algebraic closure condition.
Baranys colorful generalization of Caratheodorys Theorem combines geometrical and combinatorial constraints. Kalai-Meshulam (2005) and Holmsen (2016) generalized Baranys theorem by replacing color classes with matroid constraints. In this note, we ob
tain corresponding results in tropical convexity, generalizing the tropical colorful Caratheodory Theorem of Gaubert-Meunier (2010). Our proof is inspired by geometric arguments and is reminiscent of matroid intersection. In particular, we show that the topological approach fails in this setting. We also discuss tropical colorful linear programming and show that it is NP-complete. We end with thoughts and questions on generalizations to polymatroids, anti-matroids as well as examples and matroid simplicial depth.
The class of quasi-graphic matroids recently introduced by Geelen, Gerards, and Whittle generalises each of the classes of frame matroids and lifted-graphic matroids introduced earlier by Zaslavsky. For each biased graph $(G, mathcal B)$ Zaslavsky de
fined a unique lift matroid $L(G, mathcal B)$ and a unique frame matroid $F(G, mathcal B)$, each on ground set $E(G)$. We show that in general there may be many quasi-graphic matroids on $E(G)$ and describe them all. We provide cryptomorphic descriptions in terms of subgraphs corresponding to circuits, cocircuits, independent sets, and bases. Equipped with these descriptions, we prove some results about quasi-graphic matroids. In particular, we provide alternate proofs that do not require 3-connectivity of two results of Geelen, Gerards, and Whittle for 3-connected matroids from their introductory paper: namely, that every quasi-graphic matroid linearly representable over a field is either lifted-graphic or frame, and that if a matroid $M$ has a framework with a loop that is not a loop of $M$ then $M$ is either lifted-graphic or frame. We also provide sufficient conditions for a quasi-graphic matroid to have a unique framework. Zaslavsky has asked for those matroids whose independent sets are contained in the collection of independent sets of $F(G, mathcal B)$ while containing those of $L(G, mathcal B)$, for some biased graph $(G, mathcal B)$. Adding a natural (and necessary) non-degeneracy condition defines a class of matroids, which we call biased graphic. We show that the class of biased graphic matroids almost coincides with the class of quasi-graphic matroids: every quasi-graphic matroid is biased graphic, and if $M$ is a biased graphic matroid that is not quasi-graphic then $M$ is a 2-sum of a frame matroid with one or more lifted-graphic matroids.
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of Lawrence matroid
polytopes. Our resolution provides a cellular realization of Stanleys formula for their Betti numbers. For unimodular matroids our resolutions are related to hyperplane arrangements on tori, and we recover the resolutions constructed by Bayer, Popescu and Sturmfels. We resolve the combinatorial problems posed in their paper by computing Mobius invariants of graphic and cographic arrangements in terms of Hermite polynomials.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
