Two, more readily computable equivariant Nielsen numbers I. Nielsen theory for M-ads

In this, the first of two papers outlining a Nielsen theory for “two, more readily computable equivariant numbers”, we define and study two Nielsen type numbers N(f,k;X−{Xν}_ν∈M) and N(f,k;X,{Xν}_ν∈M), where f and k are M-ad maps. While a Nielsen theory of M-ads is of interest in its own right, our main motivation lies in the fact that maps of M-ads accurately mirror one of two fundamental structures of equivariant maps. Being simpler however, M-ad Nielsen numbers are easier to study and to compute than equivariant Nielsen numbers. In the sequel, we show our M-ad numbers can be used to form both upper and lower bounds on their equivariant counterparts.The numbers N(f,k;X−{Xν}_ν∈M) and N(f,k;X,{Xν}_ν∈M), generalize the generalizations to coincidences, of Zhao's Nielsen number on the complement N(f;X−A), respectively Schirmer's relative Nielsen number N(f;X,A). Our generalizations are from the category of pairs, to the category of M-ads. The new numbers are lower bounds for the number of coincidence points of all maps f^′ and k^′ which are homotopic as maps ofM-ads to f, respectively k firstly on the complement of the union of the subspaces Xν in the domain M-ad X, and secondly on all of X. The second number is shown to be greater than or equal to a sum of the first of our numbers. Conditions are given which allow for both equality, and Möbius inversion. Finally we show that the fixed point case of our second number generalizes Schirmer's triad Nielsen number N(f;X₁∪X₂).Our work is very different from what at first sight appears to be similar partial results due to P. Wong. The differences, while in some sense subtle in terms of definition, are profound in terms of commutability. In order to work in a variety of both fixed point and coincidence points contexts, we introduce in this first paper and extend in the second, the concept of an essentiality on a topological category. This allows us to give computational theorems within this diversity. Finally we include an introduction to both papers here.     

Equidistribution of Hecke Eigenforms on the Arithmetic Surface Γ0(N)\H

Given the orthonormal basis of Hecke eigenforms in S_2k(Γ(1)), Luo established an associated probability measure dμ_k on the modular surface Γ(1)\H that tends weakly to the invariant measure on Γ(1)\H. We generalize his result to the arithmetic surface Γ₀(N)\H where N?1 is square-free     

Computation of Nielsen numbers for maps of compact surfaces with boundary

In this paper we study the Nielsen number of a self-map f:M→M of a compact connected surface with boundary. Let G=π₁(M) be the fundamental group of M which is a finitely generated free group. We introduce a new algebraic condition called “bounded solution length” on the induced endomorphism φ:G→G of f and show that many maps which have no remnant satisfy this condition. For a map f that has bounded solution length, we describe an algorithm for computing the Nielsen number N(f).     

On the Ramsey-Turán numbers of graphs and hypergraphs

Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RT _t (n,H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G with α _t (G) ≤ f(n), where α _t (G) is the maximum number of vertices in a K _t -free induced subgraph of G. Erd?s, Hajnal, Simonovits, Sós and Szemerédi [6] posed several open questions about RT _t (n,K _s , o(n)), among them finding the minimum ? such that RT _t (n,K _t+? , o(n)) = Ω(n ²), where it is easy to see that RT _t (n,K _t+1, o(n)) = o(n ²). In this paper, we answer this question by proving that RT _t (n,K _t+2, o(n)) = Ω(n ²); our constructions also imply several results on the Ramsey-Turán numbers of hypergraphs.     

Representation theory of 2-groups on Kapranov and Voevodsky's 2-vector spaces

In this paper the representation theory of 2-groups in 2-categories is considered, focusing the attention on the 2-category Rep2MatK(G) of representations of a 2-group G in (a version of) Kapranov and Voevodsky's 2-category of 2-vector spaces over a field K. The set of equivalence classes of such representations is computed in terms of the invariants π₀(G), π₁(G) and [α]∈H³(π₀(G),π₁(G)) classifying G, and the categories of intertwiners are described in terms of categories of vector bundles endowed with a projective action. In particular, it is shown that the monoidal category of finite dimensional linear representations (more generally, the category of [z]-projective representations, for any given cohomology class [z]∈H²(π₀(G),K^∗)) of the first homotopy group π₀(G) as well as its category of representations on finite sets both live in Rep2MatK(G), the first as the monoidal category of endomorphisms of the trivial representation (more generally, as the category of intertwiners between suitable 1-dimensional representations) and the second as a non-full subcategory of the homotopy category of Rep2MatK(G).     

Finding a monochromatic subgraph or a rainbow path

For simple graphs G and H, let f(G,H) denote the least integer N such that every coloring of the edges of K_N contains either a monochromatic copy of G or a rainbow copy of H. Here we investigate f(G,H) when H = P_k. We show that even if the number of colors is unrestricted when defining f(G,H), the function f(G,P_k), for k = 4 and 5, equals the (k ? 2)‐ coloring diagonal Ramsey number of G. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Max-min of polynomials and exponential diophantine equations

In this paper we study the maximum-minimum value of polynomials over the integer ring Z. In particular, we prove the following: Let F(x,y) be a polynomial over Z. Then, maxx∈Z(T)miny∈Z|F(x,y)|=o(T1/2) as T→∞ if and only if there is a positive integer B such that maxx∈Zminy∈Z|F(x,y)|?B. We then apply these results to exponential diophantine equations and obtain that: Let f(x,y), g(x,y) and G(x,y) be polynomials over Q, G(x,y)∈(Q[x,y]−Q[x])∪Q, and b a positive integer. For every α in Z, there is a y in Z such that f(α,y)+g(α,y)bG(α,y)=0 if and only if for every integer α there exists an h(x)∈Q[x] such that f(x,h(x))+g(x,h(x))bG(x,h(x))≡0, and h(α)∈Z.     

A polynomial bound on the number of comaximal localizations needed in order to make free a projective module

Let A be a commutative ring and M be a projective module of rank k with n generators. Let h=n-k. Standard computations show that M becomes free after localizations in comaximal elements (see Theorem 5). When the base ring A contains a field with at least hk+1 non-zero distinct elements we construct a comaximal family G with at most (hk+1)(nk+1) elements such that for each g∈G, the module M_g is free over A[1/g].     

Vertex Coverings by Coloured Induced Graphs—Frames and Umbrellas

A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if for every vertex y of H there is an induced copy of G in H containing y. For positive integer k, let f_k(G) (respectively, g_k(G)) be the minimum order of a graph H whose edges can be k-coloured such that for each colour, G homogeneously embeds (respectively, uniformly embeds) in the graph given by V(H) and the edges of that colour. We investigate the values f₂(G) and g₂(G) for special classes of G, in particular when G is a star or balanced complete bipartite graph. Then we investigate f_k(G) and g_k(G) when k ≥ 3 and G is a complete graph.     

Coincidence Nielsen numbers for covering maps for smooth manifolds

Let be maps between closed smooth manifolds of the same dimension, and let and be finite regular covering maps. If the manifolds are nonorientable, using semi-index, we introduce two new Nielsen numbers. The first one is the Linear Nielsen number NL(f,g), which is a linear combination of the Nielsen numbers of the lifts of f and g. The second one is the Nonlinear Nielsen number NED(f,g). It is the number of certain essential classes whose inverse images by p are inessential Nielsen classes. In fact, N(f,g)=NL(f,g)+NED(f,g), where by abuse of notation, N(f,g) denotes the coincidence Nielsen number defined using semi-index.     

On R-robustly entropy-expansive diffeomorphisms

For a homoclinic class H(p _f ) of f ?? Diff¹(M), f?OH(p _f ) is called R-robustly entropy-expansive if for g in a locally residual subset around f, the set ?? _? (x) = {y ?? M: dist(g ⁿ (x), g ⁿ (y)) ?? g3 (?n ?? ?)} has zero topological entropy for each x ?? H(p _g ). We prove that there exists an open and dense set around f such that for every g in it, H(p _g ) admits a dominated splitting of the form E ?? F ₁ ?? ... ?? F _k ?? G where all of F _i are one-dimensional and non-hyperbolic, which extends a result of Pacifico and Vieitez for robustly entropy-expansive diffeomorphisms. Some relevant consequences are also shown.     

Recurrent points and non-wandering points of graph maps

Let G be a graph and f:G→G be a continuous map. Denote by P(f), R(f) and Ω(f) the sets of periodic points, recurrent points and non-wandering points of f, respectively. In this paper we show that: (1) If L=(x,y) is an open arc contained in an edge of G such that {fm(x),fk(y)}⊂(x,y) for some m,k∈N, then R(f)∩(x,y)≠∅; (2) Any isolated point of P(f) is also an isolated point of Ω(f); (3) If x∈Ω(f)−Ω(fn) for some n∈N, then x is an eventually periodic point. These generalize the corresponding results in W. Huang and X. Ye (2001) [9] and J. Xiong (1983, 1986) [17] and [19] on interval maps or tree maps.     

Existence and nonuniqueness of solutions to a functional-differential equation

We examine the functional-differential equation Δu(x) — div(u(H(x))f (x)) = 0 on a torus which is a generalization of the stationary Fokker-Planck equation. Under sufficiently general assumptions on the vector field f and the map H, we prove the existence of a nontrivial solution. In some cases the subspace of solutions is established to be multidimensional.     

Nonorientable genus of nearly complete bipartite graphs

LetG(m, n, k), m, n≥3,k≤min(m, n), be the graph obtained from the complete bipartite graphK _m,n by deleting an arbitrary set ofk independent edges, and let $$f(m,n,k) = [(m - 2)(n - 2) - k]/2.$$ It is shown that the nonorientable genus \(\tilde \gamma \) (G(m, n, k)) of the graphG(m, n, k) is equal to the upper integer part off(m, n, k), except in trivial cases wheref(m, n, k)≤0 and possibly in some extreme cases, the graphsG(k, k, k) andG(k + 1,k, k). These cases are also discussed, obtaining some positive and some negative results. In particular, it is shown thatG(5, 4, 4) andG(5, 5, 5) have no nonorientable quadrilateral embedding.     

Exceptional sets related to Hayman's alternative

Let E be a subset of the complex plane C consisting of a countable set of points tending to ∞ and let k?1 be an integer. We derive a spacing condition (dependent on k) on the points of E which ensures that, if f is a function meromorphic in C with sufficiently large Nevanlinna deficiency at the poles, then either f takes every complex value infinitely often, or the kth derivative f(k) takes every non-zero complex value infinitely often, in C−E. This improves a previous result of Langley.     

On realizations of point determining graphs, and obstructions to full homomorphisms

A graph is point determining if distinct vertices have distinct neighbourhoods. A realization of a point determining graph H is a point determining graph G such that each vertex-removed subgraph G-x which is point determining, is isomorphic to H. We study the fine structure of point determining graphs, and conclude that every point determining graph has at most two realizations.A full homomorphism of a graph G to a graph H is a vertex mapping f such that for distinct vertices u and v of G, we have uv an edge of G if and only if f(u)f(v) is an edge of H. For a fixed graph H, a full H-colouring of G is a full homomorphism of G to H. A minimal H-obstruction is a graph G which does not admit a full H-colouring, such that each proper induced subgraph of G admits a full H-colouring. We analyse minimal H-obstructions using our results on point determining graphs. We connect the two problems by proving that if H has k vertices, then a graph with k+1 vertices is a minimal H-obstruction if and only if it is a realization of H. We conclude that every minimal H-obstruction has at most k+1 vertices, and there are at most two minimal H-obstructions with k+1 vertices.We also consider full homomorphisms to graphs H in which loops are allowed. If H has ? loops and k vertices without loops, then every minimal H-obstruction has at most (k+1)(?+1) vertices, and, when both k and ? are positive, there is at most one minimal H-obstruction with (k+1)(?+1) vertices.In particular, this yields a finite forbidden subgraph characterization of full H-colourability, for any graph H with loops allowed.     

On commutators of equivariant homeomorphisms

The long-standing problem of the perfectness of the compactly supported equivariant homeomorphism group on a G-manifold (with one orbit type) is solved in the affirmative. The proof is based on an argument different than that for the case of diffeomorphisms. The theorem is a starting point for computing H₁(HG(M)) for more complicated G-manifolds.     

Weakly Koszul-like modules

The Koszul-like property for any finitely generated graded modules over a Koszul-like algebra is investigated and the notion of weakly Koszul-like module is introduced. We show that a finitely generated graded module M is a weakly Koszul-like module if and only if it can be approximated by Koszul-like graded submodules, which is equivalent to the fact that G(M) is a Koszul-like module, where G(M) denotes the associated graded module of M. As applications, the relationships between minimal graded projective resolutions of M and G(M), and Koszul-like submodules are established. Moreover, the Koszul dual of a weakly Koszul-like module is proved to be generated in degree 0 as a graded E(A)-module.