Compactifications of the homeomorphism group of a graph

Let Γ be a countable locally finite graph and let H(Γ) and H₊(Γ) denote the homeomorphism group of Γ with the compact-open topology and its identity component. These groups can be embedded into the space of all closed sets of Γ×Γ with the Fell topology, which is compact. Taking closure, we have natural compactifications and . In this paper, we completely determine the topological type of the pair and give a necessary and sufficient condition for this pair to be a (Q,s)-manifold. The pair is also considered for simple examples, and in particular, we find that has homotopy type of RP³. In this investigation we point out a certain inaccuracy in Sakai-Uehara's preceding results on for finite graphs Γ.     

New applications of Besov-type and Triebel-Lizorkin-type spaces

In this paper, the authors prove that Besov-Morrey spaces are proper subspaces of Besov-type spaces and that Triebel-Lizorkin-Morrey spaces are special cases of Triebel-Lizorkin-type spaces . The authors also establish an equivalent characterization of when τ∈[0,1/p). These Besov-type spaces and Triebel-Lizorkin-type spaces were recently introduced to connect Besov spaces and Triebel-Lizorkin spaces with Q spaces. Moreover, for the spaces and , the authors investigate their trace properties and the boundedness of the pseudo-differential operators with homogeneous symbols in these spaces, which generalize the corresponding classical results of Jawerth and Grafakos-Torres by taking τ=0.     

Well-posedness for the Navier-Stokes-Nernst-Planck-Poisson system in Triebel-Lizorkin space and Besov space with negative indices

This paper is concerned with the well-posedness of the Navier-Stokes-Nerst-Planck-Poisson system (NSNPP). Let sp=−2+n/p. We prove that the NSNPP has a unique local solution for in a subspace, i.e., Vu1×Vv1×Vv1, of with . We also prove that there exists a unique small global solution for any small initial data with .     

On wreathed lexicographic products of graphs

This paper proves a necessary and sufficient condition for the endomorphism monoid of a lexicographic product G[H] of graphs G,H to be the wreath product of the monoids and . The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs G.     

Periodicity of Adams operations on the Green ring of a finite group

The Adams operations and on the Green ring of a group G over a field K arise from the study of the exterior powers and symmetric powers of KG-modules. When G is finite and K has prime characteristic p we show that and are periodic in n if and only if the Sylow p-subgroups of G are cyclic. In the case where G is a cyclic p-group we find the minimum periods and use recent work of Symonds to express in terms of .     

Derivative of power series attached to Γ-transform of p-adic measures

We extend the result of Anglès (2007) [1], namely for the Iwasawa power series . For the derivative , a numerical polynomial Q on Zp, and a prime π in over p, we show that if and only if i.e. for all x∈Zp. This result comes from a similar assertion for the power series attached to the Γ-transform of a p-adic measure which is related to a certain rational function in .     

Some relations between rank, chromatic number and energy of graphs

The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. Let G be a graph of order n and be the rank of the adjacency matrix of G. In this paper we characterize all graphs with . Among other results we show that apart from a few families of graphs, , where n is the number of vertices of G, and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of are given.     

Game colouring of the square of graphs

This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then , and there are forests G with . It is also proved that for an outerplanar graph G of maximum degree Δ, , and for a planar graph G of maximum degree Δ, .     

Facet-inducing web and antiweb inequalities for the graph coloring polytope

For a graph G and its complement , we define the graph coloring polytope P(G) to be the convex hull of the incidence vectors of star partitions of . We examine inequalities whose support graphs are webs and antiwebs appearing as induced subgraphs in G. We show that for an antiweb in G the corresponding inequality is facet-inducing for P(G) if and only if is critical with respect to vertex colorings. An analogous result is also proved for the web inequalities.     

Generalization of transitive fraternal augmentations for directed graphs and its applications

Let be a directed graph. A transitive fraternal augmentation of is a directed graph with the same vertex set, including all the arcs of and such that for any vertices x,y,z,

1.

if and then or (fraternity);

2.

if and then (transitivity).

In this paper, we explore some generalization of the transitive fraternal augmentations for directed graphs and its applications. In particular, we show that the 2-coloring number col₂(G)≤O(∇₁(G)∇₀(G)²), where ∇_k(G) (k≥0) denotes the greatest reduced average density with depth k of a graph G; we give a constructive proof that ∇_k(G) bounds the distance (k+1)-coloring number col_k+1(G) with a function f(∇_k(G)). On the other hand, ∇_k(G)≤(col_2k+1(G))^2k+1. We also show that an inductive generalization of transitive fraternal augmentations can be used to study nonrepetitive colorings of graphs.     

Pseudocompact group topologies with no infinite compact subsets

We show that every Abelian group satisfying a mild cardinal inequality admits a pseudocompact group topology from which all countable subgroups inherit the maximal totally bounded topology (we say that such a topology satisfies property ).Every pseudocompact Abelian group G with cardinality |G|≤2^2c satisfies this inequality and therefore admits a pseudocompact group topology with property . Under the Singular Cardinal Hypothesis (SCH) this criterion can be combined with an analysis of the algebraic structure of pseudocompact groups to prove that every pseudocompact Abelian group admits a pseudocompact group topology with property .We also observe that pseudocompact Abelian groups with property contain no infinite compact subsets and are examples of Pontryagin reflexive precompact groups that are not compact.     

Chow groups of the moduli spaces of weighted pointed stable curves of genus zero

The moduli space of weighted pointed stable curves of genus zero is stratified according to the degeneration types of such curves. We show that the homology groups of are generated by the strata of and give all additive relations between them. We also observe that the Chow groups and the homology groups are isomorphic. This generalizes Kontsevich-Manin's and Losev-Manin's theorems to arbitrary weight data A.     

Heat flow, BMO, and the compactness of Toeplitz operators

In this paper, it is shown that the Berezin-Toeplitz operator Tg is compact or in the Schatten class Sp of the Segal-Bargmann space for 1?p<∞ whenever (vanishes at infinity) or , respectively, for some s with , where is the heat transform of g on Cn. Moreover, we show that compactness of Tg implies that is in C₀(Cn) for all and use this to show that, for g∈BMO¹(Cn), we have is in C₀(Cn) for some s>0 only if is in C₀(Cn) for alls>0. This “backwards heat flow” result seems to be unknown for g∈BMO¹ and even g∈L^∞. Finally, we show that our compactness and vanishing “backwards heat flow” results hold in the context of the weighted Bergman space , where the “heat flow” is replaced by the Berezin transform Bα(g) on for α>−1.     

Quasi-convex density and determining subgroups of compact abelian groups

For an abelian topological group G, let denote the dual group of all continuous characters endowed with the compact open topology. Given a closed subset X of an infinite compact abelian group G such that w(X)<w(G), and an open neighborhood U of 0 in T, we show that . (Here, w(G) denotes the weight of G.) A subgroup D of G determines G if the map defined by r(χ)=χ?D for , is an isomorphism between and . We prove that

     

Extension of Fourier algebra homomorphisms to duals of algebras of uniformly continuous functionals

For a locally compact group G, let XG be one of the following introverted subspaces of VN(G): , the C^∗-algebra of uniformly continuous functionals on A(G); , the space of weakly almost periodic functionals on A(G); or , the C^∗-algebra generated by the left regular representation on the measure algebra of G. We discuss the extension of homomorphisms of (reduced) Fourier-Stieltjes algebras on G and H to cb-norm preserving, weak^∗-weak^∗-continuous homomorphisms of into , where (XG,XH) is one of the pairs , , or . When G is amenable, these extensions are characterized in terms of piecewise affine maps.     

On the Brauer group of a semisimple algebraic group

Let k be a field with algebraic closure , G a semisimple algebraic k-group, and a maximal torus with character group X(T). Denote Λ the abstract weight lattice of the roots system of G, and by and the n-torsion subgroup of the Brauer group of k and G, respectively. We prove that if chark does not divide n and n is prime to the order of Λ/X(T) then the natural homomorphism is an isomorphism.     

Qualitative uncertainty principles for groups with finite dimensional irreducible representations

Let G be a locally compact group of type I and its dual space. Roughly speaking, qualitative uncertainty principles state that the concentration of a nonzero integrable function on G and of its operator-valued Fourier transform on is limited. Such principles have been established for locally compact abelian groups and for compact groups. In this paper we prove generalizations to the considerably larger class of groups with finite dimensional irreducible representations.     

Games with 1-backtracking

We associate with any game G another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for G: if a player has a winning strategy of recursive degree 1 over G, then it has a recursive winning strategy over , and vice versa. Through we can express in algorithmic form, as a recursive winning strategy, many (but not all) common proofs of non-constructive Mathematics, namely exactly the theorems of the sub-classical logic Limit Computable Mathematics (Hayashi (2006) [6], Hayashi and Nakata (2001) [7]).