Related papers: Phantom maps and chromatic phantom maps
We develop criteria for deciding the contravariant finiteness status of a subcategory $A \subseteq \Lambda\text{-mod}$, where $\Lambda$ is a finite dimensional algebra. In particular, given a finite dimensional $\Lambda$-module $X$, we…
Shoen and Uhlenbeck showed that ``tangent maps'' can be defined at singular points of energy minimizing maps. Unfortunately these are not unique, even for generic boundary conditions. Examples are discussed which have isolated singularities…
We study a class of one-dimensional full branch maps admitting two indifferent fixed points as well as critical points and/or unbounded derivative. Under some mild assumptions we prove the existence of a unique invariant mixing absolutely…
A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We discuss a class of phantom ($p < - \varrho$) cosmological models. Except for phantom we admit various forms of standard types of matter and discuss the problem of singularities for these cosmologies. The singularities are different from…
We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…
The interplay of minimum degree conditions and structural properties of large graphs with forbidden subgraphs is a central topic in extremal graph theory. For a given graph $F$ we define the homomorphism threshold as the infimum over all…
Using Ravenel's Thom spectrum $X(n)$, we introduce the concept of chromatic defect, which measures how far a spectrum is from being complex-orientable. We compute the chromatic defect of various examples of interest, such as finite spectra,…
A successful generalization of phantom map theory to the equivariant case for all compact Lie groups is obtained in this paper. One of the key observations is the discovery of the fact that homotopy fiber of equivariant completion splits as…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…
A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…
We study biharmonic maps between Riemannian manifolds with finite energy and finite bi-energy. We show that if the domain is complete and the target of non-positive curvature, then such a map is harmonic. We then give applications to…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
A connected $n$-chromatic graph $G$ is double-critical if for all the edges $xy$ of $G$, the graph $G-x-y$ is $(n-2)$-chromatic. In 1966, Erd\H os and Lov\'asz conjectured that the only double-critical $n$-chromatic graph is $K_n$. This…
A discrete dynamical system in Euclidean m-space generated by the iterates of an asymptotically zero map f, satisfying f(x) goes to zero as x goes to infinity, must have a compact global attracting set $A $. The question of what additional…
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…