Related papers: A class of highly symmetric Archdeacon embeddings
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
The isomorphism problem of regular Higman-Thompson groups was solved in arXiv:1006.1759, via embedding it into the Leavitt algebra. In this paper, we will expand these results to embed the Higman-Thompson groups of unfolding trees of…
Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
In the mid-1980's, M. Gromov used his machinery of the $h$-principle to prove that there exists totally real embeddings of $S^3$ into $\mathbb{C}^3$. Subsequently, Patrick Ahern and Walter Rudin explicitly demonstrated such a totally real…
Hypergraph is the most general model for complex networks involving group interactions. Taking the ideas of path homology from Alexander Grigor'yan, Yong Lin, Yuri Muranov and Shing-Tung Yau [18-22], Stephane Bressan, Jingyan Li and the…
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…
A catalog of a class of (3,g) graphs for even girth g is introduced in this paper. A (k,g) graph is a regular graph with degree k and girth g. This catalog of (3,g) graphs for even girth g satisfying 6 <= g <= 16, has the following…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…
Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that…
In the setting of step 2 sub-Finsler Carnot groups with strictly convex norms, we prove that all infinite geodesics are lines. It follows that for any other homogeneous distance, all geodesics are lines exactly when the induced norm on the…
Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal…
Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…
For a class of Riemannian manifolds that include products of arbitrary compact manifolds with manifolds of nonpositive sectional curvature on the one hand, or with certain positive-curvature examples such as spheres of dimension at least 3…