English

The $\mu$-permanent revisited

Combinatorics 2018-04-09 v1

Abstract

Let A=(aij)A=(a_{ij}) be an nn-by-nn matrix. For any real number μ\mu, we define the polynomial Pμ(A)=σSna1σ(1)anσ(n)μ(σ)  ,P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; , as the μ\mu-permanent of AA, where (σ)\ell(\sigma) is the number of inversions of the permutation σ\sigma in the symmetric group SnS_n. In this note, we review several less known results of the μ\mu-permanent, recalling some of its interesting properties. Some determinantal conjectures are considered and extended to that polynomial. A correction to a previous note is presented as well.

Keywords

Cite

@article{arxiv.1804.02231,
  title  = {The $\mu$-permanent revisited},
  author = {Carlos M. da Fonseca},
  journal= {arXiv preprint arXiv:1804.02231},
  year   = {2018}
}

Comments

This manuscript is largely based on the talk "On a generalization of the determinant of a matrix" that the author gave in Washington \& Lee University, Lexington, VA, USA, on July 19, 2012. It was submitted to Linear and Multilinear Algebra on September 20, 2015. A reduced form will be published as a Letter to the Editor in the same journal

R2 v1 2026-06-23T01:15:58.474Z