Related papers: Stem-Symmetry, Comb Products, and their Relation t…
Let $(X,\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\in\mathcal{E}$, the subgraph of $Q$ induced on the elements in $E$ is connected. We consider the problem of constructing a support for hypergraphs…
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree…
Local complementation of a graph $G$ on vertex $v$ is an operation that results in a new graph $G*v$, where the neighborhood of $v$ is complemented. Two graph are locally equivalent if on can be reached from the other one through local…
The aim of these notes is to generalize Laumon's construction [18] of automorphic sheaves corresponding to local systems on a smooth, projective curve $C$ to the case of local systems with indecomposable unipotent ramification at a finite…
Phylogenetic networks provide a more general description of evolutionary relationships than rooted phylogenetic trees. One way to produce a phylogenetic network is to randomly place $k$ arcs between the edges of a rooted binary phylogenetic…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
We study the edge states in graphene in the presence of a magnetic field perpendicular to the plane of the lattice. Most of the works done so far discuss the edge states in either zigzag or armchair edge graphene considering an isotropic…
Given a Riemannian manifold $M,$ and an open interval $I\subset\mathbb{R},$ we characterize nontrivial totally umbilical hypersurfaces of the product $M\times I$ -- as well as of warped products $I\times_\omega M$ -- as those which are…
We introduce the labelling map and the quasi-free action of a locally compact abelian group on a graph $C^*$-algebra of a row-finite directed graph. Some necessary conditions for embedding the crossed product to an $AF$ algebra are…
Let $\Omega$ be a $m$-set, where $m>1$, is an integer. The Hamming graph $H(n,m)$, has $\Omega ^{n}$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. In this paper, we provide a proof…
A $G-$family of quandles is an algebraic construction which was proposed by A. Ishii, M. Iwakiri, Y. Jang, K. Oshiro in 2013. The axioms of these algebraic systems were motivated by handlebody-knot theory. In the present work we investigate…
We consider the action of a finite group $G$ by locality preserving automorphisms (quantum cellular automata) on quantum spin chains. We refer to such group actions as ``symmetries''. The natural notion of equivalence for such symmetries is…
We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…
The moduli space $\bar{M}_S^\sigma(R)$ parameterizes the isomorphism classes of $S$-pointed stable real curves of genus zero which are invariant under relabeling by the involution $\sigma$. This moduli space is stratified according to the…
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a…
A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…
For many random graph models, the analysis of a related birth process suggests local sampling algorithms for the size of, e.g., the giant connected component, the $k$-core, the size and probability of an epidemic outbreak, etc. In this…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
A general (convex) polytope $P\subset\mathbb R^d$ and its edge-graph $G_P$ can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the…
Graph embedding provides an efficient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information. In contrast to the graph structure data, the i.i.d. node embedding can be…