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.     

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.     

On the vanishing of Selmer groups for elliptic curves over ring class fields

Let E/Q be an elliptic curve of conductor N without complex multiplication and let K be an imaginary quadratic field of discriminant D prime to N. Assume that the number of primes dividing N and inert in K is odd, and let Hc be the ring class field of K of conductor c prime to ND with Galois group Gc over K. Fix a complex character χ of Gc. Our main result is that if LK(E,χ,1)≠0 then Selp(E/Hc)χ_⊗W=0 for all but finitely many primes p, where Selp(E/Hc) is the p-Selmer group of E over Hc and W is a suitable finite extension of Zp containing the values of χ. Our work extends results of Bertolini and Darmon to almost all non-ordinary primes p and also offers alternative proofs of a χ-twisted version of the Birch and Swinnerton-Dyer conjecture for E over Hc (Bertolini and Darmon) and of the vanishing of Selp(E/K) for almost all p (Kolyvagin) in the case of analytic rank zero.     

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.     

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.     

Lower bounds on covering codes via partition matrices

Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let σq(n,s;r) denote the minimal cardinality of a q-ary code of length n, which is s-surjective with radius r. In order to lower-bound Kq(n,n−2) and σq(n,s;s−2) we introduce partition matrices and their transversals. Our approach leads to a short new proof of a classical bound of Rodemich on Kq(n,n−2) and to the new bound Kq(n,n−2)?3q−2n+2, improving the first iff 5?n<q?2n−4. We determine Kq(q,q−2)=q−2+σ₂(q,2;0) if q?10. Moreover, we obtain the new powerful recursive bound Kq+1(n+1,R+1)?min{2(q+1),Kq(n,R)+1}.     

Automatic continuity of biseparating homomorphisms defined between groups of continuous functions

Let C(X,T) be the group of continuous functions of a compact Hausdorff space X to the unit circle of the complex plane T with the pointwise multiplication as the composition law. We investigate how the structure of C(X,T) determines the topology of X. In particular, which group isomorphisms H between the groups C(X,T) and C(Y,T) imply the existence of a continuous map h of Y into X such that H is canonically represented by h. Among other results, it is proved that C(X,T) determines X module a biseparating group isomorphism and, when X is first countable, the automatic continuity and representation as Banach-Stone maps for biseparating group isomorphisms is also obtained.     

Total edge irregularity strength of complete graphs and complete bipartite graphs

A total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges of G with labels from the set {1,…,k} in such a way that for any two different edges e and f their weights φ(f) and φ(e) are distinct. Here, the weight of an edge g=uv is φ(g)=ν(g)+ν(u)+ν(v), i. e. the sum of the label of g and the labels of vertices u and v. The minimum k for which the graph G has an edge irregular total k-labelling is called the total edge irregularity strength of G.We have determined the exact value of the total edge irregularity strength of complete graphs and complete bipartite graphs.     

On the chromaticity of complete multipartite graphs with certain edges added

Let P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H,λ)=P(G,λ) implies H is isomorphic to G. For integers k≥0, t≥2, denote by K((t−1)×p,p+k) the complete t-partite graph that has t−1 partite sets of size p and one partite set of size p+k. Let K(s,t,p,k) be the set of graphs obtained from K((t−1)×p,p+k) by adding a set S of s edges to the partite set of size p+k such that 〈S〉 is bipartite. If s=1, denote the only graph in K(s,t,p,k) by K⁺((t−1)×p,p+k). In this paper, we shall prove that for k=0,1 and p+k≥s+2, each graph G∈K(s,t,p,k) is chromatically unique if and only if 〈S〉 is a chromatically unique graph that has no cut-vertex. As a direct consequence, the graph K⁺((t−1)×p,p+k) is chromatically unique for k=0,1 and p+k≥3.     

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.     

Spectral shift function and resonances for slowly varying perturbations of periodic Schrödinger operators

We study the spectral shift function s(λ,h) and the resonances of the operator P(h)=-Δ+V(x)+W(hx). Here V is a periodic potential, W a decreasing perturbation and h a small positive constant. We give a representation of the derivative of s(λ,h) related to the resonances of P(h), and we obtain a Weyl-type asymptotics of s(λ,h). We establish an upper bound O(h^-n+1) for the number of the resonances of P(h) lying in a disk of radius h.     

Hua operators and Poisson transform for bounded symmetric domains

Let Ω be a bounded symmetric domain of non-tube type in Cn with rank r and S its Shilov boundary. We consider the Poisson transform Psf(z) for a hyperfunction f on S defined by the Poisson kernel Ps(z,u)=s(h(z,z)^n/r/²|h(z,u)^n/r|), (z,u)×Ω×S, s∈C. For all s satisfying certain non-integral condition we find a necessary and sufficient condition for the functions in the image of the Poisson transform in terms of Hua operators. When Ω is the type I matrix domain in Mn,m(C) (n?m), we prove that an eigenvalue equation for the second order Mn,n-valued Hua operator characterizes the image.     

Weighted inequalities and pointwise estimates for the multilinear fractional integral and maximal operators

In this article we prove weighted norm inequalities and pointwise estimates between the multilinear fractional integral operator and the multilinear fractional maximal. As a consequence of these estimations we obtain weighted weak and strong inequalities for the multilinear fractional maximal operator or function. In particular, we extend some results given in Carro et al. (2005) [7] to the multilinear context. On the other hand we prove weighted pointwise estimates between the multilinear fractional maximal operator Mα,B associated to a Young function B and the multilinear maximal operators Mψ=M0,ψ, ψ(t)=B(t1−α/(nm))^nm/(nm−α). As an application of these estimate we obtain a direct proof of the Lp−Lq boundedness results of Mα,B for the case B(t)=t and Bk(t)=tk(1+log⁺t) when 1/q=1/p−α/n. We also give sufficient conditions on the weights involved in the boundedness results of Mα,B that generalizes those given in Moen (2009) [22] for B(t)=t. Finally, we prove some boundedness results in Banach function spaces for a generalized version of the multilinear fractional maximal operator.     

A characterization of maximal non-k-factor-critical graphs

A graph G of order p is k-factor-critical,where p and k are positive integers with the same parity, if the deletion of any set of k vertices results in a graph with a perfect matching. G is called maximal non-k-factor-critical if G is not k-factor-critical but G+e is k-factor-critical for every missing edge e∉E(G). A connected graph G with a perfect matching on 2n vertices is k-extendable, for 1?k?n-1, if for every matching M of size k in G there is a perfect matching in G containing all edges of M. G is called maximal non-k-extendable if G is not k-extendable but G+e is k-extendable for every missing edge e∉E(G) . A connected bipartite graph G with a bipartitioning set (X,Y) such that |X|=|Y|=n is maximal non-k-extendable bipartite if G is not k-extendable but G+xy is k-extendable for any edge xy∉E(G) with x∈X and y∈Y. A complete characterization of maximal non-k-factor-critical graphs, maximal non-k-extendable graphs and maximal non-k-extendable bipartite graphs is given.     

Density of finite rank operators in the Banach space of p-compact operators

A Banach space X is said to have the kp-approximation property (kp-AP) if for every Banach space Y, the space F(Y,X) of finite rank operators is dense in the space Kp(Y,X) of p-compact operators endowed with its natural ideal norm kp. In this paper we study this notion that has been previously treated by Sinha and Karn (2002) in [15]. As application, the kp-AP of dual Banach spaces is characterized via density of finite rank operators in the space of quasi p-nuclear operators for the p-summing norm. This allows to obtain a relation between the kp-AP and Saphar's approximation property. As another application, the kp-AP is characterized in terms of a trace condition. Finally, we relate the kp-AP to the (p,p)-approximation property introduced in Sinha and Karn (2002) [15] for subspaces of Lp(μ)-spaces.     

Sequences of Hopf-Swan subgroups

Let l be an odd prime which satisfies Vandiver's conjecture, let n?1 be an integer, and let K=Q(ζn) where ζn is a primitive lnth root of unity. Let Cl denote the cyclic group of order l. For each j, j=1,…,ln−1, there exists an inclusion of Larson orders in KCl: Λj−1⊆Λj and a corresponding surjection of Hopf-Swan subgroups T(Λj−1)→T(Λj). For the cases n=1,2 we investigate the structure of various terms in the sequence of Hopf-Swan subgroups including the Swan subgroup T(Λ₀).     

On the low regularity of the Benney-Lin equation

We consider the low regularity of the Benney-Lin equation ut+uux+uxxx+β(uxx+uxxxx)+ηuxxxxx=0. We established the global well posedness for the initial value problem of Benney-Lin equation in the Sobolev spaces Hs(R) for 0?s>−2, improving the well-posedness result of Biagioni and Linares [H.A. Biaginoi, F. Linares, On the Benney-Lin and Kawahara equation, J. Math. Anal. Appl. 211 (1997) 131-152]. For s<−2 we also prove some ill-posedness issues.     

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.     

Identification of the unknown diffusion coefficient in a linear parabolic equation by the semigroup approach

In this article, we study the semigroup approach for the mathematical analysis of the inverse coefficient problems of identifying the unknown coefficient k(x) in the linear parabolic equation ut(x,t)=(k(x)uxx(x,t)), with Dirichlet boundary conditions u(0,t)=ψ₀, u(1,t)=ψ₁. Main goal of this study is to investigate the distinguishability of the input-output mappings Φ[⋅]:K→C¹[0,T], Ψ[⋅]:K→C¹[0,T] via semigroup theory. In this paper, we show that if the null space of the semigroup T(t) consists of only zero function, then the input-output mappings Φ[⋅] and Ψ[⋅] have the distinguishability property. Moreover, the values k(0) and k(1) of the unknown diffusion coefficient k(x) at x=0 and x=1, respectively, can be determined explicitly by making use of measured output data (boundary observations) f(t):=k(0)ux(0,t) or/and h(t):=k(1)ux(1,t). In addition to these, the values k^′(0) and k^′(1) of the unknown coefficient k(x) at x=0 and x=1, respectively, are also determined via the input data. Furthermore, it is shown that measured output dataf(t) and h(t) can be determined analytically, by an integral representation. Hence the input-output mappings Φ[⋅]:K→C¹[0,T], Ψ[⋅]:K→C¹[0,T] are given explicitly in terms of the semigroup. Finally by using all these results, we construct the local representations of the unknown coefficient k(x) at the end points x=0 and x=1.     

Maximal Sidon sets and matroids

A subset X of an abelian group Γ, written additively, is a Sidon set of orderh if whenever {(a_i,m_i):i∈I} and {(b_j,n_j):j∈J} are multisets of size h with elements in X and ∑_i∈Im_ia_i=∑_j∈Jn_jb_j, then {(a_i,m_i):i∈I}={(b_j,n_j):j∈J}. The set X is a generalized Sidon set of order(h,k) if whenever two such multisets have the same sum, then their multiset intersection has size at least k. It is proved that if X is a generalized Sidon set of order (2h−1,h−1), then the maximal Sidon sets of order h contained in X have the same cardinality. Moreover, X is a matroid where the independent subsets of X are the Sidon sets of order h.