Decomposition of balanced complete bipartite multigraphs into multistars

In this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete bipartite multigraph λK_n,n into (not necessarily isomorphic) multistars with the same number of edges. We also give a necessary and sufficient condition of decomposing 2K_n,n into isomorphic multistars.     

A transference method in quantum probability

Working with a rather general notion of independence, we provide a transference method which allows to compare the p-norm of sums of independent copies with the p-norm of sums of free copies. Our main technique is to construct explicit operator space Lp embeddings preserving independence to reduce the problem to L₁, where some recent results by the first-named author can be used. We find applications on noncommutative Khintchine/Rosenthal type inequalities and on noncommutative Lp embedding theory.     

Covering graphs with matchings of fixed size

Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting to consider minimum[m]-coverings, i.e. [m]-coverings containing as few matchings as possible. Such [m]-coverings will be called excessive[m]-factorizations. The number of matchings in an excessive [m]-factorization is a graph parameter which will be called the excessive[m]-index and denoted by . In this paper we begin the study of this new parameter as well as of a number of other related graph parameters.     

Degree-bounded factorizations of bipartite multigraphs and of pseudographs

For d≥1, s≥0 a (d,d+s)-graph is a graph whose degrees all lie in the interval {d,d+1,…,d+s}. For r≥1, a≥0 an (r,r+a)-factor of a graph G is a spanning (r,r+a)-subgraph of G. An (r,r+a)-factorization of a graph G is a decomposition of G into edge-disjoint (r,r+a)-factors. A graph is (r,r+a)-factorable if it has an (r,r+a)-factorization.We prove a number of results about (r,r+a)-factorizations of (d,d+s)-bipartite multigraphs and of (d,d+s)-pseudographs (multigraphs with loops permitted). For example, for t≥1 let β(r,s,a,t) be the least integer such that, if d≥β(r,s,a,t) then every (d,d+s)-bipartite multigraph G is (r,r+a)-factorable with x(r,r+a)-factors for at least t different values of x. Then we show that

     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .     

Asymptotic behavior of solutions to a hyperbolic-elliptic coupled system in multi-dimensional radiating gas

This paper is concerned with the asymptotic behavior of solutions to the Cauchy problem of a hyperbolic-elliptic coupled system in the multi-dimensional radiating gas

     

Linear maps preserving the minimum and reduced minimum moduli

We describe linear maps from a C^∗-algebra onto another one preserving different spectral quantities such as the minimum modulus, the surjectivity modulus, and the reduced minimum modulus.     

On semi-R-boundedness and its applications

R-Boundedness is a randomized boundedness condition for sets of operators which in recent years has found many applications in the maximal regularity theory of evolution equations, stochastic evolution equations, spectral theory and vector-valued harmonic analysis. However, in some situations additional geometric properties such as Pisier's property (α) are required to guaranty the R-boundedness of a relevant set of operators. In this paper we show that a weaker property called semi-R-boundedness can be used to avoid these geometric assumptions in the context of Schauder decompositions and the H^∞-calculus. Furthermore, we give weaker conditions for stochastic integrability of certain convolutions.     

Infinitely many homoclinic orbits for the second order Hamiltonian systems with general potentials

In this paper we study the following nonperiodic second order Hamiltonian systems

     

The role of directional compactness in the existence and computation of contingent epiderivatives

This paper underlines the role of directional compactness in the scalarization of graphical derivatives of set-valued maps taking values in infinite-dimensional spaces. Two main theorems are given. The first one states the equivalence of contingent epiderivatives and τw-contingent epiderivatives for directionally compact maps. The second main result proves a variational characterization for the contingent epiderivative of stable and directionally compact maps taking values in general image spaces, extending known results in finite-dimensional and reflexive Banach spaces. The hypotheses given are minimal as is shown by means of several examples. Connections of these theorems with other results of the literature are also provided.