The Connected Monophonic Number of a Graph

For a connected graph G = (V, E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x ? y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A connected monophonic set of G is a monophonic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected monophonic set of G is the connected monophonic number of G and is denoted by m _c (G). We determine bounds for it and characterize graphs which realize these bounds. For any two vertices u and v in G, the monophonic distance d _m (u, v) from u to v is defined as the length of a longest u ? v monophonic path in G. The monophonic eccentricity e _m (v) of a vertex v in G is the maximum monophonic distance from v to a vertex of G. The monophonic radius rad _m G of G is the minimum monophonic eccentricity among the vertices of G, while the monophonic diameter diam _m G of G is the maximum monophonic eccentricity among the vertices of G. It is shown that for positive integers r, d and n ≥ 5 with r <  d, there exists a connected graph G with rad _m G =  r, diam _m G =  d and m _c (G) =  n. Also, if a,b and p are positive integers such that 2 ≤  a <  b ≤  p, then there exists a connected graph G of order p, m(G) =  a and m _c (G) =  b.     

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.     

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.     

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.     

Extremal sizes of subspace partitions

A subspace partition Π of V?= V(n, q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of Π. The size of Π is the number of its subspaces. Let σ _q (n, t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let ρ _q (n, t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this article, we determine the values of σ _q (n, t) and ρ _q (n, t) for all positive integers n and t. Furthermore, we prove that if n ≥?2t, then the minimum size of a maximal partial t-spread in V(n +?t ?1, q) is σ _q (n, t).     

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.     

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.     

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.     

On some friends of the sociable numbers

Let s(n) denote the sum of the proper divisors of n. Set s ₀(n) = n, and for k > 0, put s _k (n) := s(s _k-1(n)) if s _k-1(n) > 0. Thus, perfect numbers are those n with s(n)?=?n and amicable numbers are those n with s(n) ?? n but s ₂(n)?=?n. We prove that for each fixed k ?? 1, the set of n which divide s _k (n) has density zero, and similarly for the set of n for which s _k (n) divides n. These results generalize the theorem of Erd?s that for each fixed k, the set of n for which s _k (n)?=?n has density zero.     

Abelian group matrices over the p-adic and rational integers

Let G be a finite abelian group of order n. Let Z and Q denote the rational integers and rationals, respectively. A group matrix for G over Z (or Q) is an n-square matrix of the form Σ_{g ∈ G}a_gP(g), where a_g ∈ Z (or Q) and P is the regular representation of G so that P(g) is an n-square permutation matrix and P(gh) = P(g)P(h) for all g, h ∈ G. It is known that if M is an arbitrary positive definite unimodular matrix over Z then there exists a matrix A over Q such that M = A^τA, where τ denotes transposition. This paper proves that the exact analogue of this theorem holds if one demands that M and A be group matrices for G over Z and Q, respectively. Furthermore, if M is a group matrix for G over the p-adic integers then necessary and sufficient conditions are given for the existence of a group matrix A for G over the p-adic numbers such that M = A^τA.     

Some permutation problems

Put Z_n = {1, 2,…, n} and let π denote an arbitrary permutation of Z_n. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let $\text{A}\text{(r, s, t)}$ be the number of π ∈ Z_n with r ups, s downs, and t fixed points. Problem II. Consider the triple π^?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of π ∈ Z_n with r occurrences of π^?1(a)RaRπ(a) and s occurrences of π^?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.     

Independence and coloring properties of direct products of some vertex-transitive graphs

Let α(G) and χ(G) denote the independence number and chromatic number of a graph G, respectively. Let G×H be the direct product graph of graphs G and H. We show that if G and H are circular graphs, Kneser graphs, or powers of cycles, then α(G×H)=max{α(G)|V(H)|,α(H)|V(G)|} and χ(G×H)=min{χ(G),χ(H)}.     

Algebraic properties of codimension series of PI-algebras

Let c _n (R), n = 0, 1, 2, …, be the codimension sequence of the PI-algebra R over a field of characteristic 0 with T-ideal T(R) and let c(R, t) = c ₀(R) + c ₁(R)t + c ₂(R)t ² + … be the codimension series of R (i.e., the generating function of the codimension sequence of R). Let R ₁,R ₂ and R be PI-algebras such that T(R) = T(R1)T(R ₂). We show that if c(R ₁, t) and c(R ₂, t) are rational functions, then c(R, t) is also rational. If c(R ₁, t) is rational and c(R ₂, t) is algebraic, then c(R, t) is also algebraic. The proof is based on the fact that the product of two exponential generating functions behaves as the exponential generating function of the sequence of the degrees of the outer tensor products of two sequences of representations of the symmetric groups S _n .     

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.     

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.     

Periodic solutions of semilinear equations of evolution of compact type

The existence of solutions in a weak sense of x′ + (A + B(t, x))x = f(t, x), x(0) = x(T) is established under the conditions that A generates a semigroup of compact type on a Hilbert space H; B(t,x) is a bounded linear operator and f(t, x) a function with values in H; for each square integrable ?(t) the problem with B(t, ?(t)) and f(t, ?(t)) in place of B(t, x) and f(t, x) has a unique solution; and B and f satisfy certain boundedness and continuity conditions.     

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.     

Necessary and sufficient conditions for boundedness of some commutators with weighted Lipschitz functions

In this paper we show that b∈Lipβ,μ if and only if the commutator [b,T] of the multiplication operator by b and the singular integral operator T is bounded from Lp(μ) to Lq(μ1−q), where 1<p<q<∞, 0<β<1 and 1/q=1/p−β/n. Also we will obtain that b∈Lipβ,μ if and only if the commutator [b,Iα] of the multiplication operator by b and the fractional integral operator Iα is bounded from Lp(μ) to Lr(μ1−(1−α/n)r), where 1<p<∞, 0<β<1 and 1/r=1/p−(β+α)/n with 1/p>(β+α)/n.     

Maps on matrices that preserve the spectrum

Let T be a continuous map of the space of complex n×n matrices into itself satisfying T(0)=0 such that the spectrum of T(x)-T(y) is always a subset of the spectrum of x-y. There exists then an invertible n×n matrix u such that either T(a)=uau^-1 for all a or T(a)=ua^tu^-1 for all a. We arrive at the same conclusion by supposing that the spectrum of x-y is always a subset of the spectrum of T(x)-Tt(y), without the continuity assumption on T.