Ordinal remainders of ψ-spaces

We consider which ordinals, with the order topology, can be Stone-?ech remainders of which spaces of the form ψ(κ,M), where ω?κ is a cardinal number and M⊂ω[κ] is a maximal almost disjoint family of countable subsets of κ (MADF). The cardinality of the continuum, denoted c, and its successor cardinal, c⁺, play important roles. We show that if κ>c⁺, then no ψ(κ,M) has any ordinal as a Stone-?ech remainder. If κ?c then for every ordinal δ<κ⁺ there exists Mδ⊂ω[κ], a MADF, such that βψ(κ,Mδ)?ψ(κ,Mδ) is homeomorphic to δ+1. For κ=c⁺, βψ(κ,Mδ)?ψ(κ,Mδ) is homeomorphic to δ+1 if and only if c⁺?δ<c⁺⋅ω.     

Selection over classes of ordinals expanded by monadic predicates

A monadic formula ψ(Y) is a selector for a monadic formula φ(Y) in a structure M if ψ defines in M a unique subset P of the domain and this P also satisfies φ in M. If C is a class of structures and φ is a selector for ψ in every M∈C, we say that φ is a selector for φ over C.For a monadic formula φ(X,Y) and ordinals α≤ω₁ and δ<ω^ω, we decide whether there exists a monadic formula ψ(X,Y) such that for every P⊆αof order-type smaller thanδ, ψ(P,Y) selects φ(P,Y) in (α,<). If so, we construct such a ψ.We introduce a criterion for a class C of ordinals to have the property that every monadic formula φ has a selector over it. We deduce the existence of S⊆ω^ω such that in the structure (ω^ω,<,S) every formula has a selector.Given a monadic sentence π and a monadic formula φ(Y), we decide whether φ has a selector over the class of countable ordinals satisfying π, and if so, construct one for it.     

On the Fourier transforms of retarded Lorentz-invariant functions

In this article we evaluate the Fourier transforms of retarded Lorentz-invariant functions (and distributions) as limits of Laplace transforms. Our method works generally for any retarded Lorentz-invariant functions φ(t) (t?Rⁿ) which is, besides, a continuous function of slow growth. We give, among others, the Fourier transform of G_R(t, α, m², n) and G_A(t, α, m², n), which, in the particular case α = 1, are the characteristic functions of the volume bounded by the forward and the backward sheets of the hyperboloid u = m² and by putting α = ?k are the derivatives of k-order of the retarded and the advanced-delta on the hyperboloid u = m². We also obtain the Fourier transform of the function W(t, α, m², n) introduced by M. Riesz (Comm. Sem. Mat. Univ. Lund4 (1939)). We finish by evaluating the Fourier transforms of the distributional functions G_R(t, α, m², n), G_A(t, α, m², n) and W(t, α, m², n) in their singular points.     

An elementary operator with log-hyponormal, p-hyponormal entries

A Hilbert space operator A∈B(H) is p-hyponormal, A∈(p-H), if |A^∗|^2p?|A|^2p; an invertible operator A∈B(H) is log-hyponormal, A∈(?-H), if log(TT^∗)?log(T^∗T). Let d_AB=δ_AB or ?_AB, where δ_AB∈B(B(H)) is the generalised derivation δ_AB(X)=AX-XB and ?_AB∈B(B(H)) is the elementary operator ?_AB(X)=AXB-X. It is proved that if A,B^∗∈(?-H)∪(p-H), then, for all complex λ, , the ascent of (d_AB-λ)?1, and d_AB satisfies the range-kernel orthogonality inequality ‖X‖?‖X-(d_AB-λ)Y‖ for all X∈(d_AB-λ)^-1(0) and Y∈B(H). Furthermore, isolated points of σ(d_AB) are simple poles of the resolvent of d_AB. A version of the elementary operator E(X)=A₁XA₂-B₁XB₂ and perturbations of d_AB by quasi-nilpotent operators are considered, and Weyl’s theorem is proved for d_AB.     

Reduced limits for nonlinear equations with measures

We consider equations (E) −Δu+g(u)=μ in smooth bounded domains Ω⊂RN, where g is a continuous nondecreasing function and μ is a finite measure in Ω. Given a bounded sequence of measures (μk), assume that for each k?1 there exists a solution uk of (E) with datum μk and zero boundary data. We show that if uk→u# in L¹(Ω), then u# is a solution of (E) relative to some finite measure μ#. We call μ# the reduced limit of (μk). This reduced limit has the remarkable property that it does not depend on the boundary data, but only on (μk) and on g. For power nonlinearities g(t)=|t|^q−1t, ∀t∈R, we show that if (μk) is nonnegative and bounded in W−2,q(Ω), then μ and μ# are absolutely continuous with respect to each other; we then produce an example where μ#≠μ.     

A method of finding automorphism groups of endomorphism monoids of relational systems

For any set X and any relation ρ on X, let T(X,ρ) be the semigroup of all maps a:X→X that preserve ρ. Let S(X) be the symmetric group on X. If ρ is reflexive, the group of automorphisms of T(X,ρ) is isomorphic to N_S(X)(T(X,ρ)), the normalizer of T(X,ρ) in S(X), that is, the group of permutations on X that preserve T(X,ρ) under conjugation. The elements of N_S(X)(T(X,ρ)) have been described for the class of so-called dense relations ρ. The paper is dedicated to applications of this result.     

The forcing hull and forcing geodetic numbers of graphs

For every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. For a graph G, let I_G[u,v] denote the set of all vertices lying on a u-v geodesic. Let S⊆V(G) and I_G[S] denote the union of all I_G[u,v] for all u,v∈S. A subset S⊆V(G) is a convex set of G if I_G[S]=S. A convex hull [S]_G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]_G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if I_G[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset F⊆V(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number f_h(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number f_g(G) of G. In the paper, we construct some 2-connected graph G with (f_h(G),f_g(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+b≥2, there exists a 2-connected graph G with (f_h(G),f_g(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81-94].     

The cardinal characteristic for relative γ-sets

For X a separable metric space define p(X) to be the smallest cardinality of a subset Z of X which is not a relative γ-set in X, i.e., there exists an ω-cover of X with no γ-subcover of Z. We give a characterization of p(ω²) and p(ωω) in terms of definable free filters on ω which is related to the pseudo-intersection number p. We show that for every uncountable standard analytic space X that either p(X)=p(ω²) or p(X)=p(ωω). We show that the following statements are each relatively consistent with ZFC: (a) p=p(ωω)<p(ω²) and (b) p<p(ωω)=p(ω²)     

The eccentric connectivity index of nanotubes and nanotori

Let G be a molecular graph. The eccentric connectivity index ξ^c(G) is defined as ξ^c(G)=∑_u∈V(G)deg_G(u)ε_G(u), where deg_G(u) denotes the degree of vertex u and ε_G(u) is the largest distance between u and any other vertex v of G. In this paper exact formulas for the eccentric connectivity index of TUC₄C₈(S) nanotube and TC₄C₈(S) nanotorus are given.     

Small cycles and 2-factor passing through any given vertices in graphs

The theory of vertex-disjoint cycles and 2-factor of graphs has important applications in computer science and network communication. For a graph G, let σ ₂(G):=min?{d(u)+d(v)|uv ? E(G),u≠v}. In the paper, the main results of this paper are as follows:

1. Let k≥2 be an integer and G be a graph of order n≥3k, if σ ₂(G)≥n+2k?2, then for any set of k distinct vertices v ₁,…,v _k , G has k vertex-disjoint cycles C ₁,C ₂,…,C _k of length at most four such that v _i ∈V(C _i ) for all 1≤i≤k.
2. Let k≥1 be an integer and G be a graph of order n≥3k, if σ ₂(G)≥n+2k?2, then for any set of k distinct vertices v ₁,…,v _k , G has k vertex-disjoint cycles C ₁,C ₂,…,C _k such that:
   1. v _i ∈V(C _i ) for all 1≤i≤k.
   2. V(C ₁)∪???∪V(C _k )=V(G), and
   3. |C _i |≤4, 1≤i≤k?1.

Moreover, the condition on σ ₂(G)≥n+2k?2 is sharp.     

Maps preserving peripheral spectrum of Jordan semi-triple products of operators

Let A and B be (not necessarily unital or closed) standard operator algebras on complex Banach spaces X and Y, respectively. For a bounded linear operator A on X, the peripheral spectrum σ_π(A) of A is the set σ_π(A)={z∈σ(A):|z|=max_ω∈σ(A)|ω|}, where σ(A) denotes the spectrum of A. Assume that Φ:A→B is a map the range of which contains all operators of rank at most two. It is shown that the map Φ satisfies the condition that σ_π(BAB)=σ_π(Φ(B)Φ(A)Φ(B)) for all A,B∈A if and only if there exists a scalar λ∈C with λ³=1 and either there exists an invertible operator T∈B(X,Y) such that Φ(A)=λTAT^-1 for every A∈A; or there exists an invertible operator T∈B(X^∗,Y) such that Φ(A)=λTA^∗T^-1 for every A∈A. If X=H and Y=K are complex Hilbert spaces, the maps preserving the peripheral spectrum of the Jordan skew semi-triple product BA^∗B are also characterized. Such maps are of the form A?UAU^∗ or A?UA^tU^∗, where U∈B(H,K) is a unitary operator, A^t denotes the transpose of A in an arbitrary but fixed orthonormal basis of H.     

Viscosity approximation methods for nonexpansive mappings and inverse-strongly monotone mappings in Hilbert spaces

Let C be a closed convex subset of a Hilbert space H. Let f is a contraction on C. Let S be a nonexpansive mapping of C into itself and A be an α-inverse-strongly monotone mapping of C into H. Assuming that F(S)∩VI(C,A)≠φ, and x ₀=x∈C, in this paper we introduce the iterative process x _n+1=α _n f(x _n )+β _n x _n +γ _n (μ Sx _n +(1?μ)(P _C (I?λ _n A)y _n )), where y _n =P _C (I?λ _n A)x _n . We prove that {x _n } and {y _n } converge strongly to the same point z∈F(S)∩VI(C,A). As its application, we give a strong convergence theorem for nonexpansive mapping and strictly pseudo-contractive mapping in a Hilbert space.     

Some paranormed sequence spaces of non-absolute type derived by weighted mean

The sequence spaces ?_∞(p), c(p) and c₀(p) were introduced and studied by Maddox [I.J. Maddox, Paranormed sequence spaces generated by infinite matrices, Proc. Cambridge Philos. Soc. 64 (1968) 335-340]. In the present paper, the sequence spaces λ(u,v;p) of non-absolute type which are derived by the generalized weighted mean are defined and proved that the spaces λ(u,v;p) and λ(p) are linearly isomorphic, where λ denotes the one of the sequence spaces ?_∞, c or c₀. Besides this, the β- and γ-duals of the spaces λ(u,v;p) are computed and the basis of the spaces c₀(u,v;p) and c(u,v;p) is constructed. Additionally, it is established that the sequence space c₀(u,v) has AD property and given the f-dual of the space c₀(u,v;p). Finally, the matrix mappings from the sequence spaces λ(u,v;p) to the sequence space μ and from the sequence space μ to the sequence spaces λ(u,v;p) are characterized.     

Greedy F-colorings of graphs

Let G=(V,E) be a connected graph. For a symmetric, integer-valued function δ on V×V, where K is an integer constant, N₀ is the set of nonnegative integers, and Z is the set of integers, we define a C-mapping by F(u,v,m)=δ(u,v)+m−K. A coloring c of G is an F-coloring if F(u,v,|c(u)−c(v)|)?0 for every two distinct vertices u and v of G. The maximum color assigned by c to a vertex of G is the value of c, and the F-chromatic number F(G) is the minimum value among all F-colorings of G. For an ordering of the vertices of G, a greedy F-coloring c of s is defined by (1) c(v₁)=1 and (2) for each i with 1?i<n, c(v_i+1) is the smallest positive integer p such that F(v_j,v_i+1,|c(v_j)−p|)?0, for each j with 1?j?i. The greedy F-chromatic number gF(s) of s is the maximum color assigned by c to a vertex of G. The greedy F-chromatic number of G is gF(G)=min{gF(s)} over all orderings s of V. The Grundy F-chromatic number is GF(G)=max{gF(s)} over all orderings s of V. It is shown that gF(G)=F(G) for every graph G and every F-coloring defined on G. The parameters gF(G) and GF(G) are studied and compared for a special case of the C-mapping F on a connected graph G, where δ(u,v) is the distance between u and v and .     

Marriage in denumerable societies

A society is an ordered triple (M, W, K) of sets such that M, W are disjoint and K ? M × W. An espousal of (M, W, K) is a subset of K of the form {(a, e(a)) : a ∈ M} where e(a₁) ≠ e(a₂) whenever a₁ ≠ a₂. If M is countable, we associate with (M, W, K) and each ordinal α a function m_α from the set of subsets of W into the union of the set of integers and {? ∞, ∞}. Three different definitions of m_α (all fairly elaborate) are presented and their equivalence under suitable conditions is proved. Assuming M to be countable, we prove that (i) (M, W, K) has an espousal if and only if $\text{m}{}_{\mathrm{\Omega }}\text{(X) ? 0}$ for every subset X of W, where Ω is the first uncountable ordinal, and (ii) if X ? W and α ? β and m_α(X) < ∞ and m_α(Z) ? 0 for every subset Z of X then m_α(Z) = m_β(Z) for every subset Z of X. The result (i) is a theorem of Damerell and Milner, but the proof here presented differs somewhat in formulation and structure from theirs.     

Partitions of natural numbers with the same representation functions

For a set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. Let D(0)=0 and let D(a) denote the number of ones in the binary representation of a. Let A₀ be the set of all nonnegative integers a with even D(a) and A₁ be the set of all nonnegative integers a with odd D(a). In this paper we show that (a) if R₂(A,n)=R₂(N?A,n) for all n?2N−1, then R₂(A,n)=R₂(N?A,n)?1 for all n?12N²−10N−2 except for A=A₀ or A=A₁; (b) if R₃(A,n)=R₃(N?A,n) for all n?2N−1, then R₃(A,n)=R₃(N?A,n)?1 for all n?12N²+2N. Several problems are posed in this paper.     

On the locating chromatic number of Kneser graphs

Let c be a proper k-coloring of a connected graph G and Π=(C₁,C₂,…,C_k) be an ordered partition of V(G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple c_Π(v):=(d(v,C₁),d(v,C₂),…,d(v,C_k)), where d(v,C_i)=min{d(v,x)|x∈C_i},1≤i≤k. If distinct vertices have distinct color codes, then c is called a locating coloring. The minimum number of colors needed in a locating coloring of G is the locating chromatic number of G, denoted by χ_L(G). In this paper, we study the locating chromatic number of Kneser graphs. First, among some other results, we show that χ_L(KG(n,2))=n−1 for all n≥5. Then, we prove that χ_L(KG(n,k))≤n−1, when n≥k². Moreover, we present some bounds for the locating chromatic number of odd graphs.     

Inverse cyclotomic polynomials

Let Ψn(x) be the monic polynomial having precisely all non-primitive nth roots of unity as its simple zeros. One has Ψn(x)=(xn−1)/Φn(x), with Φn(x) the nth cyclotomic polynomial. The coefficients of Ψn(x) are integers that like the coefficients of Φn(x) tend to be surprisingly small in absolute value, e.g. for n<561 all coefficients of Ψn(x) are ?1 in absolute value. We establish various properties of the coefficients of Ψn(x), especially focusing on the easiest non-trivial case where n is composed of 3 distinct odd primes.     

A generalized weight for linear codes and a Witt-MacWilliams theorem

Let F be a finite field, H a subgroup of $\text{F}{}^1$ of index ν, and α₁,…, α_ν coset representatives. For each n-tuple u = (u₁,…, u_n) ?Fⁿ define W_H(u) = (w₁(u),…, w_ν(u)), where w_m(u) = #{u_i: u_i?α_mH}. An H-monomial map on Fⁿ is an automorphism of Fⁿ whose matrix with respect to the co-ordinate basis is of the form P · D, where P is a permutation matrix and D is a diagonal matrix with non-zero entries from H. Suppose C is an (n, k) code over F (that is, a k-dimensional subspace of Fⁿ) and that ?: C → Fⁿ is an injective homomorphism which preserves W_H in the sense that W_H(?(u)) = W_H(u) for all u ?C. We prove that ? may be extended to an H-monomial map on Fⁿ. This generalization of a theorem of MacWilliams on the (Hamming) equivalence of codes may be considered an analogue of the Witt theorem of metric vector space theory.     

M(r, s)-ideals of compact operators

We study the position of compact operators in the space of all continuous linear operators and its subspaces in terms of ideals. One of our main results states that for Banach spaces X and Y the subspace of all compact operators K (X, Y) is an M(r ₁ r ₂, s ₁ s ₂)-ideal in the space of all continuous linear operators L(X, Y) whenever K (X,X) and K (Y, Y) are M(r ₁, s ₁)- and M(r ₂, s ₂)-ideals in L(X,X) and L(Y, Y), respectively, with r ₁ + s ₁/2 > 1 and r ₂ +s ₂/2 > 1. We also prove that the M(r, s)-ideal K (X, Y ) in L(X, Y ) is separably determined. Among others, our results complete and improve some well-known results on M-ideals.