Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.04789 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915480247205888 |
|---|---|
| author | Bera, Sudip |
| author_facet | Bera, Sudip |
| contents | This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_04789 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A graph theoretic proof of Cramer's rule Bera, Sudip Combinatorics This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma. |
| title | A graph theoretic proof of Cramer's rule |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.04789 |