نتایج جستجو برای: up homomorphism

تعداد نتایج: 929912  

In this paper, we consider a class of connected oriented (with respect to Z/p) closed G-manifolds with a non-empty finite fixed point set, each of which is G-equivariantly formal, where G = Z/p and p is an odd prime. Using localization theorem and equivariant index, we give an explicit description of the mod p equivariant cohomology ring of such a G-manifold in terms of algebra. This makes ...

Journal: :Journal of Graph Theory 2010

1999
Dietmar A. Salamon

in symplectic Floer homology. Both were discovered by Donaldson. They are well defined up to an overall sign. The homomorphism (1) can be interpreted as a relative Donaldson invariant on a 4-manifold with boundary. In other words, this product is obtained by counting anti-self-dual connections over a 4-dimensional cobordism with n+ 1 cylindrical ends corresponding to Yfj . The second homomorphi...

Journal: :J. Comb. Theory, Ser. A 2007
Julian Pfeifle

We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...

2017
D. Conlon W. T. Gowers

A result of Fiz Pontiveros shows that if A is a random subset of ZN where each element is chosen independently with probability N−1/2+o(1), then with high probability every Freiman homomorphism defined on A can be extended to a Freiman homomorphism on the whole of ZN . In this paper we improve the bound to CN−2/3(logN)1/3, which is best possible up to the constant factor.

Journal: :Contributions to Discrete Mathematics 2011
Gary MacGillivray Jacobus Swarts Jørgen Bang-Jensen

In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exists to a fixed local tournament with at least two directed cycles is NP-complete. One of the main reasons for the graph theoretic proof is that it showcases all of the techniques that have been built up over the years in the study of the digraph homomorphism problem.

2000
Massimo Bartoli Marcello Pelillo Kaleem Siddiqi Steven W. Zucker

...

Journal: :Eur. J. Comb. 2013
János Kincses G. Makay Miklós Maróti József Osztényi László Zádori

Let Gn,k denote the Kneser graph whose vertices are the n-element subsets of a (2n + k)-element set and whose edges are the disjoint pairs. In this paper we prove that for any non-negative integer s there is no graph homomorphism from G4,2 to G4s+1,2s+1. This confirms a conjecture of Stahl in a special case.

Journal: :Asian Journal of Mathematics & Statistics 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید