On p-covalenced association schemes

Let (X,S) denote an association scheme where X is a finite set. For a prime p we say that (X,S) is p-covalenced (p-valenced) if every multiplicity (valency, respectively) of (X,S) is a power of p. In the character theory of finite groups Ito's theorem states that a finite group G has a normal abelian p-complement if and only if every character degree of G is a power of p. In this article we generalize Ito's theorem to p-valenced association schemes, i.e., a p-valenced association scheme (X,S) has a normal p-covalenced p-complement if and only if (X,S) is p-covalenced.     

Orbit spaces and unions of equivariant absolute neighborhood extensors

Let G be a locally compact Hausdorff group. We study orbit spaces and unions of equivariant absolute neighborhood extensors (G-ANEs) in the category of all proper G-spaces that are metrizable by a G-invariant metric. We prove that if a proper G-space X is a G-ANE such that all the G-orbits in X are metrizable, then the G-orbit space X/G is an ANE. Equivariant versions of Hanner's theorem and Kodama's theorem about unions of absolute neighborhood extensors are established. We also introduce the notion of a G-polyhedron and prove that if G is any compact group, then every G-ANR is arbitrary closely dominated by a G-polyhedron. Each G-polyhedron is a G-ANE.     

Generalizing D-graphs

Let ω₀(G) denote the number of odd components of a graph G. The deficiency of G is defined as def(G)=max_X⊆V(G)(ω₀(G-X)-|X|), and this equals the number of vertices unmatched by any maximum matching of G. A subset X⊆V(G) is called a Tutte set (or barrier set) of G if def(G)=ω₀(G-X)-|X|, and an extreme set if def(G-X)=def(G)+|X|. Recently a graph operator, called the D-graph D(G), was defined that has proven very useful in examining Tutte sets and extreme sets of graphs which contain a perfect matching. In this paper we give two natural and related generalizations of the D-graph operator to all simple graphs, both of which have analogues for many of the interesting and useful properties of the original.     

Factors and vertex-deleted subgraphs

A relationship is considered between an f-factor of a graph and that of its vertex-deleted subgraphs. Katerinis [Some results on the existence of 2n-factors in terms of vertex-deleted subgraphs, Ars Combin. 16 (1983) 271-277] proved that for even integer k, if G-x has a k-factor for each x∈V(G), then G has a k-factor. Enomoto and Tokuda [Complete-factors and f-factors, Discrete Math. 220 (2000) 239-242] generalized Katerinis’ result to f-factors, and proved that if G-x has an f-factor for each x∈V(G), then G has an f-factor for an integer-valued function f defined on V(G) with even. In this paper, we consider a similar problem to that of Enomoto and Tokuda, where for several vertices x we do not have to know whether G-x has an f-factor. Let G be a graph, X be a set of vertices, and let f be an integer-valued function defined on V(G) with even, |V(G)-X|?2. We prove that if and if G-x has an f-factor for each x∈V(G)-X, then G has an f-factor. Moreover, if G excludes an isolated vertex, then we can replace the condition with . Furthermore the condition will be when |X|=1.     

Equivariant Kähler compactifications of homogeneous manifolds

A compact complex manifoldX is an equivariant compactification of a homogeneous manifoldG/H (G a connected complex Lie group,H a closed complex subgroup ofG), if there exists a holomorphic action ofG onX such that theG-orbit of some pointx inX is open and H is the isotropy group ofx. GivenG andH, for some groups (e.g.,G nilpotent) there are necessary and sufficient conditions for the existence of an equivariant Kähler compactification which are proven in this paper.     

LK property for σ-ideals

An ideal J of subsets of a Polish space X has (LK) property whenever for every sequence (An) of analytic sets in X, if lim supn∈HAn∉J for each infinite H then _?n∈G∉J for some infinite G. In this note we present a new class of σ-ideals with (LK) property.     

Frobenius splitting and geometry of G-Schubert varieties

Let X be an equivariant embedding of a connected reductive group G over an algebraically closed field k of positive characteristic. Let B denote a Borel subgroup of G. A G-Schubert variety in X is a subvariety of the form diag(G)⋅V, where V is a B×B-orbit closure in X. In the case where X is the wonderful compactification of a group of adjoint type, the G-Schubert varieties are the closures of Lusztig's G-stable pieces. We prove that X admits a Frobenius splitting which is compatible with all G-Schubert varieties. Moreover, when X is smooth, projective and toroidal, then any G-Schubert variety in X admits a stable Frobenius splitting along an ample divisors. Although this indicates that G-Schubert varieties have nice singularities we present an example of a nonnormal G-Schubert variety in the wonderful compactification of a group of type G₂. Finally we also extend the Frobenius splitting results to the more general class of R-Schubert varieties.     

Graphs admitting transitive commutative group actions

Let X be a compact metric space, and Homeo(X) be the group consisting of all homeomorphisms from X to X. A subgroup H of Homeo(X) is said to be transitive if there exists a point x∈X such that {k(x):k∈H} is dense in X. In this paper we show that, if X=G is a connected graph, then the following five conditions are equivalent: (1) Homeo(G) has a transitive commutative subgroup; (2) G admits a transitive Z²-action; (3) G admits an edge-transitive commutative group action; (4) G admits an edge-transitive Z²-action; (5) G is a circle, or a k-fold loop with k?2, or a k-fold polygon with k?2, or a k-fold complete bigraph with k?1. As a corollary of this result, we show that a finite connected simple graph whose automorphism group contains an edge-transitive commutative subgroup is either a cycle or a complete bigraph.     

Edge fault tolerance analysis of super k-restricted connected networks

An edge cut X of a connected graph G is a k-restricted edge cut if G-X is disconnected and every component of G-X has at least k vertices. Additionally, if the deletion of a minimum k-restricted edge cut isolates a connected component of k vertices, then the graph is said to be super-λ_k. In this paper, several sufficient conditions yielding super-λ_k graphs are given in terms of the girth and the diameter.     

Classification of finite groups satisfying a minimal condition

If H is a subgroup of a finite group G then we denote the normal closure of H in G by H ^G . We call G a PE-group if every minimal subgroup X of G satisfies N ^G (X) ∩ X ^G = X. The authors classify the finite non-PE-groups whose maximal subgroups of even order are PE-groups.     

A characterization of maximal non-k-factor-critical graphs

A graph G of order p is k-factor-critical,where p and k are positive integers with the same parity, if the deletion of any set of k vertices results in a graph with a perfect matching. G is called maximal non-k-factor-critical if G is not k-factor-critical but G+e is k-factor-critical for every missing edge e∉E(G). A connected graph G with a perfect matching on 2n vertices is k-extendable, for 1?k?n-1, if for every matching M of size k in G there is a perfect matching in G containing all edges of M. G is called maximal non-k-extendable if G is not k-extendable but G+e is k-extendable for every missing edge e∉E(G) . A connected bipartite graph G with a bipartitioning set (X,Y) such that |X|=|Y|=n is maximal non-k-extendable bipartite if G is not k-extendable but G+xy is k-extendable for any edge xy∉E(G) with x∈X and y∈Y. A complete characterization of maximal non-k-factor-critical graphs, maximal non-k-extendable graphs and maximal non-k-extendable bipartite graphs is given.     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

The group of isometries of a locally compact metric space with one end

In this note we study the dynamics of the natural evaluation action of the group of isometries G of a locally compact metric space (X,d) with one end. Using the notion of pseudo-components introduced by S. Gao and A.S. Kechris we show that X has only finitely many pseudo-components exactly one of which is not compact and G acts properly on this pseudo-component. The complement of the non-compact component is a compact subset of X and G may fail to act properly on it.     

Groups of quasi-invariance and the Pontryagin duality

A Polish group G is called a group of quasi-invariance or a QI-group, if there exist a locally compact group X and a probability measure μ on X such that (1) there exists a continuous monomorphism ? from G into X with dense image, and (2) for each g∈X either g∈?(G) and the shift μg is equivalent to μ or g∉?(G) and μg is orthogonal to μ. It is proved that ?(G) is a σ-compact subset of X. We show that there exists a Polish non-locally quasi-convex (and hence nonreflexive) QI-group such that its bidual is not a QI-group. It is proved also that the bidual group of a QI-group may be not a saturated subgroup of X. It is constructed a reflexive non-discrete group topology on the integers.     

H-domination in graphs

Let H be some fixed graph of order p. For a given graph G and vertex set S⊆V(G), we say that S is H-decomposable if S can be partitioned as S=S₁∪S₂∪?∪S_j where, for each of the disjoint subsets S_i, with 1?i?j, we have |S_i|=p and H is a spanning subgraph of 〈S_i〉, the subgraph induced by S_i. We define the H-domination number of G, denoted as γ_H(G), to be the minimum cardinality of an H-decomposable dominating set S. If no such dominating set exists, we write γ_H(G)=∞. We show that the associated H-domination decision problem is NP-complete for every choice of H. Bounds are shown for γ_H(G). We show, in particular, that if δ(G)?2, then γ_P3(G)?3γ(G). Also, if γ_P3(G)=3γ(G), then every γ(G)-set is an efficient dominating set.     

Actions of totally disconnected groups and equivariant singular homology

We study equivariant singular homology in the case of actions of totally disconnected locally compact groups on topological spaces. Theorem A says that if G is a totally disconnected locally compact group and X is a G-space, then any short exact sequence of covariant coefficient systems for G induces a long exact sequence of corresponding equivariant singular homology groups of the G-space X. In particular we consider the case where G is a totally disconnected compact group, i.e., a profinite group, and G acts freely on X. Of special interest is the case where G is a p-adic group, p a prime. The conjecture that no p-adic group, p a prime, can act effectively on a connected topological manifold, is namely known to be equivalent to the famous Hilbert-Smith conjecture. The Hilbert-Smith conjecture is the statement that, if a locally compact group G acts effectively on a connected topological manifold M, then G is a Lie group.     

Little Grothendieck's theorem for sublinear operators

Let SB(X,Y) be the set of the bounded sublinear operators from a Banach space X into a Banach lattice Y. Consider π₂(X,Y) the set of 2-summing sublinear operators. We study in this paper a variation of Grothendieck's theorem in the sublinear operators case. We prove under some conditions that every operator in SB(C(K),H) is in π₂(C(K),H) for any compact K and any Hilbert H. In the noncommutative case the problem is still open.     

Bandwidth theorem for random graphs

A graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by 1,2,…,n, so that |i−j|?b whenever {i,j} is an edge of G. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive r, Δ, γ, there exists β such that if H is an n-vertex r-chromatic graph with maximum degree at most Δ which has bandwidth at most βn, then any graph G on n vertices with minimum degree at least (1−1/r+γ)n contains a copy of H for large enough n. In this paper, we extend this theorem to dense random graphs. For bipartite H, this answers an open question of Böttcher, Kohayakawa, and Taraz. It appears that for non-bipartite H the direct extension is not possible, and one needs in addition that some vertices of H have independent neighborhoods. We also obtain an asymptotically tight bound for the maximum number of vertex disjoint copies of a fixed r-chromatic graph H₀ which one can find in a spanning subgraph of G(n,p) with minimum degree (1−1/r+γ)np.     

K-duality for pseudomanifolds with isolated singularities

We associate to a pseudomanifold X with a conical singularity a differentiable groupoid G which plays the role of the tangent space of X. We construct a Dirac element and a dual Dirac element which induce a K-duality between the C∗-algebras C∗(G) and C(X). This is a first step toward an index theory for pseudomanifolds.