Quasi-metrics and monotone normality

The purpose of this paper is to study which quasi-metrizable spaces are monotonically normal. In particular, we provide a sufficient condition for a quasi-metrizable space to be monotonically normal. This enables us to prove the monotone normality of a certain amount of interesting examples of quasi-metric spaces; for instance, we show that the continuous poset of formal balls of a metric space, endowed with the Scott topology, is a monotonically normal quasi-metrizable space.     

Connected Resolvability of Graphs

For an ordered set W = {w ₁, w ₂,..., w _k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W) = (d(v, w ₁), d(v, w ₂),... d(v, w _k)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representations with respect to W. A resolving set for G containing a minimum number of vertices is a basis for G. The dimension dim(G) is the number of vertices in a basis for G. A resolving set W of G is connected if the subgraph 〈W〉 induced by W is a nontrivial connected subgraph of G. The minimum cardinality of a connected resolving set in a graph G is its connected resolving number cr(G). Thus 1 ≤ dim(G) ≤ cr(G) ≤ n?1 for every connected graph G of order n ≥ 3. The connected resolving numbers of some well-known graphs are determined. It is shown that if G is a connected graph of order n ≥ 3, then cr(G) = n?1 if and only if G = K _n or G = K _1,n?1. It is also shown that for positive integers a, b with a ≤ b, there exists a connected graph G with dim(G) = a and cr(G) = b if and only if $\left( {a,b} \right) \notin \left\{ {\left( {1,k} \right):k = 1\;{\text{or}}\;k \geqslant 3} \right\}$ Several other realization results are present. The connected resolving numbers of the Cartesian products G × K ₂ for connected graphs G are studied.     

Resolvability of infinite designs

In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t  -(v,k,Λ)$(v,k,\Lambda )$ design with t finite, v   infinite and k,λ<v$k,\lambda <v$ is resolvable and, in fact, has α   orthogonal resolutions for each α<v$\alpha <v$. We also show that, while a t  -(v,k,Λ)$(v,k,\Lambda )$ design with t and λ finite, v   infinite and k=v$k=v$ may or may not have a resolution, any resolution of such a design must have v parallel classes containing v   blocks and at most λ−1$\lambda -1$ parallel classes containing fewer than v   blocks. Further, a resolution into parallel classes of any specified sizes obeying these conditions is realisable in some design. When k<v$k<v$ and λ=v$\lambda =v$ and when k=v$k=v$ and λ is infinite, we give various examples of resolvable and non-resolvable t  -(v,k,Λ)$(v,k,\Lambda )$ designs.     

Resolvability vs. almost resolvability

A space X is κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets of X).Answering a problem raised by Juhász, Soukup, and Szentmiklóssy, and improving a consistency result of Comfort and Hu, we prove, in ZFC, that for every infinite cardinal κ there is an almost κ²-resolvable but not ω₁-resolvable space of dispersion character κ.     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.     

Conditional Resolvability of Honeycomb and Hexagonal Networks

Given a graph G = (V, E), a set W í V{W \subseteq V} is said to be a resolving set if for each pair of distinct vertices u, v ? V{u, v \in V} there is a vertex x in W such that d(u, x) 1 d(v, x){d(u, x) \neq d(v, x)} . The resolving number of G is the minimum cardinality of all resolving sets. In this paper, conditions are imposed on resolving sets and certain conditional resolving parameters are studied for honeycomb and hexagonal networks.     

Weak normality properties and factorizations of normality

Summary Variants of δ-normality and δ-normal separation called weakly (functionally) δ-normal spaces are introduced and studied. This yields new factorizations of normality and δ-normality. A Urysohn type lemma and a Tietze type extension theorem for (weakly) functionally δ-normal spaces are obtained.     

Global Resolvability for Quasilinear Hyperbolic Systems

In this paper, we consider the globally smooth solutions of diagonalizable systems consisted of n-equations. We give a sufficient condition which guarantees the global existence of smooth solutions. Tb.e techniques used in this paper can be applied to study the globally smooth (or continuous) solutions diagonalizable noostrict hyperbolic conversation laws.     

Resolvability properties via independent families

The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω<λ?κ, no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (DI(λ)) is λ-resolvable.     

Local asymptotic normality and mixed normality for Markov statistical models

Summary We prove local asymptotic normality (resp. local asymptotic mixed normality) of a statistical experiment, when the observation is a positive-recurrent (resp. null-recurrent, with an additional technical assumption) Markov chain or Markov step process, under rather mild regularity assumptions on the transition kernel for Markov chains, on the infinitesimal generator for Markov processes. The proof makes intensive use of Hellinger processes, thus avoiding almost completely to study the more complicated structure of the likelihoods themselves.     

Resolvability of spaces having small spread or extent

In a recent paper O. Pavlov proved the following two interesting resolvability results:

(1)

If a T₁-space X satisfies Δ(X)>ps(X) then X is maximally resolvable.

(2)

If a T₃-space X satisfies Δ(X)>pe(X) then X is ω-resolvable.

Here ps(X) (pe(X)) denotes the smallest successor cardinal such that X has no discrete (closed discrete) subset of that size and Δ(X) is the smallest cardinality of a non-empty open set in X.In this note we improve (1) by showing that Δ(X)>ps(X) can be relaxed to Δ(X)?ps(X), actually for an arbitrary topological space X. In particular, if X is any space of countable spread with Δ(X)>ω then X is maximally resolvable.The question if an analogous improvement of (2) is valid remains open, but we present a proof of (2) that is simpler than Pavlov's.     

Shared values and normality

This paper investigates the relationship between the normality and the shared values for a meromorphic function on the unit disc Δ. Based on Marty’s normality criterion and through a detailed analysis of the meromorphic functions, it is shown that if for every f ∈ , f and f ^(k) share a and b on Δ and the zeros of f(z) − a are of multiplicity k ⩾ 3, then is normal on Δ, where is a family of meromorphic functions on the unit disc Δ, and a and b are distinct values. Selected from Journal of East China Normal University (Natural Science), 2003, 4: 12–18. This work was supported by the National Natural Science Foundation of China under grant number 10271122 and by Shanghai City Foundation for selected academic research     

Monotone normality and paracompactness

In this paper it is proved that a topological space is necessarily paracompact if it is monotonically normal and any one of the following: screenable, paralindelöf, has a G_δ-diagonal or a quasi-G_δ-diagonal or has a σ-locally-countable base.