搜索结果: 1-10 共查到“理学 Matroid”相关记录10条 . 查询时间(0.072 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Maximizing Approximately Non-k-Submodular Monotone Set Function with Matroid Constraint
最大化 矩阵约束 近似非k子模 单调集函数
2023/5/12
Utilizing approximation algorithm, there has been a large quantity of work on optimization for submodular functions since the 1970s. As a variant, $k$-submodular function appears in many fields to mat...
A g-element for a graded R-module is a one-form with properties similar to a Lefschetz class in the cohomology ring of a compact complex projective manifold, except that the induced multiplication map...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in p 2 . In the case of linear matroids, which are
represented over polynomially growing fie...
The adjacency matroid of a graph
adjacency delta-matroid interlace polynomial local complement matroid minor Tutte polynomial
2011/9/22
Abstract: If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of...
Abstract: We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a ...
Describing the combinatorial structure of the tropical complex C of a tropical ma-troid polytope, we obtain a formula for the coarse types of the maximal cells of C. Due to the connection between trop...
The diagonal of tropical matroid varieties and cycle intersections
diagonal of tropical matroid varieties cycle intersections
2011/2/21
We define an intersection product of tropical cycles on matroid varieties (via cutting out the diagonal) and show that it is well-behaved. In particular, this enables us to intersect cycles on moduli ...
On the Complexity of Matroid Isomorphism Problems
On the Complexity of Matroid Isomorphism Problems
2012/12/3
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over polynomially growing fiel...
Let G be the base graph with n vertices of any matroid. It is proved that for any two vertices of G there are at least r internally disjoint shortest paths joining them where r is their distance. Furt...
Characterizations of Matroid VIA OFR-Sets
Feeble-matroid Strong map Hesitant map ORF-set OFF-set OFR-set
2010/3/1
The aim of this paper is to introduce the class of OFR-sets as the sets that are the intersection of an open set and a feeble-regular set. Several classes of matroids are studied via the new concept. ...