Related papers: On Gauss codes of virtual doodles
Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
Topological subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of this single-shot property remain elusive, in part due to…
InfoMod is a new software and application devoted to the modular group, PSL2(Z). It has algorithms that deals with the classical correspondences among continued fractions, geodesics on the modular surface and binary quadratic forms. In…
We present a brief review on the canonical transformation description of some duality symmetries in string and gauge theories. In particular, we consider abelian and non-abelian T-dualities in closed and open string theories as well as…
Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…
This paper describes a polynomial invariant of virtual knots that is defined in terms of an integer labeling of the virtual knot diagram. This labeling is seen to derive from an essentially unique structure of affine flat biquandle for flat…
We discuss the pseudodual chiral model to illustrate a class of two-dimensional theories which have an infinite number of conservation laws but allow particle production, at variance with naive expectations. We describe the symmetries of…
We develop new gauge-covariant implicit numerical schemes for classical real-time lattice gauge theory. A new semi-implicit scheme is used to cure a numerical instability encountered in three-dimensional classical Yang-Mills simulations of…
We introduce two new families of polynomial invariants of oriented classical and virtual knots and links defined as decategorfications of the quandle coloring quiver. We provide examples to illustrate the computation of the invariants, show…
Directed Gaussian graphical models are statistical models that use a directed acyclic graph (DAG) to represent the conditional independence structures between a set of jointly normal random variables. The DAG specifies the model through…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
Perfect code in Cayley graphs and Cayley sum graphs is studied extensively in recent years. In this paper, we consider perfect code in generalized Cayley graphs.
The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for…
Let $D_{2n}=\langle x,y\mid x^n=1, y^2=1, yxy=x^{-1}\rangle$ be a dihedral group, and $R={\rm GR}(p^2,m)$ be a Galois ring of characteristic $p^2$ and cardinality $p^{2m}$ where $p$ is a prime. Left ideals of the group ring $R[D_{2n}]$ are…
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
We give simple examples that illustrate the principles of one-way quantum computation using Gaussian continuous-variable cluster states. In these examples, we only consider single-mode evolutions, realizable via linear clusters. In…