Building ofGL(m, D) and centralizers

LetG=GL(m, D) whereD is a central division algebra over a commutative nonarchimedean local fieldF. LetE/F be a field extension contained inM(m, D). We denote byI (resp.I _E) the nonextended affine building ofG (resp. of the centralizer ofE ^x inG). In this paper we prove that there exists a uniqueG _E-equivariant affine mapj _EI_EI. It is injective and its image coincides with the set ofE ^x-fixed points inI. Moreover, we prove thatj _E is compatible with the Moy-Prasad filtrations.This author's contribution was written while he was a post-doctoral student at King's College London and supported by an european TMR grant     

A remark on covering graphs

Every graph G may be transformed into a covering graph either by deletion of edges or by subdivision. Let _E (G) and _V (G) denote corresponding minimal numbers. We prove _E (G) = _V (G) for every graph G.     

Generation of exceptional groups of Lie-type

In this paper we prove two theorems concerning the generation of a finite exceptional group of Lie-type G _F. The first is: there is a semisimple element s such that for nearly all elements x G _Fthe elements s and x generate the group G _F. The second theorem we prove is: if G is a finite simple exceptional group of Lie-type not of type E ₆ or ² E ₆, then it is generated by three involutions.The author gratefully acknowledges financial support by the Deutsche Forschungs-gemeinschaft.     

A weaker version of Lovász' path removal conjecture

We prove there exists a function f(k) such that for every f(k)-connected graph G and for every edge eE(G), there exists an induced cycle C containing e such that G−E(C) is k-connected. This proves a weakening of a conjecture of Lovász due to Kriesell.     

Largest Non-Unique Subgraphs

The reduction number r(G) of a graph G is the maximum integer m≤|E(G)| such that the graphs G−E, E⊆E(G),|E|≤m, are mutually non-isomorphic, i.e., each graph is unique as a subgraph of G. We prove that and show by probabilistic methods that r(G) can come close to this bound for large orders. By direct construction, we exhibit graphs with large reduction number, although somewhat smaller than the upper bound. We also discuss similarities to a parameter introduced by Erdős and Rényi capturing the degree of asymmetry of a graph, and we consider graphs with few circuits in some detail. Supported by a grant from the Danish Natural Science Research Council.     

Embeddings of graphs in euclidean spaces

The dimension of a graphG=(V, E) is the minimum numberd such that there exists a representation and a thresholdt such thatxy E iff . We prove that d(G)n–x(G) and wheren=|V| andx(G) is the chromatic number ofG; we present upper bounds for the dimension of graphs with a large girth and we show that the complement of a forest can be represented by unit vectors inR ⁶. We prove that d(G)1/15n for most graphs and that there are 3-regular graphs with d(G)c logn/log logn.     

Equivariant K-Homology and Restriction to Finite Cyclic Subgroups

For a discrete group G, we prove that a G-map between proper G–CW-complexes induces an isomorphism in G-equivariant K-homology if it induces an isomorphism in C-equivariant K-homology for every finite cyclic subgroup C of G. As an application, we show that the source of the Baum–Connes assembly map, namely K _* ^G (E(G, in)), is isomorphic to K _* ^G (E(G, )), where E(G, ) denotes the classifying space for the family of finite cyclic subgroups of G. Letting be the family of virtually cyclic subgroups of G, we also establish that and related results.     

The density condition in subspaces and quotients of Frechet spaces

The aim of this note is to investigate the topological structure (in particular the density condition) of subspaces and separated quotients of Fréchet spaces. Our main result is the following one: LetE be a Fréchet space which is neither Montel nor isomorphic to a closed subspace ofX × , withX a Banach space, also assume thatE can be written asFG withF andG infinite dimensional closed subspaces ofE not isomorphic to , thenE contains a closed subspace with basis and not satisfying the density condition. We also prove that every Köthe echelon space of orderp, 1<p<, which is not quasinormable has a separated quotient with basis which does not satisfy the density condition.     

Galois Stability, Integrality and Realization Fields for Representations of Finite Abelian Groups

For a given field F of characteristic 0 we consider a normal extension E/F of finite degree d and finite Abelian subgroups GGL _n (E) of a given exponent t. We assume that G is stable under the natural action of the Galois group of E/F and consider the fields E=F(G) that are obtained via adjoining all matrix coefficients of all matrices gG to F. It is proved that under some reasonable restrictions for n, any E can be realized as F(G), while if all coefficients of matrices in G are algebraic integers, there are only finitely many fields E=F(G) for prescribed integers n and t or prescribed n and d.     

Antimagic labelling of vertex weighted graphs

Suppose G is a graph, k is a non‐negative integer. We say G is k‐antimagic if there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . We say G is weighted‐k‐antimagic if for any vertex weight function w: V→?, there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . A well‐known conjecture asserts that every connected graph G≠K₂ is 0‐antimagic. On the other hand, there are connected graphs G≠K₂ which are not weighted‐1‐antimagic. It is unknown whether every connected graph G≠K₂ is weighted‐2‐antimagic. In this paper, we prove that if G has a universal vertex, then G is weighted‐2‐antimagic. If G has a prime number of vertices and has a Hamiltonian path, then G is weighted‐1‐antimagic. We also prove that every connected graph G≠K₂ on n vertices is weighted‐ ?3n/2?‐antimagic. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory     

There exist graphs with super‐exponential Ramsey multiplicity constant

The Ramsey multiplicity M(G;n) of a graph G is the minimum number of monochromatic copies of G over all 2‐colorings of the edges of the complete graph K_n. For a graph G with a automorphisms, ν vertices, and E edges, it is natural to define the Ramsey multiplicity constant C(G) to be , which is the limit of the fraction of the total number of copies of G which must be monochromatic in a 2‐coloring of the edges of K_n. In 1980, Burr and Rosta showed that 0 ≥ C(G) ≤ 2^1?E for all graphs G, and conjectured that this upper bound is tight. Counterexamples of Burr and Rosta's conjecture were first found by Sidorenko and Thomason independently. Later, Clark proved that there are graphs G with E edges and 2^E?1C(G) arbitrarily small. We prove that for each positive integer E, there is a graph G with E edges and C(G) ≤ E^{?E/2 + o(E)}. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 89–98, 2008     

The projection theorem for spectral sets

LetG be a locally compact group with polynomial growth and symmetricL ¹-algebra andN a closed normal subgroup ofG. LetF be a closedG-invariant subset of Prim_* L ¹(N) andE={ker; with |N(k(F))=0}. We prove thatE is a spectral subset of Prim_* L ¹(G) ifF is spectral. Moreover we give the following application to the ideal theory ofL ¹(G). Suppose that, in addition,N is CCR andG/N is compact. Then all primary ideals inL ¹(G) are maximal, provided allG-orbits in Prim_* L ¹(N) are spectral.Dedicated to Professor Elmar Thoma on the occasion of his 60th birthday     

On Domination Number of 4-Regular Graphs

Let G be a simple graph. A subset S V is a dominating set of G, if for any vertex v V – S there exists a vertex u S such that uv E(G). The domination number, denoted by (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G) ⁴/₁₁ n     

A Linear Heterochromatic Number of Graphs

Let G=(V(G),E(G)) be a multigraph with multiple loops allowed, and V ₀V(G). We define h(G,V ₀) to be the minimum integer k such that for every edge-colouring of G using exactly k colours, all the edges incident with some vertex in V ₀ receive different colours. In this paper we prove that if each xV ₀ is incident to at least two edges of G, then h(G,V ₀)=(G[V ₀])+|E(G)|–|V ₀|+1 where (G[V ₀]) is the maximum cardinality of a set of mutually disjoint cycles (of length at least two) in the subgraph induced by V ₀. Acknowledgments.We thank the referee for suggesting us a short alternative proof of our main theorem.     

Regular selections for multiple-valued functions

Given a multiple-valued function f, we deal with the problem of selecting its single-valued branches. This problem can be stated in a rather abstract setting considering a metric space E and a finite group G of isometries of E. Given a function f, which takes values in the equivalence classes of E/G, the problem consists of finding a map g with the same domain as f and taking values in E, such that at every point t the equivalence class of g(t) coincides with f(t).If the domain of f is an interval, we show the existence of a function g with these properties which, moreover, has the same modulus of continuity of f. In the particular case where E is the product of Q copies of ⁿ and G is the group of permutations of Q elements, it is possible to introduce a notion of differentiability for multiple-valued functions. In this case, we prove that the function g can be constructed in such a way to preserve C^k, regularity.Some related problems are also discussed. Mathematics Subject Classification (2000) 54C60     

The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs

A setE ofk edges in a multigraphG=(V,E) is said to be ak most vital edge set (k-MVE set) if these edges being removed fromG, the resultant graphG=(V,E –E) has minimum number of spanning trees. The problem of finding ak-MVE set for two-terminal series-parallel graphs is considered in this paper. We present anO (|E|) time algorithm for the casek=1, and anO(|V| ^k +|E|) time algorithm for arbitraryk.     

A note on the signed edge domination number in graphs

Let G=(V(G),E(G)) be a graph. A function f:E(G)→{+1,−1} is called the signed edge domination function (SEDF) of G if ∑_e^′N[e]f(e^′)≥1 for every eE(G). The signed edge domination number of G is defined as is a SEDF of G}. Xu [Baogen Xu, Two classes of edge domination in graphs, Discrete Applied Mathematics 154 (2006) 1541–1546] researched on the edge domination in graphs and proved that for any graph G of order n(n≥4). In the article, he conjectured that: For any 2-connected graph G of order n(n≥2), . In this note, we present some counterexamples to the above conjecture and prove that there exists a family of k-connected graphs G_m,k with .     

Fonctions séparément harmoniques,un théorème de type Terada

Given D a domain in , G an open set in and E a subset of D verifying the harmonic analogue of Local Polynomial Condition of Leja at some point in D. We prove that if f(x, y) is a complex function defined on D × G such that– f(x, ) is harmonic on G for every fixed x E,– f(, y) is harmonic on D for every fixed y G,then f is harmonic in (x, y) on D × G.     

Lie Groupoids, Gerbes, and Non-Abelian Cohomology

We observe that any regular Lie groupoid G over a manifold M fits into an extension K G E of a foliation groupoid E by a bundle of connected Lie groups K. If F is the foliation on M given by the orbits of E and T is a complete transversal to F , this extension restricts to T, as an extension K _T G _T E _T of an étale groupoid E _T by a bundle of connected groups K _T . We break up the classification problem for regular Lie groupoids into two parts. On the one hand, we classify the latter extensions of étale groupoids by (non-Abelian) cohomology classes in a new ech cohomology of étale groupoids. On the other hand, given K and E and an extension K _T G _T E _T over T, we present a cohomological obstruction to the problem of whether this is the restriction of an extension K G E over M; if this obstruction vanishes, all extensions K G E over M which restrict to a given extension over the transversal together form a principal bundle over a group of bitorsors under K.