相关论文: Phantom maps and chromatic phantom maps

We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…

A phantom category is an admissible subcategory with vanishing Grothendieck group of the bounded derived category of coherent sheaves on a smooth projective variety. The goal of this paper is to study the abstract situation when such a…

Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral graphs is formed by two graphs such that the absolute values of their nonzero eigenvalues coincide. Clearly, a pair of cospectral graphs is also…

The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…

Completely positive trace preserving maps are widely used in quantum information theory. These are mostly studied using the master equation perspective. A central part in this theory is to study whether a given system of dynamical maps…

In this paper two important aspects related to Caputo fractional-order discrete variant of a class of maps defined on the complex plane, are analytically and numerically revealed: attractors symmetry-broken induced by the fractional-order…

It is shown that the existence of a biseparating map between a large class of spaces of vector-valued continuous functions A(X,E) and A(Y,F) implies that some compactifications of X and Y are homeomorphic. In some cases, conditions are…

We define a quasi-Fatou component of a quasiregular map as a connected component of the complement of the Julia set. A domain in $\mathbb{R}^d$ is called hollow if it has a bounded complementary component. We show that for each $d \geq 2$…

The term integrable asymptotically conformal at a point for a quasiconformal map defined on a domain is defined. Furthermore, we prove that there is a normal form for this kind attracting or repelling or super-attracting fixed point with…

A selfmap is Wecken when the minimal number of fixed points among all maps in its homotopy class is equal to the Nielsen number, a homotopy invariant lower bound on the number of fixed points. All selfmaps are Wecken for manifolds of…

To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…

Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Given a connected, compact, totally geodesic submanifold Y^m of noncompact type inside a compact locally symmetric space of noncompact type X^n, we provide a sufficient condition that ensures that [Y^m] is nonzero in H_m(X^n; R); in low…

A classic result of Asplund and Gr\"unbaum states that intersection graphs of axis-aligned rectangles in the plane are $\chi$-bounded. This theorem can be equivalently stated in terms of path-decompositions as follows: There exists a…

This paper serves as the first extension of the topic of dominator colorings of graphs to the setting of digraphs. We establish the dominator chromatic number over all possible orientations of paths and cycles. In this endeavor we discover…

In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…

The study of quantum chromatic numbers of graphs is a hot research topic in recent years. However, the infinite family of graphs with known quantum chromatic numbers are rare, as far as we know, the only known such graphs (except for…

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…