Permutation matrix (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Permutation matrix" in English language version.

refsWebsite

Global rank English rank

3doi.org

2^nd place

2worldcat.org

5^th place

1sciencedirect.com

149^th place

178^th place

1psu.edu

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

1archive.org

6^th place

1zbmath.org

1,923^rd place

1,068^th place

1numdam.org

8,650^th place

7,668^th place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

archive.org

Brualdi 2006, p. 19 Brualdi, Richard A. (2006). Combinatorial matrix classes. Encyclopedia of Mathematics and Its Applications. Vol. 108. Cambridge: Cambridge University Press. ISBN 0-521-86565-4. Zbl 1106.05001.

arxiv.org

Najnudel & Nikeghbali 2013, p. 4 Najnudel, Joseph; Nikeghbali, Ashkan (2013) [2010], "The Distribution of Eigenvalues of Randomized Permutation Matrices", Annales de l'Institut Fourier, 63 (3): 773–838, arXiv:1005.0402, Bibcode:2010arXiv1005.0402N, doi:10.5802/aif.2777

doi.org

Zavlanos, Michael M.; Pappas, George J. (November 2008). "A dynamical systems approach to weighted graph matching". Automatica. 44 (11): 2817–2824. CiteSeerX 10.1.1.128.6870. doi:10.1016/j.automatica.2008.04.009. S2CID 834305. Retrieved 21 August 2022. Let $O_{n}$ denote the set of $n\times n$ orthogonal matrices and $N_{n}$ denote the set of $n\times n$ element-wise non-negative matrices. Then, $P_{n}=O_{n}\cap N_{n}$ , where $P_{n}$ is the set of $n\times n$ permutation matrices.
Conway, John H.; Burgiel, Heidi; Goodman-Strauss, Chaim (2008). The Symmetries of Things. A K Peters/CRC Press. p. 179. doi:10.1201/b21368. ISBN 978-0-429-06306-0. OCLC 946786108. A permutation—say, of the names of a number of people—can be thought of as moving either the names or the people. The alias viewpoint regards the permutation as assigning a new name or alias to each person (from the Latin alias = otherwise). Alternatively, from the alibi viewoint we move the people to the places corresponding to their new names (from the Latin alibi = in another place.)
Najnudel & Nikeghbali 2013, p. 4 Najnudel, Joseph; Nikeghbali, Ashkan (2013) [2010], "The Distribution of Eigenvalues of Randomized Permutation Matrices", Annales de l'Institut Fourier, 63 (3): 773–838, arXiv:1005.0402, Bibcode:2010arXiv1005.0402N, doi:10.5802/aif.2777

harvard.edu

ui.adsabs.harvard.edu

Najnudel & Nikeghbali 2013, p. 4 Najnudel, Joseph; Nikeghbali, Ashkan (2013) [2010], "The Distribution of Eigenvalues of Randomized Permutation Matrices", Annales de l'Institut Fourier, 63 (3): 773–838, arXiv:1005.0402, Bibcode:2010arXiv1005.0402N, doi:10.5802/aif.2777

numdam.org

Najnudel & Nikeghbali 2013, p. 4 Najnudel, Joseph; Nikeghbali, Ashkan (2013) [2010], "The Distribution of Eigenvalues of Randomized Permutation Matrices", Annales de l'Institut Fourier, 63 (3): 773–838, arXiv:1005.0402, Bibcode:2010arXiv1005.0402N, doi:10.5802/aif.2777

psu.edu

citeseerx.ist.psu.edu

Zavlanos, Michael M.; Pappas, George J. (November 2008). "A dynamical systems approach to weighted graph matching". Automatica. 44 (11): 2817–2824. CiteSeerX 10.1.1.128.6870. doi:10.1016/j.automatica.2008.04.009. S2CID 834305. Retrieved 21 August 2022. Let $O_{n}$ denote the set of $n\times n$ orthogonal matrices and $N_{n}$ denote the set of $n\times n$ element-wise non-negative matrices. Then, $P_{n}=O_{n}\cap N_{n}$ , where $P_{n}$ is the set of $n\times n$ permutation matrices.

sciencedirect.com

Zavlanos, Michael M.; Pappas, George J. (November 2008). "A dynamical systems approach to weighted graph matching". Automatica. 44 (11): 2817–2824. CiteSeerX 10.1.1.128.6870. doi:10.1016/j.automatica.2008.04.009. S2CID 834305. Retrieved 21 August 2022. Let $O_{n}$ denote the set of $n\times n$ orthogonal matrices and $N_{n}$ denote the set of $n\times n$ element-wise non-negative matrices. Then, $P_{n}=O_{n}\cap N_{n}$ , where $P_{n}$ is the set of $n\times n$ permutation matrices.

semanticscholar.org

api.semanticscholar.org

Zavlanos, Michael M.; Pappas, George J. (November 2008). "A dynamical systems approach to weighted graph matching". Automatica. 44 (11): 2817–2824. CiteSeerX 10.1.1.128.6870. doi:10.1016/j.automatica.2008.04.009. S2CID 834305. Retrieved 21 August 2022. Let $O_{n}$ denote the set of $n\times n$ orthogonal matrices and $N_{n}$ denote the set of $n\times n$ element-wise non-negative matrices. Then, $P_{n}=O_{n}\cap N_{n}$ , where $P_{n}$ is the set of $n\times n$ permutation matrices.

worldcat.org

search.worldcat.org

Artin, Michael (1991). Algebra. Prentice Hall. pp. 24–26, 118, 259, 322. ISBN 0-13-004763-5. OCLC 24364036.
Conway, John H.; Burgiel, Heidi; Goodman-Strauss, Chaim (2008). The Symmetries of Things. A K Peters/CRC Press. p. 179. doi:10.1201/b21368. ISBN 978-0-429-06306-0. OCLC 946786108. A permutation—say, of the names of a number of people—can be thought of as moving either the names or the people. The alias viewpoint regards the permutation as assigning a new name or alias to each person (from the Latin alias = otherwise). Alternatively, from the alibi viewoint we move the people to the places corresponding to their new names (from the Latin alibi = in another place.)

zbmath.org

Brualdi 2006, p. 19 Brualdi, Richard A. (2006). Combinatorial matrix classes. Encyclopedia of Mathematics and Its Applications. Vol. 108. Cambridge: Cambridge University Press. ISBN 0-521-86565-4. Zbl 1106.05001.