Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q5866449)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pfaffian pairs and parities: counting on linear matroid intersection and parity problems |
scientific article; zbMATH DE number 7589618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pfaffian pairs and parities: counting on linear matroid intersection and parity problems |
scientific article; zbMATH DE number 7589618 |
Statements
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (English)
0 references
21 September 2022
0 references
linear matroid intersection
0 references
linear matroid parity
0 references
Pfaffian
0 references
matrix-tree theorem
0 references
regular delta-matroid
0 references
arborescence
0 references
matching
0 references
Pfaffian orientation
0 references
spanning hypertree
0 references
\(S\)-\(T\) paths
0 references
\(\mathcal{S}\)-paths
0 references
counting algorithm
0 references
0 references
0 references
0 references
0 references
0.9965537786483764
0 references
0.8422037959098816
0 references
0.8418096899986267
0 references
0.8277499675750732
0 references
0.8117082118988037
0 references
