{"title":"可解和幂零拟阵:其相关变种的可实现性和不可约分解","authors":"Emiliano Liwski, Fatemeh Mohammadi","doi":"10.1016/j.jsc.2025.102484","DOIUrl":null,"url":null,"abstract":"<div><div>We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their associated matroid and circuit varieties. Additionally, we describe a finite generating set for the corresponding ideals, considered up to radical. We establish sufficient conditions for both the realizability of these matroids and the irreducibility of their associated varieties. Specifically, we establish the realizability and irreducibility of matroid varieties associated with nilpotent matroids and prove the irreducibility of matroid varieties arising from certain classes of solvable paving matroids. Additionally, we analyze the defining polynomial equations of these varieties using Grassmann-Cayley algebra and geometric liftability techniques. Furthermore, we provide a complete generating set for the matroid ideals associated with forest configurations.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"133 ","pages":"Article 102484"},"PeriodicalIF":1.1000,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solvable and nilpotent matroids: Realizability and irreducible decomposition of their associated varieties\",\"authors\":\"Emiliano Liwski, Fatemeh Mohammadi\",\"doi\":\"10.1016/j.jsc.2025.102484\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their associated matroid and circuit varieties. Additionally, we describe a finite generating set for the corresponding ideals, considered up to radical. We establish sufficient conditions for both the realizability of these matroids and the irreducibility of their associated varieties. Specifically, we establish the realizability and irreducibility of matroid varieties associated with nilpotent matroids and prove the irreducibility of matroid varieties arising from certain classes of solvable paving matroids. Additionally, we analyze the defining polynomial equations of these varieties using Grassmann-Cayley algebra and geometric liftability techniques. Furthermore, we provide a complete generating set for the matroid ideals associated with forest configurations.</div></div>\",\"PeriodicalId\":50031,\"journal\":{\"name\":\"Journal of Symbolic Computation\",\"volume\":\"133 \",\"pages\":\"Article 102484\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2025-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Symbolic Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0747717125000665\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717125000665","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Solvable and nilpotent matroids: Realizability and irreducible decomposition of their associated varieties
We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their associated matroid and circuit varieties. Additionally, we describe a finite generating set for the corresponding ideals, considered up to radical. We establish sufficient conditions for both the realizability of these matroids and the irreducibility of their associated varieties. Specifically, we establish the realizability and irreducibility of matroid varieties associated with nilpotent matroids and prove the irreducibility of matroid varieties arising from certain classes of solvable paving matroids. Additionally, we analyze the defining polynomial equations of these varieties using Grassmann-Cayley algebra and geometric liftability techniques. Furthermore, we provide a complete generating set for the matroid ideals associated with forest configurations.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.