We study the image of a transfer homomorphism in the stable homotopy groups of spheres. Actually, we show that an element of order 8 in the 18 dimensional stable stem is in the image of a double transfer homomorphism, which reproves a result due to P J Eccles that the element is represented by a framed hypersurface. Also, we determine the image of the transfer homomorphism in the 16 dimensional...

Let V ⊗n be the n–fold tensor product of a vector space V. Following I. Schur we consider the action of the symmetric group Sn on V ⊗n by permuting coordinates. In the ‘super’ (Z2 graded) case V = V0 ⊕ V1, a ± sign is added [BR]. These actions give rise to the corresponding Schur algebras S(Sn, V ). Here S(Sn, V ) is compared with S(An, V ), the Schur algebra corresponding to the alternating su...

We initiate a study of the homomorphism domination exponent of a pair of graphs F and G, defined as the maximum real number c such that |Hom(F, T )| > |Hom(G,T )| for every graph T . The problem of determining whether HDE(F,G) > 1 is known as the homomorphism domination problem and its decidability is an important open question arising in the theory of relational databases. We investigate the c...

For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If moreover each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), is the following problem. Given an input digraph G, ...

The notions of quasi-prime submodules and developed  Zariski topology was introduced by the present authors in cite{ah10}. In this paper we use these notions to define a scheme. For an $R$-module $M$, let $X:={Qin qSpec(M) mid (Q:_R M)inSpec(R)}$. It is proved that $(X, mathcal{O}_X)$ is a locally ringed space. We study the morphism of locally ringed spaces induced by $R$-homomorphism $Mrightar...

For any two graphs F and G, let hom(F,G) denote the number of homomorphisms F → G, that is, adjacency preserving maps V (F ) → V (G) (graphs may have loops but no multiple edges). We characterize Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary. Email: [email protected]. Research sponsored by OTKA Grant No. 67867. CWI and University of Amsterdam, Amsterdam, The Netherlands....

For a fixed graph H, we consider the H-Recoloring problem : given a graph G and two H-colorings of G, i.e., homomorphisms from G to H, can one be transformed into the other by changing one color at a time, maintaining an H-coloring throughout. This is the same as finding a path in the Hom(G,H) complex. For H = Kk this is the problem of finding paths between k-colorings, which was recently shown...