Related papers: Minors for alternating dimaps
We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…
The Chip-firing game is a discrete dynamical system played on a graph, in which chips move along edges according to a simple local rule. Properties of the underlying graph are of course useful to the understanding of the game, but since a…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on…
We consider a graph with colored edges. A trail (vertices may repeat but not edges) is called \emph{alternating} when successive edges have different colors. Given a set of vertices called \emph{terminals}, the \emph{alternating…
Although structural maps such as subductions and inductions appear naturally in diffeology, one of the challenges is providing suitable analogous for submersions, immersions, and \'{e}tale maps (i.e., local diffeomorphisms) consistent with…
In this paper we give a complete topological classification of orientation preserving Morse-Smale diffeomorphisms on orientable closed surfaces. For MS diffeomorphisms with relatively simple behaviour it was known that such a classification…
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…
As well known, permanent of a square (0,1)-matrix $A$ of order $n$ enumerates the permutations $\beta$ of $1,2,...,n$ with the incidence matrices $B\leq A.$ To obtain enumerative information on even and odd permutations with condition…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…
In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
We perform conformal perturbation theory by marginal operators to first order. A suitable renormalization method is needed that makes the conformal invariance of the deformed correlation functions manifest. Combining the embedding space…
A comprehensive theory is presented for the voltage, temperature, and spatial dependence of the tunneling current between a scanning tunneling microscope (STM) tip and a metallic surface with an individual magnetic adatom. Modeling the…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
A fourientation of a graph $G$ is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. We may naturally view fourientations as a mixture of subgraphs and graph…
The two operations, deletion and contraction of an edge, on multigraphs directly lead to the Tutte polynomial which satisfies a universal problem. As observed by Brylawski in terms of order relations, these operations may be interpreted as…