Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census 5JP3JTYAXK
| URI | m2://res/5JP3JTYAXK |
|---|---|
| Kind | preprint |
| Creators | Yoshiteru Ishida |
| Date | 2026-10-04 |
| Subjects | arxiv cs.DS, arxiv cs.DM, arxiv cs.GT, arxiv math.CO |
| Scope | border |
Expressions
e1: version, preprint
| Date | 2026-10-04 |
|---|---|
| Ids | arXiv 2610.05617 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| the dynamic decomposition structure is flat, and its counting degenerates | statement | proposition 9.10 | arxiv |
| the exact-cover polynomial, and why it factorises | statement | proposition 9.7 | arxiv |
| asymptotics, with the leading correction | statement | corollary 9.1 | arxiv |
| 8YS82JRFRG | statement | corollary 5.1 | arxiv |
| CP10D70MFX | statement | corollary 4.2 | arxiv |
| F48XVKA067 | statement | corollary 4.1 | arxiv |
| unique prime decomposition | statement | corollary 6.2 | arxiv |
| primality is a covering failure | statement | theorem 9.6 | arxiv |
| which multisets of factors occur | statement | corollary 9.2 | arxiv |
| the blocks form a forest | statement | proposition 9.5 | arxiv |
| blocks are the square components of the filtration | statement | theorem 9.4 | arxiv |
Catalogue records
- arxiv: 2610.05617 (work)