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.     

Polyhedral studies on the convex recoloring problem

A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We show an integer programming formulation for the weighted version of this problem on arbitrary graphs, and then specialize it for trees. We study the facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation, present several classes of facet-defining inequalities and discuss separation algorithms.     

On convex hulls of compact sets of probability measures with countable supports

E. Michael and I. Namioka proved the following theorem. Let Y be a convex G _δ -subset of a Banach space E such that if K ? Y is a compact space, then its closed (in Y) convex hull is also compact. Then every lower semicontinuous set-valued mapping of a paracompact space X to Y with closed (in Y) convex values has a continuous selection. E. Michael asked the question: Is the assumption that Y is G _δ essential? In this note we give an affirmative answer to this question of Michael.     

Some inverse problems involving conditional expectations

Let (Ω, F, P) be a probability space, let H be a sub-σ-algebra of F, and let Y be positive and H-measurable with E[Y] = 1. We discuss the structure of the convex set CE(Y; H) = {X ∈ pF: Y = E[X|H]} of random variables whose conditional expectation given H is the prescribed Y. Several characterizations of extreme points of CE(Y; H) are obtained. A necessary and sufficient condition is given in order that CE(Y; H) be the closed, convex hull of its extreme points. For the case of finite F we explicitly calculate the extreme points of CE(Y; H), identify pairs of adjacent extreme points, and characterize extreme points of CE(Y; H) ? CE(Z; G), where G is a second sub-σ-algebra of F and Z ∈ pG. When H = σ(Y) and appropriate topological hypotheses hold, extreme points of CE(Y; H) are shown to be in explicit one-to-one correspondence with certain left inverses of Y. Finally, it is shown how the same approach can be applied to the problem of extremal random measures on $\text{R}$₊ with a prescribed compensator, to deduce that the number of extreme points is zero or one.     

Automatic continuity and representation of group homomorphisms defined between groups of continuous functions

Let C(X,G) be the group of continuous functions from a topological space X into a topological group G with pointwise multiplication as the composition law, endowed with the uniform convergence topology. To what extent does the group structure of C(X,G) determine the topology of X? More generally, when does the existence of a group homomorphism H between the groups C(X,G) and C(Y,G) implies that there is a continuous map h of Y into X such that H is canonically represented by h? We prove that, for any topological group G and compact spaces X and Y, every non-vanishing C-isomorphism (defined below) H of C(X,G) into C(Y,G) is automatically continuous and can be canonically represented by a continuous map h of Y into X. Some applications to specific groups and examples are given in the paper.     

The Bishop-Phelps-Bollobás Theorem for operators from c 0 to uniformly convex spaces

We show that the pair of Banach spaces (c ₀, Y) has the Bishop-Phelps-Bollobás property when Y is uniformly convex. Further, when Y is strictly convex, if (c ₀, Y) has the Bishop-Phelps-Bollobás property then Y is uniformly convex for the case of real Banach spaces. As a corollary, we show that the Bishop-Phelps-Bollobás theorem holds for bilinear forms on c ₀ × ? _p (1 < p < ∞).     

A note on the weakly convex and convex domination numbers of a torus

The distanced_G(u,v) between two vertices u and v in a connected graph G is the length of the shortest (u,v) path in G. A (u,v) path of length d_G(u,v) is called a (u,v)-geodesic. A set X⊆V is called weakly convex in G if for every two vertices a,b∈X, exists an (a,b)-geodesic, all of whose vertices belong to X. A set X is convex in G if for all a,b∈X all vertices from every (a,b)-geodesic belong to X. The weakly convex domination number of a graph G is the minimum cardinality of a weakly convex dominating set of G, while the convex domination number of a graph G is the minimum cardinality of a convex dominating set of G. In this paper we consider weakly convex and convex domination numbers of tori.     

Variations on a Theme of Cline and Donkin

Let N be a normal subgroup of a group G. An N-module Q is called G-stable provided that Q is equivalent to the twist Q ^g of Q by g, for every g?∈?G. If the action of N on Q extends to an action of G on Q, then Q is obviously G-stable, but the converse need not hold. A famous conjecture in the modular representation theory of reductive algebraic groups G asserts that the (obviously G-stable) projective indecomposable modules (PIMs) Q for the Frobenius kernels G _r (r?≥?1) of G have a G-module structure. It is sometimes just as useful (for a general module Q) to know that a finite direct sum Q ^?⊕?n of Q has a compatible G-module structure. In this paper, this property is called numerical stability. In recent work (Parshall and Scott, Adv Math 226:2065–2088, 2011), the authors established numerical stability in the special case of PIMs. We provide in this paper a more general context for that result, working in the context of k-group schemes and a suitable version of G-stability, called strong G-stability. Among our results here is the determination of necessary and sufficient conditions for the existence of a compatible G-module structure on a strongly G-stable N-module, in the form of a cohomological obstruction which must be trivial precisely when the G-module structure exists. Our main result is achieved by giving an approach to killing the obstruction by tensoring with certain finite dimensional G/N-modules.     

Convexity properties of gradient maps

We consider the action of a real reductive group G on a Kähler manifold Z which is the restriction of a holomorphic action of a complex reductive group H. We assume that the action of a maximal compact subgroup U of H is Hamiltonian and that G is compatible with a Cartan decomposition of H. We have an associated gradient map μp:Z→p where g=k⊕p is the Cartan decomposition of g. For a G-stable subset Y of Z we consider convexity properties of the intersection of μp(Y) with a closed Weyl chamber in a maximal abelian subspace a of p. Our main result is a Convexity Theorem for real semi-algebraic subsets Y of Z=P(V) where V is a unitary representation of U.     

Michael's problem and weakly infinite-dimensional spaces

Let X be a compact Hausdorff space. Suppose that any multivalued map , where Y is a Gδ subset of a Banach space, such that the values of F are convex and closed in Y, has a continuous single-valued selection. Then we prove that X is weakly infinite-dimensional. This provides a partial solution of Gδ-problem, posed by Ernest Michael.     

On a conjecture of E. Rapaport Strasser about knot-like groups and its pro-p version

A group G is knot-like if it is finitely presented of deficiency 1 and has abelianization G/G^′?Z. We prove the conjecture of E. Rapaport Strasser that if a knot-like group G has a finitely generated commutator subgroup G^′ then G^′ should be free in the special case when the commutator G^′ is residually finite. It is a corollary of a much more general result : if G is a discrete group of geometric dimension n with a finite K(G,1)-complex Y of dimension n, Y has Euler characteristics 0, N is a normal residually finite subgroup of G, N is of homological type FP_n-1 and G/N?Z then N is of homological type FP_n and hence G/N has finite virtual cohomological dimension vcd(G/N)=cd(G)-cd(N). In particular either N has finite index in G or cd(N)?cd(G)-1.Furthermore we show a pro-p version of the above result with the weaker assumption that G/N is a pro-p group of finite rank. Consequently a pro-p version of Rapaport's conjecture holds.     

On the computation of the hull number of a graph

Let G be a graph. If u,v∈V(G), a u-vshortest path of G is a path linking u and v with minimum number of edges. The closed interval I[u,v] consists of all vertices lying in some u-v shortest path of G. For S⊆V(G), the set I[S] is the union of all sets I[u,v] for u,v∈S. We say that S is a convex set if I[S]=S. The convex hull of S, denoted I_h[S], is the smallest convex set containing S. A set S is a hull set of G if I_h[S]=V(G). The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). In this work we prove that deciding whether hn(G)≤k is NP-complete.We also present polynomial-time algorithms for computing hn(G) when G is a unit interval graph, a cograph or a split graph.     

Long Paths Through Specified Vertices In 3-Connected Graphs

Let h ≥ 6 be an integer, let G be a 3-connected graph with ∣V(G)∣ ≥ h − 1, and let x and z be distinct vertices of G. We show that if for any nonadjacent distinct vertices u and v in V(G) − {x, z}, the sum of the degrees of u and v in G is greater than or equal to h, then for any subset Y of V(G) − {x, z} with ∣Y∣ ≤ 2, G contains a path which has x and z as its endvertices, passes through all vertices in Y, and has length at least h − 2. We also show a similar result for cycles in 2-connected graphs.     

G-narrow operators and G-rich subspaces

Let X and Y be Banach spaces. An operator G: X → Y is a Daugavet center if ‖G +T‖ = ‖G‖+‖T‖ for every rank-1 operator T. For every Daugavet center G we consider a certain set of operators acting from X, so-called G-narrow operators. We prove that if J is the natural embedding of Y into a Banach space E, then E can be equivalently renormed so that an operator T is (J ○ G)-narrow if and only if T is G-narrow. We study G-rich subspaces of X: Z ? X is called G-rich if the quotient map q: X → X/Z is G-narrow.     

Structural properties and edge choosability of planar graphs without 4-cycles

Some structural properties of planar graphs without 4-cycles are investigated. By the structural properties, it is proved that every planar graph G without 4-cycles is edge-(Δ(G)+1)-choosable, which perfects the result given by Zhang and Wu: If G is a planar graph without 4-cycles, then G is edge-t-choosable, where t=7 if Δ(G)=5, and otherwise t=Δ(G)+1.     

On a Heilbronn-type problem

Let F be a convex figure with area |F| and let G(n,F) denote the smallest number such that from any n points of F we can get G(n,F) triangles with areas less than or equal to |F|/4. In this article, to generalize some results of Soifer, we will prove that for any triangle T, G(5,T)=3; for any parallelogram P, G(5,P)=2; for any convex figure F, if S(F)=6, then G(6,F)=4.     

Weak acyclic coloring and asymmetric coloring games

We introduce the notion of weak acyclic coloring of a graph. This is a relaxation of the usual notion of acyclic coloring which is often sufficient for applications. We then use this concept to analyze the (a,b)-coloring game. This game is played on a finite graph G, using a set of colors X, by two players Alice and Bob with Alice playing first. On each turn Alice (Bob) chooses a (b) uncolored vertices and properly colors them with colors from X. Alice wins if the players eventually create a proper coloring of G; otherwise Bob wins when one of the players has no legal move. The (a,b)-game chromatic number of G, denoted (a,b)-χ_g(G), is the least integer t such that Alice has a winning strategy when the game is played on G using t colors. We show that if the weak acyclic chromatic number of G is at most k then (2,1)-.     

Some results related to the toughness of 3-domination critical graphs

A graph G is said to be k-γ-critical if the size of any minimum dominating set of vertices is k, but if any edge is added to G the resulting graph can be dominated with k−1 vertices. The structure of k-γ-critical graphs remains far from completely understood, even in the special case when the domination number γ=3. In a 1983 paper, Sumner and Blitch proved a theorem which may regarded as a result related to the toughness of 3-γ-critical graphs which says that if S is any vertex cutset of such a graph, then G−S has at most |S|+1 components. In the present paper, we improve and extend this result considerably.     

A note on internally disjoint alternating paths in bipartite graphs

Let G be a balanced bipartite graph with partite sets X and Y, which has a perfect matching, and let x∈X and y∈Y. Let k be a positive integer. Then we prove that if G has k internally disjoint alternating paths between x and y with respect to some perfect matching, then G has k internally disjoint alternating paths between x and y with respect to every perfect matching.     

Compact group actions on equivariant absolute neighborhood retracts and their orbit spaces

We apply equivariant joins to give a new and more transparent proof of the following result: if G is a compact Hausdorff group and X a G-ANR (respectively, a G-AR), then for every closed normal subgroup H of G, the H-orbit space X/H is a G/H-ANR (respectively, a G/H-AR). In particular, X/G is an ANR (respectively, an AR).