Extending Lipschitz maps into <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>)-spaces

We show that if K is a compact metric space then C(K) is a 2-absolute Lipschitz retract. We then study the best Lipschitz extension constants for maps into C(K) from a given metric space M, extending recent results of Lancien and Randrianantoanina. They showed that a finite-dimensional normed space which is polyhedral has the isometric extension property for C(K)-spaces; here we show that the same result holds for spaces with Gateaux smooth norm or of dimension two; a three-dimensional counterexample is also given. We also show that X is polyhedral if and only if every subset E of X has the universal isometric extension property for C(K)-spaces. We also answer a question of Naor on the extension of Hölder continuous maps.     

Strict <Emphasis Type="Italic">K</Emphasis>-monotonicity and <Emphasis Type="Italic">K</Emphasis>-order continuity in symmetric spaces

This paper is devoted to strict K-monotonicity and K-order continuity in symmetric spaces. Using a local approach to the geometric structure in a symmetric space E we investigate a connection between strict K-monotonicity and global convergence in measure of a sequence of the maximal functions. Next, we solve an essential problem whether an existence of a point of K-order continuity in a symmetric space E on \([0,\infty )\) implies that the embedding \(E\hookrightarrow {L^1}[0,\infty )\) does not hold. We present a complete characterization of an equivalent condition to K-order continuity in a symmetric space E using a notion of order continuity and the fundamental function of E. We also investigate a relationship between strict K-monotonicity and K-order continuity in symmetric spaces and show some examples of Lorentz spaces and Marcinkiewicz spaces having these properties or not. Finally, we discuss a local version of a crucial correspondence between order continuity and the Kadec–Klee property for global convergence in measure in a symmetric space E.     

On the sequential order continuity of the <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>)-space

As shown in [1], for each compact Hausdorff space K without isolated points, there exists a compact Hausdorff P′-space X but not an F-space such that C(K) is isometrically Riesz isomorphic to a Riesz subspace of C(X). The proof is technical and depends heavily on some representation theorems. In this paper we give a simple and direct proof without any assumptions on isolated points. Some generalizations of these results are mentioned.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Separability and Sequential Separability of the Space <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>)

The following results are obtained: (1) a criterion for the separability of the space of continuous functions C(X) with the set-open topology; (2) a criterion for the sequential separability of the space C_p(A|X), where A ? X; (3) an answer to Velichko’s question of whether a set-theoretic condition on a metric space X in a criterion for the sequential separability of C_p(X) is necessary.     

On the Dunford Property (<Emphasis Type="Italic">C</Emphasis>) for Bounded Linear Operators <Emphasis Type="Italic">RS</Emphasis> and <Emphasis Type="Italic">SR</Emphasis>

In this paper we show that if \({S\in L(X,Y)}\) and \({R\in L(Y,X),}\) X and Y complex Banach spaces, then the products RS and SR share the Dunford property (C). We also study property (C) for R, S, RS and \({SR \in L(X)}\) in the case that R and S satisfies the operator equations RSR = R ² and SRS = S ².     

Holomorphic injective extensions of functions in <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">K</Emphasis>) and algebra generators

We present necessary and sufficient conditions on planar compacta K and continuous functions f on K in order that f generate the algebras P(K), R(K), A(K) or C(K). We also unveil quite surprisingly simple examples of non-polynomial convex compacta K ? C and f ∈ P(K) with the property that f ∈ P(K) is a homeomorphism of K onto its image, but for which f ^?1 ? P(f(K)). As a consequence, such functions do not admit injective holomorphic extensions to the interior of the polynomial convex hull \(\widehat K\). On the other hand, it is shown that the restriction f*|_G of the Gelfand-transform f* of an injective function f ∈ P(K) is injective on every regular, bounded complementary component G of K. A necessary and sufficient condition in terms of the behaviour of f on the outer boundary of K is given in order that f admit a holomorphic injective extension to \(\widehat K\). We also include some results on the existence of continuous logarithms on punctured compacta containing the origin in their boundary.     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

Periodic Groups Saturated with the Groups <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

Given an indexing set I and a finite field K_α for each α ∈ I, let ? = {L₂(K_α) | α ∈ I} and \(\mathfrak{N} = \{ SL_2 (K_\alpha )|\alpha \in I\}\). We prove that each periodic group G saturated with groups in \(\Re (\mathfrak{N})\) is isomorphic to L₂(P) (respectively SL₂(P)) for a suitable locally finite field P.     

Isometries with dense windings of the torus in <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">M</Emphasis>)

Let C(M) be the space of all continuous functions on M? ?. We consider the multiplication operator T: C(M) → C(M) defined by Tf(z) = zf(z) and the torus

$$O(M) = \left\{ {f:M \to \mathbb{C} \ntrianglelefteq \left\| f \right\| = \left\| {\frac{1}{f}} \right\| = 1} \right\}$$

. If M is a Kronecker set, then the T-orbits of the points of the torus ½O(M) are dense in ½O(M) and are ½-dense in the unit ball of C(M).

     

Lebesgue weighted <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-algebra on locally compact groups

Let G be a locally compact group, ω a weight function on G, and 1<p<∞. We introduce the Lebesgue weighted L ^p -space \({\mathcal{L}}_{\omega}^{1,p}(G)= L^{p}(G,\omega)\cap L^{1}(G)\) as a Banach space and introduce its dual. Furthermore, we consider this space as a Banach algebra with respect to the usual convolution and show that \({\mathcal{L}}_{\omega}^{1,p}(G)\) admits a bounded approximate identity if and only if G is discrete. In addition, we prove that amenability of this algebra implies that G is discrete and amenable. Moreover, we discuss the converse of this result.     

On the phase transitions of (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)-SAT

Call a sequence of k Boolean variables or their negations a k-tuple. For a set V of n Boolean variables, let T _k (V) denote the set of all 2 ^k n ^k possible k-tuples on V. Randomly generate a set C of k-tuples by including every k-tuple in T _k (V) independently with probability p, and let Q be a given set of q “bad” tuple assignments. An instance I = (C,Q) is called satisfiable if there exists an assignment that does not set any of the k-tuples in C to a bad tuple assignment in Q. Suppose that θ, q > 0 are fixed and ε = ε(n) > 0 be such that εlnn/lnlnn→∞. Let k ≥ (1 + θ) log₂ n and let \({p_0} = \frac{{\ln 2}}{{q{n^{k - 1}}}}\). We prove that

$$\mathop {\lim }\limits_{n \to \infty } P\left[ {I is satisfiable} \right] = \left\{ {\begin{array}{*{20}c} {1,} & {p \leqslant (1 - \varepsilon )p_0 ,} \\ {0,} & {p \geqslant (1 + \varepsilon )p_0 .} \\ \end{array} } \right.$$

     

Exponentially Many Monochromatic <Emphasis Type="Italic">n</Emphasis>-Matchings in <Emphasis Type="Italic">K</Emphasis><Subscript>3<Emphasis Type="Italic">n</Emphasis>-1</Subscript>

Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K _3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K _3n-1 there exists a monochromatic subgraph H of K _3n-1 which contains exponentially many monochromatic n-matchings.     

<Emphasis Type="Italic">C</Emphasis>*-simplicity of <Emphasis Type="Italic">n</Emphasis>-periodic products

The C*-simplicity of n-periodic products is proved for a large class of groups. In particular, the n-periodic products of any finite or cyclic groups (including the free Burnside groups) are C*-simple. Continuum-many nonisomorphic 3-generated nonsimple C*-simple groups are constructed in each of which the identity xⁿ = 1 holds, where n ≥ 1003 is any odd number. The problem of the existence of C*-simple groups without free subgroups of rank 2 was posed by de la Harpe in 2007.     

<Emphasis Type="Italic">M</Emphasis> <Subscript> <Emphasis Type="Italic">p</Emphasis> </Subscript>-supplemented subgroups of finite groups

A subgroup K of G is M_p-supplemented in G if there exists a subgroup B of G such that G = KB and TB < G for every maximal subgroup T of K with |K: T| = p^α. In this paper we prove the following: Let p be a prime divisor of |G| and let H be ap-nilpotent subgroup having a Sylow p-subgroup of G. Suppose that H has a subgroup D with D_p ≠ 1 and |H: D| = p_α. Then G is p-nilpotent if and only if every subgroup T of H with |T| = |D| is M_p-supplemented in G and N_G(T_p)/C_G(T_p) is a p-group.     

<Emphasis Type="Italic">k</Emphasis>-invariant nets over an algebraic extension of a field <Emphasis Type="Italic">k</Emphasis>

Let K be an algebraic extension of a field k, let σ = (σ _ij ) be an irreducible full (elementary) net of order n ≥ 2 (respectively, n ≥ 3) over K, while the additive subgroups σ _ij are k-subspaces of K. We prove that all σij coincide with an intermediate subfield P, k ? P ? K, up to conjugation by a diagonal matrix.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

Recognition by spectrum of simple groups <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(2)

It is proved that, if G is a finite group that has the same set of element orders as the simple group C _p (2) for prime p > 3, then G/O ₂(G) is isomorphic to C _p (2).     

Influence of <Emphasis Type="Italic">M</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-supplemented subgroups on the structure of <Emphasis Type="Italic">p</Emphasis>-modular subgroups

A subgroup K of G is M _p -supplemented in G if there exists a subgroup B of G such that G = KB and TB < G for every maximal subgroup T of K with |K: T| = p ^α. We study the structure of the chief factor of G by using M _p -supplemented subgroups and generalize the results of Monakhov and Shnyparkov by involving the relevant results about the p-modular subgroup O ^p (G) of G.     

On <Emphasis Type="Italic">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.