相关论文: The Computational Complexity of Rules for the Char…
Recently, residue and quotient tables were defined by Fishel and the author, and were used to describe strong covers in the lattice of $k$-bounded partitions. In this paper, we show or conjecture that residue and quotient tables can be used…
Closed formulae are constructed for the characters and dimensions of the finite dimensional simple modules of the queer Lie superalgebra q(n). This is achieved by refining Brundan's algorithm for computing simple q(n)-characters.
Based on the vertex operator realization of the Schur functions, a determinant-type plethystic Murnaghan--Nakayama rule is obtained and utilized to derive a general formula of the expansion coefficients of $s_{\nu}$ in the plethysm product…
We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…
Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields…
Character tables of finite groups and closely related commutative algebras have been investigated recently using new perspectives arising from the AdS/CFT correspondence and low-dimensional topological quantum field theories. Two important…
The q-character is a strong tool to study finite-dimensional representations of quantum affine algebras. However, the explicit formula of the q-character of a given representation has not been known so far. Frenkel and Mukhin proposed the…
The linear complexity of a sequence $s$ is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There are several algorithms to find the linear complexity of a…
The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…
We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a…
In this paper we present an algorithm for efficiently counting fixed points in a finite monoid $M$ under a conjugacy-like action. We then prove a formula for the character table of $M$ in terms of fixed points and radical, which allows for…
In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…
We derive decomposition formulas for supercharacters of quantum affine ortho-symplectic superalgebras and twisted quantum affine superalgebras into supercharacters of their finite-type quantum sub-superalgebras, by employing Cauchy-type…
Chinese characters have a complex and hierarchical graphical structure carrying both semantic and phonetic information. We use this structure to enhance the text model and obtain better results in standard NLP operations. First of all, to…
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string from its substrings in a certain query model. More concretely, the goal of the problem is to identify an unknown string $S$…
Statistical query (SQ) algorithms are algorithms that have access to an {\em SQ oracle} for the input distribution $D$ instead of i.i.d.~ samples from $D$. Given a query function $\phi:X \rightarrow [-1,1]$, the oracle returns an estimate…
We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of $n$ linear equations in $n$ variables require $\Omega(\log^2 n)$ space, Ta-Shma…
The main result in this paper is the character formula for arbitrary irreducible highest weight modules of W algebras. The key ingredient is the functor provided by quantum Hamiltonian reduction, that constructs the W algebras from affine…
The character formulas of Sally and Shalika are an early triumph in $p$-adic harmonic analysis, but, to date, the calculations underlying the formulas have not been available. In this paper, which should be viewed as a precursor of the…