Related papers: Composition of Gray Isometries
We prove the existence of a finitely dependent proper colouring of the integer lattice Z^d that is fully isometry-invariant in law, for all dimensions d. Previously this was known only for d=1, while only translation-invariant examples were…
Information geometry provides differential geometric concepts like a Riemannian metric, connections and covariant derivatives on spaces of probability distributions. We discuss here how these concepts apply to quantum field theories in the…
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints…
The notion of $\textbf{Gray}$-category, a semi-strict $3$-category in which the middle four interchange is weakened to an isomorphism, is central in the study of three-dimensional category theory. In this context it is common practice to…
Let G be a reductive algebraic group over a field of prime characteristic. One can associate to G (or subgroups thereof) its Lie algebra, its Frobenius kernels, and the finite Chevalley group of points over a finite field. The…
These lecture notes are devoted to the theory of equations of associativity describing geometry of moduli spaces of 2D topological field theories. Introduction. Lecture 1. WDVV equations and Frobenius manifolds. {Appendix A.} Polynomial…
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A…
A simple Almost-Riemannian Structure on a Lie group G is defined by a linear vector field (that is an infinitesimal automorphism) and dim(G) -- 1 left-invariant ones. It is first proven that two different ARSs are isometric if and only if…
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…
In this article, we consider the decoding problem of affine Grassmann codes over nonbinary fields. We use matrices of different ranks to construct a large set consisting of parity checks of affine Grassmann codes, which are orthogonal with…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…
In this note, we study skew cyclic and skew constacyclic codes over the ring $\mathcal{R}=F_{q}+uF_{q}+vF_{q}+uvF_{q}$ where $q=p^{m},$ $p$ is an odd prime, $u^{2}=u,~v^{2}=v,~uv=vu$. We show that Gray images of a skew cyclic and skew…
In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code,…
Let R be a ring of polynomials in a finite number of variables over a perfect field k of characteristic p>0 and let F:R\to R be the Frobenius map of R, i.e. F(r)=r^p. We explicitly describe an R-module isomorphism Hom_R(F_*(M),N)\cong…
It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only if $G$ is peripherally 2-colorable. Let $G$ be a peripherally…
We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order…
This paper studies Frobenius maps on injective hulls of residue fields of complete local rings with a view toward providing constructive descriptions of objects originating from the theory of tight closure. Specifically, the paper describes…
We contribute to the program of extending computable structure theory to the realm of metric structures by investigating lowness for isometric isomorphism of metric structures. We show that lowness for isomorphism coincides with lowness for…