相关论文: Deferred Cyclotomic Representation for Stable and …

Fourier Holographic Reduced Representations (FHRR) provide a compositional framework for encoding structured information with complex-valued hypervectors. FHRR rely on floating-point arithmetic, which limits their efficiency and…

We present a fault-tolerant quantum algorithm for implementing the Discrete Variable Representation (DVR) transformation, a technique widely used in simulations of quantum-mechanical Hamiltonians. DVR provides a diagonal representation of…

In recent years, Karr's difference field theory has been extended to the so-called $R\Pi\Sigma$-extensions in which one can represent not only indefinite nested sums and products that can be expressed by transcendental ring extensions, but…

We derive fusion rules for the composition of $q$-deformed classical representations (arising in tensor products of the fundamental representation) with semi-periodic representations of $SL(N)_q$ at roots of unity. We obtain full…

The quark form factor is known to exponentiate within the framework of dimensionally regularized perturbative QCD. The logarithm of the form factor is expressed in terms of integrals over the scale of the running coupling. I show that these…

The cyclic reduction (CR) algorithm is an efficient method for solving quadratic matrix equations that arise in quasi-birth-death (QBD) stochastic processes. However, its convergence is not guaranteed when the associated matrix polynomial…

A method is developed to construct irreducible representations(irreps) of the quantum supergroup $U_q(C(n+1))$ in a systematic fashion. It is shown that every finite dimensional irrep of this quantum supergroup at generic $q$ is a…

Recent advances in quantum crystallography have shown that, beyond conventional charge density refinement, a one-electron reduced density matrix (1-RDM) satisfying N-representability conditions can be reconstructed using jointly…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

The deconfined quantum critical point (DQCP) was originally proposed as a continuous transition between two spontaneous symmetry breaking phases in 2D spin-1/2 systems. While great efforts have been spent on the DQCP for 2D systems, both…

Let $A$ be a finite-dimensional algebra over a field $k$. We define $A$ to be $\mathbf{C}$-dichotomic if it has the dichotomy property of the representation type on complexes of projective $A$-modules. $\mathbf{C}$-dichotomy implies the…

The presence of inhomogeneous media between optical sensors and objects leads to distorted imaging outputs, significantly complicating downstream image-processing tasks. A key challenge in image restoration is the lack of high-quality,…

This paper initiates a systematic study of the cyclotomic KLR algebras of affine types $A$ and $C$. We start by introducing a graded deformation of these algebras and the constructing all of the irreducible representations of the deformed…

The two-parametric quantum superalgebra $U_{p,q}[gl(2/1)]$ is consistently defined. A construction procedure for induced representations of $U_{p,q}[gl(2/1)]$ is described and allows us to construct explicitly all (typical and nontypical)…

This chapter is based on a series of lectures that I gave at the National University of Singapore in April 2013. The notes survey the representation theory of the cyclotomic Hecke algebras of type A with an emphasis on understanding the KLR…

Decoded Quantum Interferometry (DQI) is a framework for approximating special kinds of discrete optimization problems that relies on problem structure in a way that sets it apart from other classical or quantum approaches. We show that the…

We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the…

Relax, Compensate and then Recover (RCR) is a paradigm for approximate inference in probabilistic graphical models that has previously provided theoretical and practical insights on iterative belief propagation and some of its…

Upon compressing perceptually relevant signals, conventional quantization generally results in unnatural outcomes at low rates. We propose distribution preserving quantization (DPQ) to solve this problem. DPQ is a new quantization concept…