Related papers: The Dynamic Complexity of Acyclic Hypergraph Homom…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
We study the complexity of counting (weighted) planar graph homomorphism problem $\tt{Pl\text{-}GH}(M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$. For matrices with pairwise distinct diagonal values, we…
The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…
We show that if a partially hyperbolic diffeomorphism of a Seifert manifold induces a map in the base which has a pseudo-Anosov component then it cannot be dynamically coherent. This extends work of Bonatti, Gogolev, Hammerlindl and Potrie…
The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is $O(n^3)$.
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
We study continuous homomorphisms between algebras of iterated Laurent series over a commutative ring. We give a full description of such homomorphisms in terms of a discrete data determined by the images of parameters. In similar terms, we…
A morphism of a category which is simultaneously an epimorphism and a monomorphism is called a bimorphism. In \cite{DR2} we gave characterizations of monomorphisms (resp. epimorphisms) in arbitrary pro-categories, pro-(C), where (C) has…
The quantum-classical isomorphism for self-consistent field theory, which allows quantum particles in space-time to be represented as classical one-dimensional threads embedded in a five dimensional thermal-space-time, is summarized and…
Given graphs $H$ and $G$, possibly with vertex-colors, a homomorphism is a function $f:V(H)\to V(G)$ that preserves colors and edges. Many interesting counting problems (e.g., subgraph and induced subgraph counts) are finite linear…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
We revisit the work studying homomorphism preservation for first-order logic in sparse classes of structures initiated in [Atserias et al., JACM 2006] and [Dawar, JCSS 2010]. These established that first-order logic has the homomorphism…
We present complexity results regarding a matching-type problem related to structural controllability of dynamical systems modelled on graphs. Controllability of a dynamical system is the ability to choose certain inputs in order to drive…
A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Let $H$ be a fixed graph with possible loops. In the list homomorphism problem, denoted by \textsc{LHom}($H$), the instance is a graph $G$,…
Let $M$ be a $G$-manifold and $\om$ a $G$-invariant exact $m$-form on $M$. We indicate when these data allow us to constract a cocycle on a group $G$ with values in the trivial $G$-module $\mathbb R$ and when this cocycle is nontrivial.
It is shown how nonlinear versions of quantum mechanics can be refolmulated in terms of a (linear) C*-algebraic theory. Then also their symmetries are described as automorphisms of the correspondong C*-algebra. The requirement of…
A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…
We define a homomorphism from (a certain extension of) the fundamental group of the Hamiltonian automorphism group of a symplectic manifold to the group of invertibles in its quantum cohomology ring. The manifold must satify a technical…