Related papers: On Gauss codes of virtual doodles
Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree $n$ Vassiliev invariants.
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
We construct a virtual quandle for links in lens spaces $L(p,q)$, with $q=1$. This invariant has two valuable advantages over an ordinary fundamental quandle for links in lens spaces: the virtual quandle is an essential invariant and the…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
The design of the precoder the maximizes the mutual information in linear vector Gaussian channels with an arbitrary input distribution is studied. Precisely, the precoder optimal left singular vectors and singular values are derived. The…
We construct an Alexander type invariant for oriented doodles from a deformation of the Tits representation of the twin group and from the Chebyshev polynomials of second kind. Similar to the Alexander polynomial, our invariant vanishes on…
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…
A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex…
We show how classical and quantum dualities, as well as duality relations that appear only in a sector of certain theories ("emergent dualities"), can be unveiled, and systematically established. Our method relies on the use of morphisms of…
We introduce and discuss the dual of a chain geometry. Each chain geometry is canonically isomorphic to its dual. This allows us to show that there are isomorphisms of chain geometries that arise from antiisomorphisms of the underlying…
We introduce the notion of a categorical cone, which provides a categorification of the classical cone over a projective variety, and use our work on categorical joins to describe its behavior under homological projective duality. In…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. They are widely used throughout natural sciences, computational biology and many other fields. Computing the vanishing ideal of the…