5,737 research outputs found
Orthogonality Relations and Supercharacter Formulas of U(m|n) Representations
In this paper we obtain the orthogonality relations for the supergroup
U(m|n), which are remarkably different from the ones for the U(N) case. We
extend our results for ordinary representations, obtained some time ago, to the
case of complex conjugated and mixed representations. Our results are expressed
in terms of the Young tableaux notation for irreducible representations. We use
the supersymmetric Harish-Chandra-Itzykson-Zuber integral and the character
expansion technique as mathematical tools for deriving these relations. As a
byproduct we also obtain closed expressions for the supercharacters and
dimensions of some particular irreducible U(m|n) representations. A new way of
labeling the U(m|n) irreducible representations in terms of m + n numbers is
proposed. Finally, as a corollary of our results, new identities among the
dimensions of the irreducible representations of the unitary group U(N) are
presented.Comment: 56 pages, LaTeX, changes only in the writing of the titl
Computing Quantiles in Markov Reward Models
Probabilistic model checking mainly concentrates on techniques for reasoning
about the probabilities of certain path properties or expected values of
certain random variables. For the quantitative system analysis, however, there
is also another type of interesting performance measure, namely quantiles. A
typical quantile query takes as input a lower probability bound p and a
reachability property. The task is then to compute the minimal reward bound r
such that with probability at least p the target set will be reached before the
accumulated reward exceeds r. Quantiles are well-known from mathematical
statistics, but to the best of our knowledge they have not been addressed by
the model checking community so far.
In this paper, we study the complexity of quantile queries for until
properties in discrete-time finite-state Markov decision processes with
non-negative rewards on states. We show that qualitative quantile queries can
be evaluated in polynomial time and present an exponential algorithm for the
evaluation of quantitative quantile queries. For the special case of Markov
chains, we show that quantitative quantile queries can be evaluated in time
polynomial in the size of the chain and the maximum reward.Comment: 17 pages, 1 figure; typo in example correcte
The Itzykson-Zuber Integral for U(m|n)
We compute the Itzykson-Zuber (IZ) integral for the superunitary group
U(m|n). As a consequence, we are able to find the non-zero correlations of
superunitary matricesComment: Latex, 16 page
- …