Sequences and filters of characters characterizing subgroups of compact Abelian groups

Let H be a countable subgroup of the metrizable compact Abelian group G and a (not necessarily continuous) character of H. Then there exists a sequence of (continuous) characters of G such that limn→∞χn(α)=f(α) for all α∈H and does not converge whenever α∈G?H. If one drops the countability and metrizability requirement one can obtain similar results by using filters of characters instead of sequences. Furthermore the introduced methods allow to answer questions of Dikranjan et al.     

Eigenvalues and degree deviation in graphs

Let G be a graph with n vertices and m edges and let μ(G) = μ₁(G) ? ? ? μ_n(G) be the eigenvalues of its adjacency matrix. Set s(G)=∑_u∈V(G)∣d(u)-2m/n∣. We prove that

     

Locally compact abelian groups admitting non-trivial quasi-convex null sequences

In this paper, we show that, for every locally compact abelian group G, the following statements are equivalent:

(i)

G contains no sequence such that {0}∪{±x_n∣n∈N} is infinite and quasi-convex in G, and x_n?0;

(ii)

one of the subgroups {g∈G∣2g=0} or {g∈G∣3g=0} is open in G;

(iii)

G contains an open compact subgroup of the form or for some cardinal κ.

     

Precompact abelian groups and topological annihilators

For a compact Hausdorff abelian group K and its subgroup H≤K, one defines the g-closureg_K(H) of H in K as the subgroup consisting of χ∈K such that χ(a_n)?0 in T=R/Z for every sequence {a_n} in (the Pontryagin dual of K) that converges to 0 in the topology that H induces on . We prove that every countable subgroup of a compact Hausdorff group is g-closed, and thus give a positive answer to two problems of Dikranjan, Milan and Tonolo. We also show that every g-closed subgroup of a compact Hausdorff group is realcompact. The techniques developed in the paper are used to construct a close relative of the closure operator g that coincides with the G_δ-closure on compact Hausdorff abelian groups, and thus captures realcompactness and pseudocompactness of subgroups.     

Soluble groups with their centralizer factor groups of bounded rank

For a group class X, a group G is said to be a CX-group if the factor group G/C_G(g^G)∈X for all g∈G, where C_G(g^G) is the centralizer in G of the normal closure of g in G. For the class F_f of groups of finite order less than or equal to f, a classical result of B.H. Neumann [Groups with finite classes of conjugate elements, Proc. London Math. Soc. 1 (1951) 178-187] states that if G∈CF_f, the commutator group G^′ belongs to F_f^′ for some f^′ depending only on f. We prove that a similar result holds for the class , the class of soluble groups of derived length at most d which have Prüfer rank at most r. Namely, if , then for some r^′ depending only on r. Moreover, if , then for some r^′ and f^′ depending only on r,d and f.     

Graphs with maximal signless Laplacian spectral radius

By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ρ(Q(G)) over all connected graphs with given numbers of vertices and edges are (degree) maximal. For a maximal graph G with n vertices and r distinct vertex degrees δ_r>δ_r-1>?>δ₁, it is proved that ρ(Q(G))<ρ(Q(H)) for some maximal graph H with n+1 (respectively, n) vertices and the same number of edges as G if either G has precisely two dominating vertices or there exists an integer such that δ_i+δ_r+1-i?n+1 (respectively, δ_i+δ_r+1-i?δ_l+δ_r-l+1). Graphs that maximize ρ(Q(G)) over the class of graphs with m edges and m-k vertices, for k=0,1,2,3, are completely determined.     

On the Kurosh rank of the intersection of subgroups in free products of groups

The Kurosh rank rK(H) of a subgroup H of a free product of groups Gα, α∈I, is defined accordingly to the classic Kurosh subgroup theorem as the number of free factors of H. We prove that if H₁, H₂ are subgroups of and H₁, H₂ have finite Kurosh rank, then , where , q^∗ is the minimum of orders >2 of finite subgroups of groups Gα, α∈I, q^∗:=∞ if there are no such subgroups, and if q^∗=∞. In particular, if the factors Gα, α∈I, are torsion-free groups, then .     

Bandwidth of the strong product of two connected graphs

The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)-f(y)|:xy∈E(G)} taken over all proper numberings f of G. The strong product of two graphs G and H, written as G(S_P)H, is the graph with vertex set V(G)×V(H) and with (u₁,v₁) adjacent to (u₂,v₂) if one of the following holds: (a) u₁ and v₁ are adjacent to u₂ and v₂ in G and H, respectively, (b) u₁ is adjacent to u₂ in G and v₁=v₂, or (c) u₁=u₂ and v₁ is adjacent to v₂ in H. In this paper, we investigate the bandwidth of the strong product of two connected graphs. Let G be a connected graph. We denote the diameter of G by D(G). Let d be a positive integer and let x,y be two vertices of G. Let denote the set of vertices v so that the distance between x and v in G is at most d. We define δ_d(G) as the minimum value of over all vertices x of G. Let denote the set of vertices z such that the distance between x and z in G is at most d-1 and z is adjacent to y. We denote the larger of and by . We define η(G)=1 if G is complete and η(G) as the minimum of over all pair of vertices x,y of G otherwise. Let G and H be two connected graphs. Among other results, we prove that if δ_D(H)(G)?B(G)D(H)+1 and B(H)=⌈(|V(H)|+η(H)-2)/D(H)⌉, then B(G(S_P)H)=B(G)|V(H)|+B(H). Moreover, we show that this result determines the bandwidth of the strong product of some classes of graphs. Furthermore, we study the bandwidth of the strong product of power of paths with complete bipartite graphs.     

Domination with exponential decay

Let G be a graph and S⊆V(G). For each vertex u∈S and for each v∈V(G)−S, we define to be the length of a shortest path in 〈V(G)−(S−{u})〉 if such a path exists, and ∞ otherwise. Let v∈V(G). We define if v⁄∈S, and w_S(v)=2 if v∈S. If, for each v∈V(G), we have w_S(v)≥1, then S is an exponential dominating set. The smallest cardinality of an exponential dominating set is the exponential domination number, γ_e(G). In this paper, we prove: (i) that if G is a connected graph of diameter d, then γ_e(G)≥(d+2)/4, and, (ii) that if G is a connected graph of order n, then .     

Convergence preserving mappings on topological groups

It is well known that a mapping is convergence preserving, that is, whenever an infinite series ∑an converges, the series ∑φ(an) converges, if and only if there exists m∈R such that φ(x)=mx in some neighborhood of 0. We explore convergence preserving mappings on Hausdorff topological groups, showing in particular, that if G×G is a Fréchet group, and H has no small subgroups, then a mapping is convergence preserving if and only if there is a neighborhood of the identity in G on which φ is a sequentially continuous homomorphism.     

On the Erd?s-Ginzburg-Ziv constant of finite abelian groups of high rank

Let G be a finite abelian group. The Erd?s-Ginzburg-Ziv constant s(G) of G is defined as the smallest integer l∈N such that every sequence S over G of length |S|?l has a zero-sum subsequence T of length |T|=exp(G). If G has rank at most two, then the precise value of s(G) is known (for cyclic groups this is the theorem of Erd?s-Ginzburg-Ziv). Only very little is known for groups of higher rank. In the present paper, we focus on groups of the form , with n,r∈N and n?2, and we tackle the study of s(G) with a new approach, combining the direct problem with the associated inverse problem.     

More on decompositions of edge-colored complete graphs

Let G be a family of graphs whose edges are colored with elements from a set R of r colors. We assume no two vertices of G are joined by more than one edge of color i for any i∈R, for each G∈G. will denote the complete graph with r edges joining any pair of distinct vertices, one of each of the r colors. We describe necessary and asymptotically sufficient conditions on n for the existence of a family D of subgraphs of , each of which is an isomorphic copy of some graph in G, so that each edge of appears in exactly one of the subgraphs in D.     

Arithmetical properties of wendt's determinant

Wendt's determinant of order n is the circulant determinant W_n whose (i,j)-th entry is the binomial coefficient , for 1?i,j?n, where n is a positive integer. We establish some congruence relations satisfied by these rational integers. Thus, if p is a prime number and k a positive integer, then and . If q is another prime, distinct from p, and h any positive integer, then . Furthermore, if p is odd, then . In particular, if p?5, then . Also, if m and n are relatively prime positive integers, then W_mW_n divides W_mn.     

Universal factorization property of certain polycyclic groups

Let H be a torsion-free strongly polycyclic (torsion-free virtually polycyclic, resp.) group. Let G be any group with maximal condition. We show that there exists a torsion-free strongly polycyclic (torsion-free virtually polycyclic, resp.) group and an epimorphism such that for any homomorphism ?:G→H, it factors through , i.e., there exists a homomorphism such that . We show that this factorization property cannot be extended to any finitely generated group G. As an application of factorization, we give necessary and sufficient conditions for N(f,g)=R(f,g) to hold for maps f,g:X→Y between closed orientable n-manifolds where π₁(X) has the maximal condition, Y is an infra-solvmanifold, N(f,g) and R(f,g) denote the Nielsen and Reidemeister coincidence numbers, respectively.     

Operator space structure and amenability for Figà-Talamanca-Herz algebras

Column and row operator spaces—which we denote by COL and ROW, respectively—over arbitrary Banach spaces were introduced by the first-named author; for Hilbert spaces, these definitions coincide with the usual ones. Given a locally compact group G and p,p′∈(1,∞) with , we use the operator space structure on to equip the Figà-Talamanca-Herz algebra A_p(G) with an operator space structure, turning it into a quantized Banach algebra. Moreover, we show that, for p?q?2 or 2?q?p and amenable G, the canonical inclusion A_q(G)⊂A_p(G) is completely bounded (with cb-norm at most , where is Grothendieck's constant). As an application, we show that G is amenable if and only if A_p(G) is operator amenable for all—and equivalently for one—p∈(1,∞); this extends a theorem by Ruan.     

Packing directed cycles efficiently

Let G be a simple digraph. The dicycle packing number of G, denoted ν_c(G), is the maximum size of a set of arc-disjoint directed cycles in G. Let G be a digraph with a nonnegative arc-weight function w. A function ψ from the set C of directed cycles in G to R₊ is a fractional dicycle packing of G if ∑_e∈C∈Cψ(C)?w(e) for each e∈E(G). The fractional dicycle packing number, denoted , is the maximum value of ∑_C∈Cψ(C) taken over all fractional dicycle packings ψ. In case w≡1 we denote the latter parameter by .Our main result is that where n=|V(G)|. Our proof is algorithmic and generates a set of arc-disjoint directed cycles whose size is at least ν_c(G)-o(n²) in randomized polynomial time. Since computing ν_c(G) is an NP-Hard problem, and since almost all digraphs have ν_c(G)=Θ(n²) our result is a FPTAS for computing ν_c(G) for almost all digraphs.The result uses as its main lemma a much more general result. Let F be any fixed family of oriented graphs. For an oriented graph G, let ν_F(G) denote the maximum number of arc-disjoint copies of elements of F that can be found in G, and let denote the fractional relaxation. Then, . This lemma uses the recently discovered directed regularity lemma as its main tool.It is well known that can be computed in polynomial time by considering the dual problem. We present a polynomial algorithm that finds an optimal fractional dicycle packing. Our algorithm consists of a solution to a simple linear program and some minor modifications, and avoids using the ellipsoid method. In fact, the algorithm shows that a maximum fractional dicycle packing with at most O(n²) dicycles receiving nonzero weight can be found in polynomial time.     

Countably compact hyperspaces and Frolík sums

Let H⁰(X) (H(X)) denote the set of all (nonempty) closed subsets of X endowed with the Vietoris topology. A basic problem concerning H(X) is to characterize those X for which H(X) is countably compact. We conjecture that u-compactness of X for some u∈ω^∗ (or equivalently: all powers of X are countably compact) may be such a characterization. We give some results that point into this direction.We define the property R(κ): for every family of closed subsets of X separated by pairwise disjoint open sets and any family of natural numbers, the product is countably compact, and prove that if H(X) is countably compact for a T₂-space X then X satisfies R(κ) for all κ. A space has R(1) iff all its finite powers are countably compact, so this generalizes a theorem of J. Ginsburg: if X is T₂ and H(X) is countably compact, then so is Xn for all n<ω. We also prove that, for κ<t, if the T₃ space X satisfies a weak form of R(κ), the orbit of every point in X is dense, and X contains κ pairwise disjoint open sets, then Xκ is countably compact. This generalizes the following theorem of J. Cao, T. Nogura, and A. Tomita: if X is T₃, homogeneous, and H(X) is countably compact, then so is Xω.Then we study the Frolík sum (also called “one-point countable-compactification”) of a family . We use the Frolík sum to produce countably compact spaces with additional properties (like first countability) whose hyperspaces are not countably compact. We also prove that any product _∏α<κH⁰(Xα) embeds into .