Related papers: Region crossing change on spatial theta-curves
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…
In this paper we propose {\it a region choice problem} for a knot projection. This problem is an integral extension of Shimizu's 'region crossing change unknotting operation.' We show that there exists a solution of the region choice…
Cities can be seen as the epitome of complex systems. They arise from a set of interactions and components so diverse that is almost impossible to describe them exhaustively. Amid this diversity, we chose an object which orchestrates the…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with…
PT-symmetric scattering systems with balanced gain and loss can undergo a symmetry-breaking transition in which the eigenvalues of the non-unitary scattering matrix change their phase shifts from real to complex values. We relate the…
Modelling interactions is critical in learning complex dynamical systems, namely systems of interacting objects with highly non-linear and time-dependent behaviour. A large class of such systems can be formalized as $\textit{geometric…
Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closed curve with $n$ self-crossings requires…
A spatial surface is a compact surface embedded in the $3$-sphere. We assume that a spatial surface is oriented and that each connected component of a spatial surface is neither a disk nor without a boundary. A diagram of a spatial surface…
We analyze the nonlinear optics of quasi one-dimensional quantum graphs and manipulate their topology and geometry to generate for the first time nonlinearities in a simple system approaching the fundamental limits of the first and second…
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
We study model transition for representations occurring in the local theta correspondence between split even special orthogonal groups and symplectic groups, over a non-archimedean local field of characteristic zero.
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not $\chi$-bounded.
The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their…
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or…
The hippocampal formation is thought to learn spatial maps of environments, and in many models this learning process consists of forming a sensory association for each location in the environment. This is inefficient, akin to learning a…