Related papers: An LLT-type algorithm for computing higher-level c…
We discuss classical and quantum algorithms for solvability testing and finding integer solutions x,y of equations of the form af^x + bg^y = c over finite fields GF(q). A quantum algorithm with time complexity q^(3/8) (log q)^O(1) is…
A string basis is constructed for each subalgebra of invariants of the function algebra on the quantum special linear group. By analyzing the string basis for a particular subalgebra of invariants, we obtain a ``canonical basis'' for every…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
Operating deep neural networks on devices with limited resources requires the reduction of their memory footprints and computational requirements. In this paper we introduce a training method, called look-up table quantization, LUT-Q, which…
We classify unitary highest weight modules with a given integral infinitesimal character for the real Lie algebras $\mathfrak{su}(p,q)$ and $\mathfrak{so}^*(2n)$. We treat both regular and singular cases. For $\mathfrak{su}(p,q)$ we…
A level-one representation of the quantum affine superalgebra $\U_q(\hat{\frak{sl}}(M+1|N+1))$ and vertex operators associated with the fundamental representations are constructed in terms of free bosonic fields. Character formulas of…
The simple integrable modules with finite dimensional weight spaces are classified for the quantum affine special linear superalgebra $\U_q(\hat{\mathfrak{sl}}(M|N))$ at generic $q$. Any such module is shown to be a highest weight or lowest…
The log canonical threshold (lct) is a fundamental invariant in birational geometry, essential for understanding the complexity of singularities in algebraic varieties. Its real counterpart, the real log canonical threshold (rlct), also…
We give a purely combinatorial algorithm for the computation of the decomposition matrices for Ariki-Koike algebras when the parameters are powers of the same root of unity. It generalizes the LLT algorithm.
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. Let $P$ be the transition matrix between the canonical basis and a PBW basis of ${\mathbf U}_q^-$. In the case ${\mathbf U}_q^-$ is symmetric, Antor gave a simple…
In the paper we consider the problem of computation of characters of relatively integrable irreducible highest weight modules $L$ over finite-dimensional basic Lie superalgebras and over affine Lie superalgebras $\mathfrak{g}$. The problems…
One of the crucial generic techniques for quantum computation is amplitude encoding. Although several approaches have been proposed, each of them often requires exponential classical-computational cost or an oracle whose explicit…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.
We construct by fusion product new irreducible representations of the quantum affinization $U_q(\hat{sl}_\infty)$. The action is defined via the Drinfeld coproduct and is related to the crystal structure of semi-standard tableaux of type…
The level l Fock space admits canonical bases G_e and G_\infty. They correspond to U_{v}(hat{sl}_{e}) and U_{v}(sl_{\infty})-module structures. We establish that the transition matrices relating these two bases are unitriangular with…
For $\imath$quantum covering groups $(\mathbf{U}, \mathbf{U}^\imath)$ of super Kac-Moody type, we construct $\imath$-canonical bases for the highest weight integrable $\mathbf{U}$-modules and their tensor products regarded as…
Large language models~(LLMs) have recently demonstrated promising performance in many tasks. However, the high storage and computational cost of LLMs has become a challenge for deploying LLMs. Weight quantization has been widely used for…
The aim of this paper is to study the canonical filtration $L(\lambda)_l$ of an irreducible finite dimensional $\operatorname{SL}(V)$-module $L(\lambda)$ using the universal enveloping algebra $U(\mathfrak{sl}(V))$ and the annihilator ideal…