Related papers: On Gauss codes of virtual doodles
Cactus doodles are combinatorial/geometric objects that are related to cactus groups in the same way as knots are related to braids. We define them in terms of local moves on plane curves, show that they can be obtained from elements of the…
In this paper we study higher Gaussian (or Wahl) maps for the canonical bundle of certain smooth projective curves. More precisely, we determine the rank of higher Gaussian maps of the canonical bundle for plane curves, for curves contained…
The purpose of this note is to provide an alternative proof of two quadratic transformation formulas contiguous to that of Gauss using a differential equation approach.
We enhance the quandle counting invariants of oriented classical and virtual knots and links using a construction similar to quandle modules but inspired by symplectic quandle operations rather than Alexander quandle operations. Given a…
Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister…
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…
Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
This paper discusses the construction of a generalized Alexander polynomial for virtual knots and links, and the reformulation of this invariant as a quantum link invariant. The algebraic background for the generalized Alexander module is…
Many codes have been developed to study highly relativistic, magnetized flows around and inside compact objects. Depending on the adopted formalism, some of these codes evolve the vector potential $\mathbf{A}$, and others evolve the…
We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…
Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not…
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $\omega$ where each character…
In this paper, we study algebraic geometry codes from curves over $\mathbb{F}_{q^\ell}$ through their virtual projections which are algebraic geometric codes over $\mathbb{F}_q$. We use the virtual projections to provide fractional decoding…
Graphical models can represent a multivariate distribution in a convenient and accessible form as a graph. Causal models can be viewed as a special class of graphical models that not only represent the distribution of the observed system…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…