Related papers: The Complexity of Homomorphism Factorization
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
A homomorphism $f$ from a guest graph $G$ to a host graph $H$ is locally bijective, injective or surjective if for every $u\in V(G)$, the restriction of $f$ to the neighbourhood of $u$ is bijective, injective or surjective, respectively.…
Let $M$ be a $W^{\ast}$-algebra acting on a separable complex Hilbert space $H$. We show that the inclusion of $M$ into $\mathscr{B}(H)$ factors through an $\mathfrak{L}_{\infty}$-space only if $M$ is a finite type $\mathrm{I}$ algebra.
We deal with the existing problem of filtered multiplicative bases of finite-dimensional associative algebras. For an associative algebra A over a field, we investigate when the property of having a filtered multiplicative basis is…
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 LHom($H$), we are given a graph $G$, whose every…
Let $K$ be a field of characteristic $0$ and let $G$ and $H$ be connected commutative algebraic groups over $K$. Let $\text{Mor}_0(G,H)$ denote the set of morphisms of algebraic varieties $G \to H$ that map the neutral element to the…
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…
The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…
We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…
We show that if a finite dimensional Hopf algebra over ${\bf C}$ has a basis such that all the structure constants are non-negative, then the Hopf algebra must be given by a finite group $G$ and a factorization $G=G_+G_-$ into two…
In \cite{rupel3},the authors defined algebra homomorphisms from the dual Ringel-Hall algebra of certain hereditary abelian category $\mathcal{A}$ to an appropriate $q$-polynomial algebra. In the case that $\mathcal{A}$ is the representation…
We show that any smooth and proper dg-algebra (over some base ring k) is determined, up to quasi-isomorphism, by its underlying A_n-algebra, for a certain integer n. Similarly, any morphism between two smooth and proper dg-algebras is…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
We investigate the factorization problem as well as the classifying complements problem in the setting of Jordan algebras. Matched pairs of Jordan algebras and the corresponding bicrossed products are introduced. It is shown that any Jordan…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…