Related papers: On the Isomorphic Embedding of Rectangular Grids i…
An embedding of a code is a mapping that preserves distances between codewords. We prove that any code with code distance $\rho$ and length $d$ can be embedded into an MDS code with the same code distance and length but under a larger…
First, we prove a special case of Knaster's problem, implying that each symmetric convex body in R^3 admits an inscribed cube. We deduce it from a theorem in equivariant topology, which says that there is no S_4-equivariant map from SO(3)…
Certain semi-Riemannian metrics may be decomposed into a Riemannian part and an isochronal part. We use this idea and an idea of Kasner to construct a manifold in 6+1 Minkowski space with a well known metric. The full embedding we display…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of…
We describe a polynomial complexity algorithm for reducing transition matrices, for vector bundles glued along a clutching-type cover of a real anisotropic conic, to canonical block diagonal forms. This is a generalization, to the real…
We say that a group G is a cube group if it is generated by a set S of involutions such that the corresponding Cayley graph Cay(G,S) is isomorphic to a cube. Equivalently, G is a cube group if it acts on a cube such that the action is…
In [The Space of Spaces: Curvature Bounds and Gradient Flows on the Space of Metric Measure Spaces. Memoirs of the American Mathematical Society. American Mathematical Society, 2023], Sturm studied the space of all metric measure spaces up…
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…
Nontrivial isometric embeddings for flat metrics (i.e., those which are not just planes in the ambient space) can serve as useful tools in the description of gravity in the embedding gravity approach. Such embeddings can additionally be…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
Superconducting circuits are among the leading contenders for quantum information processing. This promising avenue has been strengthened with the advent of circuit quantum electrodynamics, underlined by recent experiments coupling on-chip…
Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…
For a given small binary dihedral group G we use the classification of G-graphs to describe explicitly G-Hilb(C^2) by giving an affine open cover of M(Q,R), the moduli space of stable quiver representations.
Let $G=(V,E)$ be an arbitrary undirected source graph to be embedded in a target graph $EM$, the extended grid with vertices on integer grid points and edges to nearest and next-nearest neighbours. We present an algorithm showing how to…
A subgraph of the $n$-dimensional hypercube is called 'layered' if it is a subgraph of a layer of some hypercube. In this paper we show that there exist subgraphs of the cube of arbitrarily large girth that are not layered. This answers a…
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the triangulation are discussed.
For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs. These methods have achieved great success on resolving graph isomorphism problems. However, in some classification problems,…
The isomonodromy deformation method is applied to the scaling limits in the linear NxN matrix equations with rational coefficients to obtain the deformation equations for the algebraic curves which describe the local behavior of the reduced…
We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…