Quasi-monotone mappings on θn-continua

A continuous function f from a continuum X onto a continuum Y is quasi-monotone if, for every subcontinuum M of Y with nonvoid interior, f^-1(M) has a finite number of components each of which is mapped onto M by f. A θ_n-continuum is one that no subcontinuum separates into more than n components. It is known that if f is quasi-monotone and X is a θ₁-continuum, then Y is a θ₁-continuum or a θ₂-continuum that is irreducible between two points. Examples are given to show that this cannot be generalized to a θ_n-continuum and n + 1 points for any n >1, but it is proved that if f is quasi-monotone and X is a θ_n-continuum, then Y is a θ_n-continuum or a θ_n+1-continuum that is the union of n + 2 continua H,S₁,S₂,…,S_n+1, whe for each i, S_i is the closure of a component of Y H, S_i is irreducible from some point P_i to H, and H is irreducible about its boundary. Some theorems and examples are given concerning the preservation of decomposition elements by a quasi-monotone map defined on a θ_n-continuum that admits a monotone, upper-semicontinuous decomposition onto a finite graph.     

Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions

A function f(x) defined on $\text{X}$ = $\text{X}$₁ × $\text{X}$₂ × … × $\text{X}$_n where each $\text{X}$_i is totally ordered satisfying f(x ∨ y) f(x ∧ y) ≥ f(x) f(y), where the lattice operations ∨ and ∧ refer to the usual ordering on $\text{X}$, is said to be multivariate totally positive of order 2 (MTP₂). A random vector Z = (Z₁, Z₂,…, Z_n) of n-real components is MTP₂ if its density is MTP₂. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies ?DΣ^?1D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP₂ properties. The MTP₂ property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP₂ kernels are presented and amplified by a wide variety of applications.     

On a class of martingale inequalities

Let Z = {Z₀, Z₁, Z₂,…} be a martingale, with difference sequence X₀ = Z₀, X_i = Z_i ? Z_{i ? 1}, i ≥ 1. The principal purpose of this paper is to prove that the best constant in the inequality λP(sup_i |X_i| ≥ λ) ≤ C sup_iE |Z_i|, for λ > 0, is C = (log 2)^?1. If Z is finite of length n, it is proved that the best constant is $\text{C}{}_{\mathrm{n}}\text{= [n(2}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{? 1)]}{}^{\mathrm{?1}}$. The analogous best constant C_n(z) when Z₀ ≡ z is also determined. For these finite cases, examples of martingales attaining equality are constructed. The results follow from an explicit determination of the quantity G_n(z, E) = sup_zP(max_i=1,…,n |X_i| ≥ 1), the supremum being taken over all martingales Z with Z₀ ≡ z and E|Z_n| = E. The expression for G_n(z,E) is derived by induction, using methods from the theory of moments.     

A note on reflexivity in Banach spaces

For any normed spaceX, the unit ball ofX is weak *-dense in the unit ball ofX ^**. This says that for any ε>0, for anyF in the unit ball ofX ^**, and for anyf ₁,…,f _n inX ^*, the system of inequalities |f _i(x)?F(f _i)|≤ε can be solved for somex in the unit ball ofX. The author shows that the requirement that ε be strictly positive can be dropped only ifX is reflexive.     

Borsuk presentations and the fixed-point index

We develop a theory of fixed-point index for maps f: X → X such that the fixed-point set of f is contained in a compact invariant set A, and A has a Borsuk presentation as an intersection of a decreasing sequence of ANR Z_n ? X and Z_{n + 1} is a retract of Z_n.     

A note on shadowing with chain transitivity

Let f : X → X be a continuous map of a compact metric space X. The map f induces in a natural way a map f_M on the space M(X) of probability measures on X, and a transformation f_K on the space K(X) of closed subsets of X. In this paper, we show that if (X, f) is a chain transitive system with shadowing property, then exactly one of the following two statements holds:

(a)

fⁿ and (f_K)ⁿ are syndetically sensitive for all n ? 1.

(b)

fⁿ and (f_K)ⁿ are equicontinuous for all n ? 1.

In particular, we show that for a continuous map f : X → X of a compact metric space X with infinite elements, if f is a chain transitive map with the shadowing property, then fⁿ and (f_K)ⁿ are syndetically sensitive for all n ? 1. Also, we show that if f_M (resp. f_K) is chain transitive and syndetically sensitive, and f_M (resp. f_K) has the shadowing property, then f is sensitive.In addition, we introduce the notion of ergodical sensitivity and present a sufficient condition for a chain transitive system (X, f) (resp. (M(X), f_M)) to be ergodically sensitive. As an application, we show that for a L-hyperbolic homeomorphism f of a compact metric space X, if f has the AASP, then fⁿ is syndetically sensitive and multi-sensitive for all n ? 1.     

On metric spaces with the properties of de Groot and Nagata in dimension one

A metric space (X,d) has the de Groot property GPn if for any points x₀,x₁,…,xn+2∈X there are positive indices i,j,k?n+2 such that i≠j and d(xi,xj)?d(x₀,xk). If, in addition, k∈{i,j} then X is said to have the Nagata property NPn. It is known that a compact metrizable space X has dimension dim(X)?n iff X has an admissible GPn-metric iff X has an admissible NPn-metric.We prove that an embedding f:(0,1)→X of the interval (0,1)⊂R into a locally connected metric space X with property GP₁ (resp. NP₁) is open, provided f is an isometric embedding (resp. f has distortion Dist(f)=‖fLip_‖⋅‖f−1Lip_‖<2). This implies that the Euclidean metric cannot be extended from the interval [−1,1] to an admissible GP₁-metric on the triode T=[−1,1]∪[0,i]. Another corollary says that a topologically homogeneous GP₁-space cannot contain an isometric copy of the interval (0,1) and a topological copy of the triode T simultaneously. Also we prove that a GP₁-metric space X containing an isometric copy of each compact NP₁-metric space has density ?c.     

Devaney’s chaos on uniform limit maps

Let (X, d) be a compact metric space and f_n : X → X a sequence of continuous maps such that (f_n) converges uniformly to a map f. The purpose of this paper is to study the Devaney’s chaos on the uniform limit f. On the one hand, we show that f is not necessarily transitive even if all f_n mixing, and the sensitive dependence on initial conditions may not been inherited to f even if the iterates of the sequence have some uniform convergence, which correct two wrong claims in [1]. On the other hand, we give some equivalence conditions for the uniform limit f to be transitive and to have sensitive dependence on initial conditions. Moreover, we present an example to show that a non-transitive sequence may converge uniformly to a transitive map.     

Global residues for sparse polynomial systems

We consider families of sparse Laurent polynomials f₁,…,f_n with a finite set of common zeros Z_f in the torus Tⁿ=(C−{0})ⁿ. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Z_f. We present a new symbolic algorithm for computing the global residue as a rational function of the coefficients of the f_i when the Newton polytopes of the f_i are full-dimensional. Our results have consequences in sparse polynomial interpolation and lattice point enumeration in Minkowski sums of polytopes.     

On the Bateman-Horn Conjecture

Let r be a positive integer and f₁,…,f_r be distinct polynomials in Z[X]. If f₁(n),…,f_r(n) are all prime for infinitely many n, then it is necessary that the polynomials f_i are irreducible in Z[X], have positive leading coefficients, and no prime p divides all values of the product f₁(n)···f_r(n), as n runs over Z. Assuming these necessary conditions, Bateman and Horn (Math. Comput.16 (1962), 363-367) proposed a conjectural asymptotic estimate on the number of positive integers n?x such that f₁(n),…,f_r(n) are all primes. In the present paper, we apply the Hardy-Littlewood circle method to study the Bateman-Horn conjecture when r?2. We consider the Bateman-Horn conjecture for the polynomials in any partition {f₁,…,f_s}, {f_s+1,…,f_r} with a linear change of variables. Our main result is as follows: If the Bateman-Horn conjecture on such a partition and change of variables holds true with some conjectural error terms, then the Bateman-Horn conjecture for f₁,…,f_r is equivalent to a plausible error term conjecture for the minor arcs in the circle method.     

Waldhausen's theory of k-fold end structures: a survey

Let R⁺ be the space of nonnegative real numbers. F. Waldhausen defines a k-fold end structure on a space X as an ordered k-tuple of continuous maps x_f:X → R⁺, 1 ? j ? k, yielding a proper map x:X → (R⁺)^k. The pairs (X,x) are made into the category E^k of spaces with k-fold end structure. Attachments and expansions in E^k are defined by induction on k, where elementary attachments and expansions in E⁰ have their usual meaning. The category E^k/Z consists of objects (X, i) where i: Z → X is an inclusion in E^k with an attachment of i(Z) to X, and the category E^k6Z consists of pairs (X,i) of E^k/Z that admit retractions X → Z. An infinite complex over Z is a sequence X = {X₁ ? X₂ ? … ? X_n …} of inclusions in E^k6Z. The abelian grou p S₀(Z) is then defined as the set of equivalence classes of infinite complexes dominated by finite ones, where the equivalence relation is generated by homotopy equivalence and finite attachment; and the abelian group S₁(Z) is defined as the set of equivalence classes of X₁, where X ∈ E^k/Z deformation retracts to Z. The group operations are gluing over Z. This paper presents the Waldhausen theory with some additions and in particular the proof of Waldhausen's proposition that there exists a natural exact sequence 0 → S₁(Z × R)→^πS₀(Z) by utilizing methods of L.C. Siebenmann. Waldhausen developed this theory while seeking to prove the topological invariance of Whitehead torsion; however, the end structures also have application in studying the splitting of a noncompact manifold as a product with R[1].     

On the Splitting Ring of a Polynomial

Let f(Z) = Zⁿ ? a₁Z^n?1 + … + (?1)^n?1a_n?1Z + (?1)ⁿa_n be a monic polynomial with coefficients in a ring R with identity, not necessarily commutative. We study the ideal I_f of R[X₁,…, X_n] generated by σ_i(X₁,…, X_n) ? a_i, where σ₁,…, σ_n are the elementary symmetric polynomials, as well as the quotient ring R[X₁,…, X_n]/I_f.     

Multiobjective programming and penalty functions

This paper generalizes the penalty function method of Zang-will for scalar problems to vector problems. The vector penalty function takes the form $$g(x,\lambda ) = f(x) + \lambda ^{ - 1} P(x)e,$$ wheree ?R ^m, with each component equal to unity;f:R ⁿ →R ^m, represents them objective functions {f ⁱ} defined onX \( \subseteq \) R ⁿ; λ ∈R ¹, λ>0;P:R ⁿ →R ¹ X \( \subseteq \) Z \( \subseteq \) R ⁿ,P(x)≦0, ∨x ∈R ⁿ,P(x) = 0 ?x ∈X. The paper studies properties of {E (Z, λ _r )} for a sequence of positive {λ _r } converging to 0 in relationship toE(X), whereE(Z, λ _r ) is the efficient set ofZ with respect tog(·, λ_r) andE(X) is the efficient set ofX with respect tof. It is seen that some of Zangwill's results do not hold for the vector problem. In addition, some new results are given.     

An algorithm for the divisors of monic polynomials over a commutative ring

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R₀ ⊕ … ⊕ R_m (m ≤ deg f), associated to a fundamental system of idempotents e₀, … , e_m, such that the component of f in each R_i[X] has degree coefficient which is a unit of R_i. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.     

Some comments on fuzzy variables

Nahmias introduced the concept of a fuzzy variable as a possible axiomatic framework from which a rigorous theory of fuzziness may be constructed. In this paper we attempt to shed more light on fuzzy variables in analogy with random variables. In particular, we study the problem: if X₁, X₂,…,X_n are mutually unrelated fuzzy variables with common membership function μ and α₁, α₂,…,α_n are real numbers satisfying α_i ? o for every i and Σ_i=1ⁿα_i=1, when does does Z = Σ_{i = 1}ⁿα_iX_i have the same membership function μ?     

On weak asymptotic isomorphy of memoryless correlated sources

Let {(X _i,Z _i)} be an i.i.d. sequence of random pairs in a finite set × x ℒ; we will call it a discrete memoryless stationary correlated (DMSC) source with generic distribution dist(X ₁,Z ₁). Two DMSC sources {(X _i,Z _i)} and {(X _i′,Z _i′)} are called asymptotically isomorphic in the weak sense if for every ε>0 and sufficiently largen, there exists a joint distribution dist(X ⁿ,Z ⁿ,X′ ⁿ,Z′ ⁿ) ofn-length blocks of the two sources such that . For single sources of equal entropy, McMillan’s theorem implies asymptotic isomorphy in the sense suggested by this definition. For correlated sources, however, no nontrivial cases of weak asymptotic isomorphy are known. We show that some spectral properties of the generic distributions are invariant for weak asymptotic isomorphy, and these properties wholly determine the generic distribution in many cases.     

On the modular sumset partition problem

A sequence m₁≥m₂≥?≥m_k of k positive integers isn-realizable if there is a partition X₁,X₂,…,X_k of the integer interval [1,n] such that the sum of the elements in X_i is m_i for each i=1,2,…,k. We consider the modular version of the problem and, by using the polynomial method by Alon (1999) [2], we prove that all sequences in Z/pZ of length k≤(p−1)/2 are realizable for any prime p≥3. The bound on k is best possible. An extension of this result is applied to give two results of p-realizable sequences in the integers. The first one is an extension, for n a prime, of the best known sufficient condition for n-realizability. The second one shows that, for n≥(4k)³, an n-feasible sequence of length k isn-realizable if and only if it does not contain forbidden subsequences of elements smaller than n, a natural obstruction forn-realizability.     

Extension theorems for linear lattices with positive algebraic basis

An ordered linear spaceV with positive wedgeK is said to satisfy extension property (E1) if for every subspaceL ₀ ofV such thatL ₀ ∩K is reproducing inL ₀, and every monotone linear functionalf ₀ defined onL ₀,f ₀ has a monotone linear extension to all ofV. A linear latticeX is said to satisfy extension property (E2) if for every sublatticeL ofX, and every linear functionalf defined onL which is a lattice homomorphism,f has an extensionf′ to all ofX which is also a linear functional and a lattice homomorphism. In this paper it is shown that a linear lattice with a positive algebraic basis has both extension property (E1) and (E2). In obtaining this result it is shown that the linear span of a lattice idealL and an extremal element not inL is again a lattice ideal. (HereX does not have to have a positive algebraic basis.) It is also shown that a linear lattice which possesses property (E2) must be linearly and lattice isomorphic to a functional lattice. An example is given of a function lattice which has property (E2) but does not have a positive algebraic basis. Yudin [12] has shown a reproducing cone in ann-dimensional linear lattice to be the intersection of exactlyn half-spaces. Here it is shown that the positive wedge in ann-dimensional archimedean ordered linear space satisfying the Riesz decomposition property must be the intersection ofn half-spaces, and hence the space must be a linear lattice with a positive algebraic basis. The proof differs from those given for the linear lattice case in that it uses no special techniques, only well known results from the theory of ordered linear space.     

On friendly index sets of 2-regular graphs

Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:V→A induces an edge labeling f^∗:E→A defined by f^∗(xy)=f(x)+f(y). For i∈A, let v_f(i)=card{v∈V:f(v)=i} and e_f(i)=card{e∈E:f^∗(e)=i}. A labeling f is said to be A-friendly if |v_f(i)−v_f(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |e_f(i)−e_f(j)|≤1 for all (i,j)∈A×A. When A=Z₂, the friendly index set of the graph G is defined as {|e_f(1)−e_f(0)|:the vertex labelingf is Z₂-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4).