Results 11 to 20 of about 180 (88)
Young–Capelli bitableaux, Capelli immanants in U(gl(n)) and the Okounkov quantum immanants [PDF]
, 2021 The set of standard Capelli bitableaux and the set of standard Young-Capelli bitableaux are bases of U(gl(n)), whose action on the Gordan-Capelli basis of polynomial algebra C[Mn,n] have remarkable properties (see, e.g. [A. Brini, A.
A. Teolis, A. Brini
core +1 more source
A generalization of immanants based on partition algebra characters [PDF]
, 2023 We introduce a generalization of immanants of matrices, using partition algebra characters in place of symmetric group characters. We prove that our immanant-like function on square matrices, which we refer to as the recombinant, agrees with the usual ...
Campbell, John M.
core +1 more source
#P-hardness proofs of matrix immanants evaluated on restricted matrices [PDF]
, 2023 \#P-hardness of computing matrix immanants are proved for each member of a broad class of shapes and restricted sets of matrices. We prove \#P-hardness of computing $\lambda$-immanants of $0$-$1$ matrices when $\lambda$ has a large domino-tilable part ...
Miklos, Istvan, Riener, Cordian
core +1 more source
Immanants, Tensor Network States and the Geometric Complexity Theory Program [PDF]
, 2012 We study the geometry of immanants, which are polynomials on n^2 variables that are defined by irreducible representations of the symmetric group Sn. We compute stabilizers of immanants in most cases by computing Lie algebras of stabilizers of immanants.
Ye, Ke
core +3 more sources
La complexité des immanants [PDF]
, 2019 On étudie dans ce texte les immanants, qui sont des polynômes de degré n en n2 variables définis en fonction des caractères du groupe symétrique. Par exemple, le déterminant et le permanent sont des immanants. Aussi, dans un article datant des années 70,
Tétreault, Étienne
core +1 more source
Tensor inequalities, ξ-functions and inequalities involving immanants [PDF]
, 1999 If f is a complex valued function with domain Sn, the symmetric group on {1,2,…,n}, then we define the matrix function df(·) in the usual way. If α is a partition of n and λα denotes the associated irreducible character of Sn, then dλα(·), which we ...
Pate, Thomas H.
core +1 more source
Quantum immanants, double Young-Capelli bitableaux and Schur shifted symmetric functions [PDF]
, 2022 In this paper are introduced two classes of elements in the enveloping algebra $\mathbf{U}(gl(n))$: the \emph{double Young-Capelli bitableaux} $[\ \fbox{$S \ | \ T$}\ ]$ and the \emph{central} \emph{Schur elements} $\mathbf{S}_{\lambda}(n)$, that act in ...
Teolis, Antonio, Brini, Andrea
core +1 more source
Inequalities for single-hook immanants [PDF]
, 1988 Let d̄k denote the normalized generalized matrix function based upon the irreducible character of Sn associated with the partition (k,1,…,1) of n. For all positive semidefinite Hermitian n-by-n A, we prove certain inequalities in the chain det A=d̄1(A)⩽d̄
Charles R. Johnson +3 more
core +1 more source
Immanants and Finite Point Processes [PDF]
, 2000 Given a Hermitian, non-negative definite kernel K and a character χ of the symmetric group on n letters, define the corresponding immanant function Kχ[x1, …, xn]≔∑σχ(σ)∏ni=1K(xi, xσ(i)), where the sum is over all permutations σ of {1, …, n}.
Diaconis, Persi, Evans, Steven N.
core +1 more source
For an integer partition $ λ$ of $n$ and an $n \times n$ matrix $A$, consider the expansion of the immanant $\text{Imm}^λ(A)$ as a sum indexed by permutations $σ$ of order $n$, with coefficients given by the irreducible characters $χ^λ(\text{ctype}(σ ...
Campbell, John M.
core +1 more source