Packing of Steiner trees and S-connectors in graphs

Nash-Williams and Tutte independently characterized when a graph has k edge-disjoint spanning trees; a consequence is that 2k-edge-connected graphs have k edge-disjoint spanning trees. Kriesell conjectured a more general statement: defining a set S⊆V(G) to be j-edge-connected in G if S lies in a single component of any graph obtained by deleting fewer than j edges from G, he conjectured that if S is 2k-edge-connected in G, then G has k edge-disjoint trees containing S. Lap Chi Lau proved that the conclusion holds whenever S is 24k-edge-connected in G.We improve Lau?s result by showing that it suffices for S to be 6.5k-edge-connected in G. This and an analogous result for packing stronger objects called “S-connectors” follow from a common generalization of the Tree Packing Theorem and Hakimi?s criterion for orientations with specified outdegrees. We prove the general theorem using submodular functions and the Matroid Union Theorem.     

On the T-ramified, S-split p-class field towers over an extension of degree prime to p

Let K be a number field, p a prime, and let be the T-ramified, S-split p-class field tower of K, i.e., the maximal pro-p-extension of K unramified outside T and totally split on S, where T and S are disjoint finite sets of places of K. Using a theorem of Tate on nilpotent quotient groups, we give (Theorem 2 in Section 3) an elementary characterisation of the finite extensions L/K, with a normal closure of degree prime to p, such that the analogous p-class field tower of L is equal to the compositum . This N.S.C. only depends on classes and units of L. Some applications and examples are given.     

Scattering of S0 Lamb mode in plate with multiple damage

A study of scattering properties of S₀ mode Lamb wave in an infinite plate with multiple damage is presented. Plate theory and wave function expansion method are used to derive the analytical solutions for the scattering wave field in plate with a single damage, and by using the addition theorems of Bessel functions, interference phenomena between scattering wave fields from different damage is investigated. Measurements agree well between theoretical results and FE simulation study of plate with two damage and validity of the model is confirmed. Numerical results of scattering displacement field in plate with two and three damage are graphically presented and discussed. An assessment of effects of damage geometric properties on the scattering properties is made.     

Explicit characterizations of orthogonality in lS(C)

In a previous paper, the author used a notion of orthogonality introduced in another article to establish characterizations for orthogonality in the spaces l_S^p(C), 1?p<∞, thus obtaining generalizations of the usual characterization of orthogonality in the Hilbert spaces l_S²(C), via inner products. In this paper we make explicit these characterizations for some of the spaces l_S^p(C). We finish by presenting some remarks and open problems.     

On Taylor and other joint spectra for commuting n-tuples of operators

Let R and S be commuting n-tuples of operators. We will give some spectral relations between RS and SR that extend the case of single operators. We connect the Taylor spectrum, the Fredholm spectrum and some other joint spectra of RS and SR. Applications to Aluthge transforms of commuting n-tuples are also provided.     

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.     

Q-curvature flow on the standard sphere of even dimension

Using a gradient flow approach initiated by S. Brendle, we generalize the existence theorem for the prescribing Q-curvature equation on S² (Gauss curvature) by M. Struwe (2005) [14] and on S⁴ by Malchiodi and Struwe (2006) [12] to Sn for all even n with the similar assumption on the prescribed curvature candidate f.     

Exact multiplicity of solutions and S-shaped bifurcation curve for a class of semilinear elliptic equations

The set of steady state solutions to a reaction-diffusion equation modeling an autocatalytic chemical reaction is completely determined, when the reactor has spherical geometry, and the spatial dimension is n=1 or 2 for any reaction order, or n?3 for subcritical reaction order. Bifurcation approach and analysis of linearized problems are used to establish exact multiplicity and precise global bifurcation diagram of positive steady states.     

The S-curvature of homogeneous Randers spaces

In this paper, we give an explicit formula of the S-curvature of homogeneous Randers spaces and prove that a homogeneous Randers space with almost isotropic S-curvature must have vanishing S-curvature. As an application, we obtain a classification of homogeneous Randers space with almost isotropic S-curvature in some special cases. Some examples are also given.     

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.     

On a class of J-self-adjoint operators with empty resolvent set

In the present paper we investigate the set ΣJ of all J-self-adjoint extensions of an operator S which is symmetric in a Hilbert space H with deficiency indices 〈2,2〉 and which commutes with a non-trivial fundamental symmetry J of a Krein space (H,[⋅,⋅]),

SJ=JS.     

Collective fixed points and maximal elements with applications to abstract economies

In this paper, we first establish collective fixed points theorems for a family of multivalued maps with or without assuming that the product of these multivalued maps is Φ-condensing. As an application of our collective fixed points theorem, we derive the coincidence theorem for two families of multivalued maps defined on product spaces. Then we give some existence results for maximal elements for a family of L_S-majorized multivalued maps whose product is Φ-condensing. We also prove some existence results for maximal elements for a family of multivalued maps which are not L_S-majorized but their product is Φ-condensing. As applications of our results, some existence results for equilibria of abstract economies are also derived. The results of this paper are more general than those given in the literature.     

Strong S-domains

S-domains and strong S-rings are studied extensively with special emphasis on integral and polynomial ring extensions. The main theorem of this paper is that for a Prüfer domain R, the polynomial ring R[X₁,…X_n] in finitely many indeterminates is a strong S-domain. We also prove that any Prüfer υ-multiplication domain is an S-domain.     

Global minimum and orthogonality in C1-classes

In this paper we characterize the global minimum of an arbitrary function defined on a Banach space, in terms of a new concept of derivatives adapted for our case from a recent work due to D.J. Keckic (J. Operator Theory, submitted for publication). Using these results we establish several new characterizations of the global minimum of the map defined by F_ψ(X)=‖ψ(X)‖₁, where is a map defined by ψ(X)=S+φ(X) and φ:B(H)→B(H) is a linear map, S∈C₁, and . Further, we apply these results to characterize the operators which are orthogonal to the range of elementary operators.     

Approximation of fixed points of uniformly R-subweakly commuting mappings

We introduce a new class of uniformly R-subweakly commuting mappings and then using this class study the problem of approximation of common fixed points of asymptotically S-nonexpansive mappings in a Banach space with uniformly Gâteaux differentiable norm.     

Some bounds on the p-domination number in trees

Let p be a positive integer and G=(V,E) a graph. A subset S of V is a p-dominating set if every vertex of V-S is dominated at least p times, and S is a p-dependent set of G if the subgraph induced by the vertices of S has maximum degree at most p-1. The minimum cardinality of a p-dominating set a of G is the p-domination number γ_p(G) and the maximum cardinality of a p-dependent set of G is the p-dependence number β_p(G). For every positive integer p?2, we show that for a bipartite graph G, γ_p(G) is bounded above by (|V|+|Y_p|)/2, where Y_p is the set of vertices of G of degree at most p-1, and for every tree T, γ_p(T) is bounded below by β_p-1(T). Moreover, we characterize the trees achieving equality in each bound.     

Generalized G-KKM Theorems in Generalized Convex Spaces and Their Applications

Some new generalized G-KKM and generalized S-KKM theorems are proved under the noncompact setting of generalized convex spaces. As applications, some new minimax inequalities, saddle point theorems, a coincidence theorem, and a fixed point theorem are given in generalized convex spaces. These theorems improve and generalize many important known results in recent literature.     

p-embeddings

This is the sequel to Bhattacharjee et al. (in press) [3] where the notion of a p  -extension of commutative rings was investigated: a unital extension of commutative rings, say R?S$R?S$, is a p  -extension if for every s∈S$s\in S$ there is an r∈R$r\in R$ such that rS=sS$rS=sS$. In this article we apply the theory of p  -extensions to rings of continuous functions. We show that this concept lays between the concepts of C^?$C^{?}$-embeddings and z-embeddings.     

A variational problem with lack of compactness for H(S;S) maps of prescribed degree

We consider, for maps in H^1/2(S¹;S¹), a family of (semi)norms equivalent to the standard one. We ask whether, for such a norm, there is some map in H^1/2(S¹;S¹) of prescribed topological degree equal to 1 and minimal norm. In general, the answer is no, due to concentration phenomena. The existence of a minimal map is sensitive to small perturbations of the norm. We derive a sufficient condition for the existence of minimal maps. In particular, we prove that, for every given norm, there are arbitrarily small perturbations of it for which the minimum is attained. In case there is no minimizer, we determine the asymptotic behavior of minimizing sequences. We prove that, for such minimizing sequences, the energy concentrates near a point of S¹. We describe this concentration in terms of bubbling-off of circles.     

The d-precoloring problem for k-degenerate graphs

In this paper we deal with the d-PRECOLORING EXTENSION (d-PREXT) problem in various classes of graphs. The d-PREXT problem is the special case of PRECOLORING EXTENSION problem where, for a fixed constant d, input instances are restricted to contain at most d precolored vertices for every available color. The goal is to decide if there exists an extension of given precoloring using only available colors or to find it.We present a linear time algorithm for both, the decision and the search version of d-PREXT, in the following cases: (i) restricted to the class of k-degenerate graphs (hence also planar graphs) and with sufficiently large set S of available colors, and (ii) restricted to the class of partial k-trees (without any size restriction on S). We also study the following problem related to d-PREXT: given an instance of the d-PREXT problem which is extendable by colors of S, what is the minimum number of colors of S sufficient to use for precolorless vertices over all such extensions? We establish lower and upper bounds on this value for k-degenerate graphs and its various subclasses (e.g., planar graphs, outerplanar graphs) and prove tight results for the class of trees.