Related papers: The Ho-Zhao Problem

The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…

Let $(X, \Gamma)$ be a free and minimal topological dynamical system, where $X$ is a separable compact Hausdorff space and $\Gamma$ is a countable infinite discrete amenable group. It is shown that if $(X, \Gamma)$ has the Uniform Rokhlin…

In this paper, we study $(\varphi,\Gamma)$-modules over rings which are "combinations of discrete algebras and affinoid $\mathbb{Q}_p$-algebras", and prove basic results such as the existence of a fully faithful functor from the category of…

For an additive category $\mathbf{P}$ we provide an explict construction of a category $\mathcal{Q}( \mathbf{P} )$ whose objects can be thought of as formally representing $\frac{\mathrm{im}( \gamma )}{\mathrm{im}( \rho ) \cap \mathrm{im}(…

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

The Graded Classification Conjecture states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by $\mathbb Z.$…

This paper deals with topos-theoretic truth-value valuations of quantum propositions. Concretely, a mathematical framework of a specific type of modal approach is extended to the topos theory, and further, structures of the obtained…

The study of weak domains and quasicontinuous domains leads to the consideration of two types generalizations of domains. In the current paper, we define the weak way-below relation between two nonempty subsets of a poset and quasiexact…

Let ${\cal E}$ be a topos, ${{\rm Dec}({\cal E}) \rightarrow {\cal E}}$ be the full subcategory of decidable objects, and ${{\cal E}_{\neg\neg} \rightarrow {\cal E}}$ be the full subcategory of double-negation sheaves. We give sufficient…

Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…

The $d$-distance $p$-packing domination number $\gamma_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. If no such set exists, then we set…

A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…

A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…

We construct an integrable hierarchy in terms of vertex operators and Hirota Quadratic Equations (HQE shortly) and we show that the equivariant total descendant potential of $\C P^1$ satisfies the HQE. Our prove is based on the quantization…

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

We prove that, in a triangulated category with combinatorial models, every localizing subcategory is coreflective and every colocalizing subcategory is reflective if a certain large-cardinal axiom (Vopenka's principle) is assumed true. It…

Let $\Gamma$ denote a finite (strongly) connected regular (di)graph with adjacency matrix $A$. The {\em Hoffman polynomial} $h(t)$ of $\Gamma=\Gamma(A)$ is the unique polynomial of smallest degree satisfying $h(A)=J$, where $J$ denotes the…

We develop a categorical foundation for belief propagation on factor graphs. We construct the free hypergraph category \(\Syn_\Sigma\) on a typed signature and prove its universal property, yielding compositional semantics via a unique…

The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…