On the values of permanents of (0, 1) circulant matrices with three ones per row (Q2568378): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Giovanni Sburlati / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ian M. Wanless / rank
Normal rank
 
Property / author
 
Property / author: Giovanni Sburlati / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Ian M. Wanless / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2005.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981319800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How fast can one compute the permanent of circulant matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the permanent of certain \((0,1)\) Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of sparse circulant permanents via determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence formulas for permanents of (0,1)-circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of different permanents of some sparse (0,1)-circulant matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in graphs on non-orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Revision as of 16:19, 10 June 2024

scientific article
Language Label Description Also known as
English
On the values of permanents of (0, 1) circulant matrices with three ones per row
scientific article

    Statements

    On the values of permanents of (0, 1) circulant matrices with three ones per row (English)
    0 references
    10 October 2005
    0 references
    Let \(\Delta_n^k\) denote the set of \(n\times n\) circulant matrices with \(k\) ones and \(n-k\) zeros in each row. This paper is concerned with certain congruences satisfied by the permanent of matrices in \(\Delta_n^k\). Let \(p^h\) be a prime power and \(m\) an integer in the range \(1\leq m\leq 4\). The congruence class of per\((A)\) modulo \(p\) is determined for \(A\in\Delta_{mp^h}^3\), with the answer generally depending on the congruence classes of the positions occupied by ones in the first row of \(A\). Congruence classes are also found for per\((A)\) mod 8 where \(A\in\Delta_{2^h}^3\) and mod 9 where \(A\in\Delta_{3^h}^3\). Whilst most results pertain to the case \(k=3\) two results are claimed for \(k\geq 3\) and odd \(p\). Namely, that per\((A)\equiv k\) mod \(p\) for \(A\in\Delta_{p^h}^k\) and the congruence class of per\((A)\) mod 4 is obtained for \(A\in\Delta_{2p^h}^k\). Finally, the permanent for those matrices in \(\Delta_n^3\) where the ones occur on consecutive diagonals is expressed in terms of Fibonacci numbers. The author acknowledges that this last result is not new.
    0 references
    permanent
    0 references
    congruence
    0 references
    binary matrix
    0 references
    circulant matrices
    0 references
    Fibonacci numbers
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references