Diameter-girth sufficient conditions for optimal extraconnectivity in graphs

For a connected graph G, the rth extraconnectivity κ_r(G) is defined as the minimum cardinality of a cutset X such that all remaining components after the deletion of the vertices of X have at least r+1 vertices. The standard connectivity and superconnectivity correspond to κ₀(G) and κ₁(G), respectively. The minimum r-tree degree of G, denoted by ξ_r(G), is the minimum cardinality of N(T) taken over all trees T⊆G of order |V(T)|=r+1, N(T) being the set of vertices not in T that are neighbors of some vertex of T. When r=1, any such considered tree is just an edge of G. Then, ξ₁(G) is equal to the so-called minimum edge-degree of G, defined as ξ(G)=min{d(u)+d(v)-2:uv∈E(G)}, where d(u) stands for the degree of vertex u. A graph G is said to be optimally r-extraconnected, for short κ_r-optimal, if κ_r(G)?ξ_r(G). In this paper, we present some sufficient conditions that guarantee κ_r(G)?ξ_r(G) for r?2. These results improve some previous related ones, and can be seen as a complement of some others which were obtained by the authors for r=1.     

A note on k-potence preserving maps

Let M_n be the algebra of all n×n complex matrices and Γ_n the set of all k-potent matrices in M_n. Suppose ?:M_n→M_n is a map satisfying A-λB∈Γ_n implies ?(A)-λ?(B)∈Γ_n, where A, B∈M_n, λ∈C. Then either ? is of the form ?(A)=cTAT^-1, A∈M_n, or ? is of the form ?(A)=cTA^tT^-1, A∈M_n, where T∈M_n is an invertible matrix, c∈C satisfies c^k=c.     

The profile of the Cartesian product of graphs

Given a graph G, a proper labelingf of G is a one-to-one function from V(G) onto {1,2,…,|V(G)|}. For a proper labeling f of G, the profile widthw_f(v) of a vertex v is the minimum value of f(v)−f(x), where x belongs to the closed neighborhood of v. The profile of a proper labelingfofG, denoted by P_f(G), is the sum of all the w_f(v), where v∈V(G). The profile ofG is the minimum value of P_f(G), where f runs over all proper labeling of G. In this paper, we show that if the vertices of a graph G can be ordered to satisfy a special neighborhood property, then so can the graph G×Q_n. This can be used to determine the profile of Q_n and K_m×Q_n.     

Coincidences of projections and linear n-valued maps of tori

We prove that the Nielsen fixed point number N(φ) of an n-valued map φ:X?X of a compact connected triangulated orientable q-manifold without boundary is equal to the Nielsen coincidence number of the projections of the graph of φ, a subset of X×X, to the two factors. For certain q×q integer matrices A, there exist “linear” n-valued maps Φn,A,σ:Tq?Tq of q-tori that generalize the single-valued maps fA:Tq→Tq induced by the linear transformations TA:Rq→Rq defined by TA(v)=Av. By calculating the Nielsen coincidence number of the projections of its graph, we calculate N(Φn,A,σ) for a large class of linear n-valued maps.     

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.     

Higher rank numerical ranges and low rank perturbations of quantum channels

For a positive integer k, the rank-k numerical range Λk(A) of an operator A acting on a Hilbert space H of dimension at least k is the set of scalars λ such that PAP=λP for some rank k orthogonal projection P. In this paper, a close connection between low rank perturbation of an operator A and Λk(A) is established. In particular, for 1?r<k it is shown that Λk(A)⊆Λk−r(A+F) for any operator F with rank(F)?r. In quantum computing, this result implies that a quantum channel with a k-dimensional error correcting code under a perturbation of rank at most r will still have a (k−r)-dimensional error correcting code. Moreover, it is shown that if A is normal or if the dimension of A is finite, then Λk(A) can be obtained as the intersection of Λk−r(A+F) for a collection of rank r operators F. Examples are given to show that the result fails if A is a general operator. The closure and the interior of the convex set Λk(A) are completely determined. Analogous results are obtained for Λ_∞(A) defined as the set of scalars λ such that PAP=λP for an infinite rank orthogonal projection P. It is shown that Λ_∞(A) is the intersection of all Λk(A) for k=1,2,…. If A−μI is not compact for all μ∈C, then the closure and the interior of Λ_∞(A) coincide with those of the essential numerical range of A. The situation for the special case when A−μI is compact for some μ∈C is also studied.     

Asymptotic properties of plug-in level set estimators for right censored data

We assume T1,...,Tn are i.i.d.data sampled from distribution function F with density function f and C1,...,Cn are i.i.d.data sampled from distribution function G.Observed data consists of pairs(Xi,δi),i=1,...,n,where Xi=min{Ti,Ci},δi=I(Ti Ci),I(A)denotes the indicator function of the set A.Based on the right censored data{Xi,δi},i=1,...,n,we consider the problem of estimating the level set{f c}of an unknown one-dimensional density function f and study the asymptotic behavior of the plug-in level set estimators.Under some regularity conditions,we establish the asymptotic normality and the exact convergence rate of theλg-measure of the symmetric difference between the level set{f c}and its plug-in estimator{fn c},where f is the density function of F,and fn is a kernel-type density estimator of f.Simulation studies demonstrate that the proposed method is feasible.Illustration with a real data example is also provided.     

The fractional chromatic number, the Hall ratio, and the lexicographic product

Let χ_f denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographic product of G and H be denoted GlexH. Main results: (i) ρ(GlexH)≤χ_f(G)ρ(H); (ii) if ρ(G)=χ_f(G) then ρ(GlexH)=ρ(G)ρ(H) for all H; (iii) χ_f−ρ is unbounded. In addition, the question of how big χ_f/ρ can be is discussed.     

Formality theorem for Lie bialgebras and quantization of twists and coboundary r-matrices

Let (g,δ?) be a Lie bialgebra. Let (U?(g),Δ?) a quantization of (g,δ?) through Etingof-Kazhdan functor. We prove the existence of a L_∞-morphism between the Lie algebra C(g)=Λ(g) and the tensor algebra (without unit) T₊U=T₊(U?(g)[−1]) with Lie algebra structure given by the Gerstenhaber bracket. When s is a twist for (g,δ), we deduce from the formality morphism the existence of a quantum twist F. When (g,δ,r) is a coboundary Lie bialgebra, we get the existence of a quantization R of r.     

Covering shadows with a smaller volume

For n?2 a construction is given for convex bodies K and L in Rn such that the orthogonal projection Lu onto the subspace u^⊥ contains a translate of Ku for every direction u, while the volumes of K and L satisfy Vn(K)>Vn(L).A more general construction is then given for n-dimensional convex bodies K and L such that each orthogonal projection Lξ onto a k-dimensional subspace ξ contains a translate of Kξ, while the mth intrinsic volumes of K and L satisfy Vm(K)>Vm(L) for all m>k.For each k=1,…,n, we then define the collection Cn,k to be the closure (under the Hausdorff topology) of all Blaschke combinations of suitably defined cylinder sets (prisms).It is subsequently shown that, if L∈Cn,k, and if the orthogonal projection Lξ contains a translate of Kξ for every k-dimensional subspace ξ of Rn, then Vn(K)?Vn(L).The families Cn,k, called k-cylinder bodies of Rn, form a strictly increasing chain

Cn,1⊂Cn,2⊂?⊂Cn,n−1⊂Cn,n,     

Eigenvalue problems for second-order nonlinear dynamic equations on time scales

This paper is concerned with the existence and nonexistence of positive solutions of the second-order nonlinear dynamic equation uΔΔ(t)+λa(t)f(u(σ(t)))=0, t∈[0,1], satisfying either the conjugate boundary conditions u(0)=u(σ(1))=0 or the right focal boundary conditions u(0)=uΔ(σ(1))=0, where a and f are positive. We show that there exists a λ^∗>0 such that the above boundary value problem has at least two, one and no positive solutions for 0<λ<λ^∗, λ=λ^∗ and λ>λ^∗, respectively. Furthermore, by using the semiorder method on cones of the Banach space, we establish an existence and uniqueness criterion for positive solution of the problem. In particular, such a positive solution uλ(t) of the problem depends continuously on the parameter λ, i.e., uλ(t) is nondecreasing in λ, limλ→⁰⁺‖uλ‖=0 and limλ→+∞‖uλ‖=+∞.     

Bipartite rainbow numbers of matchings

Given two graphs G and H, let f(G,H) denote the maximum number c for which there is a way to color the edges of G with c colors such that every subgraph H of G has at least two edges of the same color. Equivalently, any edge-coloring of G with at least rb(G,H)=f(G,H)+1 colors contains a rainbow copy of H, where a rainbow subgraph of an edge-colored graph is such that no two edges of it have the same color. The number rb(G,H) is called the rainbow number ofHwith respect toG, and simply called the bipartite rainbow number ofH if G is the complete bipartite graph K_m,n. Erd?s, Simonovits and Sós showed that rb(K_n,K₃)=n. In 2004, Schiermeyer determined the rainbow numbers rb(K_n,K_k) for all n≥k≥4, and the rainbow numbers rb(K_n,kK₂) for all k≥2 and n≥3k+3. In this paper we will determine the rainbow numbers rb(K_m,n,kK₂) for all k≥1.     

Type-B generalized triangulations and determinantal ideals

For n≥3, let Ω_n be the set of line segments between the vertices of a convex n-gon. For j≥2, a j-crossing is a set of j line segments pairwise intersecting in the relative interior of the n-gon. For k≥1, let Δ_n,k be the simplicial complex of (type-A) generalized triangulations, i.e. the simplicial complex of subsets of Ω_n not containing any (k+1)-crossing.The complex Δ_n,k has been the central object of many papers. Here we continue this work by considering the complex of type-B generalized triangulations. For this we identify line segments in Ω_2n which can be transformed into each other by a 180^°-rotation of the 2n-gon. Let F_n be the set Ω_2n after identification, then the complex D_n,k of type-B generalized triangulations is the simplicial complex of subsets of F_n not containing any (k+1)-crossing in the above sense. For k=1, we have that D_n,1 is the simplicial complex of type-B triangulations of the 2n-gon as defined in [R. Simion, A type-B associahedron, Adv. Appl. Math. 30 (2003) 2-25] and decomposes into a join of an (n−1)-simplex and the boundary of the n-dimensional cyclohedron. We demonstrate that D_n,k is a pure, k(n−k)−1+kn dimensional complex that decomposes into a kn−1-simplex and a k(n−k)−1 dimensional homology-sphere. For k=n−2 we show that this homology-sphere is in fact the boundary of a cyclic polytope. We provide a lower and an upper bound for the number of maximal faces of D_n,k.On the algebraical side we give a term order on the monomials in the variables X_ij,1≤i,j≤n, such that the corresponding initial ideal of the determinantal ideal generated by the (k+1) times (k+1) minors of the generic n×n matrix contains the Stanley-Reisner ideal of D_n,k. We show that the minors form a Gröbner-Basis whenever k∈{1,n−2,n−1} thereby proving the equality of both ideals and the unimodality of the h-vector of the determinantal ideal in these cases. We conjecture this result to be true for all values of k<n.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Bitableau bases for Garsia-Haiman modules of hollow type

Garsia-Haiman modules C[Xn,Yn]/Iγ are quotient rings in the variables Xn={x₁,x₂,…,xn} and Yn={y₁,y₂,…,yn} that generalize the quotient ring C[Xn]/I, where I is the ideal generated by the elementary symmetric polynomials ej(Xn) for 1?j?n. A bitableau basis for the Garsia-Haiman modules of hollow type is constructed. Applications of this basis to representation theory and other related polynomial spaces are considered.     

On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v_i and v_j in V(G) of G, recall that G+v_iv_j is the supergraph formed from G by adding an edge between vertices v_i and v_j. Denote the Harary index of G and G+v_iv_j by H(G) and H(G+v_iv_j), respectively. We obtain lower and upper bounds on H(G+v_iv_j)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.     

Bipartite graphs are not universal fixers

For any permutation π of the vertex set of a graph G, the graph πG is obtained from two copies G^′ and G^″ of G by joining u∈V(G^′) and v∈V(G^″) if and only if v=π(u). Denote the domination number of G by γ(G). For all permutations π of V(G), γ(G)≤γ(πG)≤2γ(G). If γ(πG)=γ(G) for all π, then G is called a universal fixer. We prove that graphs without 5-cycles are not universal fixers, from which it follows that bipartite graphs are not universal fixers.     

Sums of commutators in non-commutative Banach function spaces

Let M be a II_∞-factor and denote by τ its normal faithful semi-finite trace. For any rearrangement invariant Köthe function space X on [0,+∞[, let X(M,τ) be the associated non-commutative Banach function space. This paper is concerned with ideals in M of the form I_X(M,τ)=M∩X(M,τ) that are contained in L^p(M,τ) for some p>0. It is proved that an element T in I_X(M,τ) is a finite sum of commutators of the form [A,B] with A∈I_X(M,τ) and B∈M if and only if the function belongs to X, where ν_T is the Brown spectral measure of T and t→λ_t(T) is the non-increasing rearrangement of the function λ→|λ| with respect to ν_T. This extends to general Banach function spaces a result obtained by Kalton for quasi-Banach ideals of compact operators and implies that the Dixmier's trace of a quasi-nilpotent element in L^1,∞(M,τ) is always zero.     

On classical adjoint-commuting mappings between matrix algebras

Let F be a field and let m and n be integers with m,n?3. Let M_n denote the algebra of n×n matrices over F. In this note, we characterize mappings ψ:M_n→M_m that satisfy one of the following conditions:

1.

|F|=2 or |F|>n+1, and ψ(adj(A+αB))=adj(ψ(A)+αψ(B)) for all A,B∈M_n and α∈F with ψ(I_n)≠0.

2.

ψ is surjective and ψ(adj(A-B))=adj(ψ(A)-ψ(B)) for every A,B∈M_n.

Here, adjA denotes the classical adjoint of the matrix A, and I_n is the identity matrix of order n. We give examples showing the indispensability of the assumption ψ(I_n)≠0 in our results.