Related papers: An algorithm for computing the canonical bases of …
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
The q-deformed Fock spaces of higher levels were introduced by Jimbo-Misra-Miwa-Okado. The q-decomposition matrix is a transition matrix from the standard basis to the canonical basis defined by Uglov in the q-deformed Fock space. In this…
We implement the Unified Transform Method of Fokas as a numerical method to solve linear partial differential equations on the half-line. The method computes the solution at any x and t without spatial discretization or time stepping. With…
Explicit bases for the spaces of holomorphic cusp forms of all even positive weights and all orders are constructed. The dimensions of these spaces are computed.
In this paper, we propose compactly supported radial basis functions for solving some well- known classes of astrophysics problems categorized as non-linear singular initial ordinary dif- ferential equations on a semi-infinite domain. To…
Based on the continuous time random walk, we derive the Fokker-Planck equations with Caputo-Fabrizio fractional derivative, which can effectively model a variety of physical phenomena, especially, the material heterogeneities and structures…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We study canonical basis elements in higher-level Fock spaces associated with the quantum group $U_q(\mathfrak{gl}_\infty)$, which are conjecturally related to Calogero-Moser theory for complex reflection groups. We generalize the…
Gross, Hacking, and Keel have constructed mirrors of log Calabi-Yau surfaces in terms of counts of rational curves. Using $q$-deformed scattering diagrams defined in terms of higher genus log Gromov-Witten invariants, we construct…
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum…
We study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…
This paper presents a PDE-based approach to finding an optimal canonical basis with which to represent a nearly integrable Hamiltonian. The idea behind the method is to continuously deform the initial canonical basis in such a way that the…
The paper presents a Fock space model suitable for constructions of c-free algebras. Immediate applications are direct proofs for the properties of the c-free R- and S-transforms.
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
Scattered data fitting is a frequently encountered problem for reconstructing an unknown function from given scattered data. Radial basis function (RBF) methods have proven to be highly useful to deal with this problem. We describe two…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
This paper is devoted to the question of constructing a higher order Faber spline basis for the sampling discretization of functions with higher regularity than Lipschitz. The basis constructed in this paper has similar properties as the…
The first goal of this paper is to study the amount of compatibility between two important constructions in the theory of quantized enveloping algebras, namely the canonical basis and the quantum Frobenius morphism. The second goal is to…
The widely-used compression format "Deflate" is defined in RFC 1951 and is based on prefix-free codings and backreferences. There are unclear points about the way these codings are specified, and several sources for confusion in the…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…