Related papers: Applications of Gaussian Binomials to Coding Theor…
Gaussian filters have applications in a variety of areas in computer science, from computer vision to speech recognition. The collapsing sum is a matrix operator that was recently introduced to study Gaussian filters combinatorially. In…
The cosmological tensor perturbation equation with generalized holonomy corrections is derived in the framework of effective loop quantum gravity. This results in a generalized dispersion relation for gravitational waves, encompassing…
We present a universal framework for quantum error-correcting codes, i.e., the one that applies for the most general quantum error-correcting codes. This framework is established on the group algebra, an algebraic notation for the nice…
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…
We construct a deformation of the quantum algebra Fun(T^*G) associated with Lie group G to the case where G is replaced by a quantum group G_q which has a bicovariant calculus. The deformation easily allows for the inclusion of the current…
Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections. Audoux used Khovanov homology to define families of quantum error-correcting codes with…
Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.
Quantum and q-deformed algebras find their application not only in mathematical physics and field theoretical context, but also in phenomenology of particle properties. We describe (i) the use of quantum algebras U_q(su_n) corresponding to…
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…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
One variant of the $q$-Catalan polynomials is defined in terms of Gaussian polynomials by $\mathcal{C}_k(q)=\genfrac{[}{]}{0pt}{}{2k}{k}_q-q\genfrac{[}{]}{0pt}{}{2k}{k+1}_q$. Liu studied congruences of the form $\sum_{k=0}^{n-1}…
We present a method of Gaussian-beam-mode decomposition to calculate classical diffraction of optical beams by apertures. This method offers a entirely different approach to examine the classic problem. Although our method is based on a…
We study Algebraic Geometry codes producing quantum error-correcting codes by the CSS construction. We pay particular attention to the family of Castle codes. We show that many of the examples known in the literature in fact belong to this…
We investigate the random variable defined by the volume of the zero set of a smooth Gaussian field, on a general Riemannian manifold possibly with boundary, a fundamental object in probability and geometry. We prove a new explicit formula…
Gaussian variational approximation is a popular methodology to approximate posterior distributions in Bayesian inference especially in high dimensional and large data settings. To control the computational cost while being able to capture…
In this paper, we obtain affine analogues of Gindikin-Karpelevich formula and Casselman-Shalika formula as sums over Kashiwara-Lusztig's canonical bases. Suggested by these formulas, we define natural $q$-deformation of arithmetical…
We investigate the problem of recovering coefficients in scalar nonlinear ordinary differential equations that can be exactly linearized. This contribution builds upon prior work by Lyakhov, Gerdt, and Michels, which focused on obtaining a…
We prove descent theorems for semiorthogonal decompositions using techniques from derived algebraic geometry. Our methods allow us to capture more general filtrations of derived categories and even marked filtrations, where one descends not…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…