Related papers: On Gauss codes of virtual doodles
We describe how the canonical and variation maps between the shifted nearby and vanishing cycles interact with Verdier dualizing.
The relationship between the exactness of a first order differential calculus on a comodule algebra $P$ and the Galois property of $P$ is investigated.
Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a…
This set of lecture notes first gives an introduction to the geometry of principal bundles. Next, it demonstrates how they can be used to formalize the concept of gauge theories arising in physics. A basic familiarity with the differential…
In this paper we study the dual codes of a wide family of evaluation codes on norm-trace curves. We explicitly find out their minimum distance and give a lower bound for the number of their minimum-weight codewords. A general geometric…
We introduce the concept of a higher algebroid, generalizing the notions of an algebroid and a higher tangent bundle. Our ideas are based on a description of (Lie) algebroids as vector bundle comorphisms - differential relations of a…
We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…
The Hamiltonian description of classical gauge theories is a very well studied subject. The two best known approaches, namely the covariant and canonical Hamiltonian formalisms have received a lot of attention in the literature. However, a…
Scientists often use directed acyclic graphs (days) to model the qualitative structure of causal theories, allowing the parameters to be estimated from observational data. Two causal models are equivalent if there is no experiment which…
A doodle is a collection of immersed circles without triple intersections in the $2$-sphere. It was shown by the second author and P.~Tayler that doodles induce commutator identities (identities amongst commutators) in a free group. In this…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
The canonical quantization in Weyl gauge of gauge fields in static space-times is presented. With an appropriate definition of transverse and longitudinal components of gauge fields, the Gauss law constraint is resolved explicitly for…
This paper has dual aims. First is to develop practical universal coding methods for unlabeled graphs. Second is to use these for graph anomaly detection. The paper develops two coding methods for unlabeled graphs: one based on the degree…
We develop a comprehensive framework for constructing quantum error correcting codes (QECCs) from Abelian lattice gauge theories (LGTs) using quantum reference frames (QRFs) as a unifying formalism. We consider LGTs with arbitrary compact…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
I study a special type of canonical relations given by twisted conormal bundles, construct a "subcategory" of the symplectic "category" out of these canonical relations and quantize them into semi-classical Fourier integral operators.…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…