The number of terms in the permanent and the determinant of a generic circulant matrix
| dc.creator | Thomas, Hugh | |
| dc.date | 2003-01-07 | |
| dc.date.accessioned | 2026-07-07T04:54:17Z | |
| dc.date.available | 2026-07-07T04:54:17Z | |
| dc.description | Let A=(a_(ij)) be the generic n by n circulant matrix given by a_(ij)=x_(i+j), with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is well-known and has several combinatorial interpretations. The function d(n), on the other hand, has not been studied previously. We show that when n is a prime power, d(n)=p(n). The proof uses symmetric functions. | |
| dc.description | 6 pages; 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0301048 | |
| dc.identifier | http://arxiv.org/abs/math/0301048 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66192 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15;05E05 | |
| dc.title | The number of terms in the permanent and the determinant of a generic circulant matrix | |
| dc.type | text |