Applications of autoreproducing kernel grammian moduli to S (U,H)-valued stationary random functions

It is shown that the analytical characterizations of q-variate interpolable and minimal stationary processes obtained by H. Salehi (Ark. Mat., 7 (1967), 305–311; Ark. Mat., 8 (1968), 1–6; J. Math. Anal. Appl., 25 (1969), 653–662), and later by A. Weron (Studia Math., 49 (1974), 165–183), can be easily extended to Hilbert space valued stationary processes when using the two grammian moduli that respectively autoreproduce their correlation kernel and their spectral measure. Furthermore, for these processes, a Wold-Cramér concordance theorem is obtained that generalizes an earlier result established by H. Salehi and J. K. Scheidt (J. Multivar. Anal., 2 (1972), 307–331) and by A. Makagon and A. Weron (J. Multivar. Anal., 6 (1976), 123–137).     

A duality principle for lattices and categories of modules

Let R be a ring with 1, R^op the opposite ring, and R-Mod the category of left unitary R-modules and R-linear maps. A characterization of well-powered abelian categories $\text{A}$ such that there exists an exact embedding functor $\text{A}$→R-Mod is given. Using this characterization and abelian category duality, the following duality principles can be established.Theorem. There exists an exact embedding functor $\text{A}$→R-Mod if and only if there exists an exact embedding functor $\text{A}$^op→R^op-Mod.Corollary. If R-Mod has a specified diagram-chasing property, then R^op-Mod has the dual property.A lattice L is representable by R-modules if it is embeddable in the lattice of submodules of some unitary left R-module; $\text{L}$(R) denotes the quasivariety of all lattices representable by R-modules.Theorem. A lattice L is representable by R-modules if and only if its order dual L¹ is representable by R^op-modules. That is, $\text{L}\text{(}\text{R}{}^{\mathrm{op}}\text{)={L}{}^1\text{:L?}\text{L}\text{(}\text{R}\text{)}}$.If $\text{R}$ is a commutative ring with 1 and a specified diagram-chasing result is satisfied in R-Mod, then the dual result is also satisfied in R-Mod. Furthermore, $\text{L}\text{(}\text{R}\text{)}$ is self-dual: $\text{L}\text{(}\text{R}\text{)= {L}{}^1\text{:L?}\text{L}\text{(}\text{R}\text{)}.}$     

Matching relations and the dimensional structure of social choices

The concept of a matching relation M generalizes that of an equivalence, in a case in which the domain and range of M are not necessarily identical and may be disjoint. This paper analyzes the representation of any relation R by a union of matching relations. The interpretation of such representation is that a R d — the choice of some individual or object d by some individual a requires the coincidence of at least one value of the chosen and the chooser on some relevant factor. A general discussion of matching relations is given, and various results concerning the representation are presented.     

A topological property enjoyed by near points but not by large points

Let H denote the halfline [0,∞). A point p?βH?H is called a near point if p is in the closure of some countable discrete closed subspace of H. In addition, a point p?βH?H is called a large point if p is not in the closure of a closed subset of H of finite Lebesgue measure. We will show that for every autohomeomorphism ? of βH?H and for each near point p we have that ?(p) is not large. In addition, we establish, under CH, the existence of a point x?βH?H such that for each autohomeomorphism ? of βH?H the point ?(x) is neither large nor near.     

Linear equations over commutative rings

A generalized rank (McCoy rank) of a matrix with entries in a commutative ring R with identity is discussed. Some necessary and sufficient conditions for the solvability of the linear equation Ax = b are derived, where x, b are vectors and A is a matrix with entries in either a Noetherian full quotient ring or a zero dimensional ring.     

On the spectra of a family of positive matrices

It is shown that every positive matrix A can be embedded in an analytic family of positive matrices {A(ν) : ν∈$\text{R}$} in such a way that A(1)=A, $\text{A(0)≡}\text{A}\text{?}$ is symmetric, and A(-1)=A^T. A necessary and sufficient condition that A and Å have the same maximal eigenvalue and that their ergodic limits have the same diagonal elements is stated and proved.     

Positively regular homeomorphisms of Euclidean spaces

A homeomorphism of Rⁿ onto itself is called positively regular (or EC⁺) iff its family of non-negative iterates is pointwise equicontinuous. For EC⁺ homeomorphism of Rⁿ such that some point of Rⁿ has bounded positive semi-orbit, the nucleus M is defined, and the following theorems are proved.Theorem 1. If such a homeomorphism h:Rⁿ→Rⁿ has compact nucleus M, then M is a fully invariant compact AR. Further, for n≠4,5,h:Rⁿ/M→Rⁿ/M is conjugate to a contraction on Rⁿ.Theorem 2. In Rⁿ,n≠4,5,M compact iff there existsa disk D such that h(D)?IntD.Theorem 3. In R², either M is a disk and h|M is a rotation, or h|M is periodic. The relationship between M and the irregular set of ? is also studied.     

A generalization of finite dimensionality for modules

Let R be a ring with identity. Let C be a class of R-modules which is closed under submodules and isomorphic images. Define a submodule C of an R-module M to be a C-submodule of M if C ? C. An R-module M is said to be C-finite dimensional if it does not contain an infinite direct sum of non-zero C-submodules of M. Theorem: Let M be a C-finite dimensional R-module. Then there is a uniform bound (the C-dimension of M) on the number of non-zero C-submodules in a direct sum of submodules of M. When C = $\text{M}$_R, we recover the definition of dimension in the sense of Goldie. When C is the class of torsion-free modules relative to a kernel functor σ, we derive the formula: dim M = σ-dim M + dim (σ(M)) where for an R-module N, dim N is the dimension of N in the sense of Goldie and σ-dim N is the dimension of N relative to the class of σ-torsion- free modules. A special case gives a new interpretation of rank of a module as defined by Goldie.     

LU-decomposition of a matrix with entries of different kinds

Let F ? K be fields, and consider a matrix A over F whose entries not belonging to K are algebraically independent transcendentals over K. It is shown that if det $\text{A ε}\text{K}{}^1\text{( =}\text{K}\text{? {O})}$, the matrix A, with suitable permutations of its rows and columns, is decomposed into LU-factors with the entries of the U-factor belonging to K.     

Some inverse problems involving conditional expectations

Let (Ω, F, P) be a probability space, let H be a sub-σ-algebra of F, and let Y be positive and H-measurable with E[Y] = 1. We discuss the structure of the convex set CE(Y; H) = {X ∈ pF: Y = E[X|H]} of random variables whose conditional expectation given H is the prescribed Y. Several characterizations of extreme points of CE(Y; H) are obtained. A necessary and sufficient condition is given in order that CE(Y; H) be the closed, convex hull of its extreme points. For the case of finite F we explicitly calculate the extreme points of CE(Y; H), identify pairs of adjacent extreme points, and characterize extreme points of CE(Y; H) ? CE(Z; G), where G is a second sub-σ-algebra of F and Z ∈ pG. When H = σ(Y) and appropriate topological hypotheses hold, extreme points of CE(Y; H) are shown to be in explicit one-to-one correspondence with certain left inverses of Y. Finally, it is shown how the same approach can be applied to the problem of extremal random measures on $\text{R}$₊ with a prescribed compensator, to deduce that the number of extreme points is zero or one.     

Antichains in the set of subsets of a multiset

A set F of distinct subsets x of a finite multiset M (that is, a set with several different kinds of elements) is a c-antichain if for no c + 1 elements x₀, x₁, …, x_c of F does x₀ ? x₁ ? ··· ? x_c hold. The weight of F, wF, is the total number of elements of M in the various elements x of F. For given integers f and c, we find min wF, where the minimum is taken over all f-element c-antichains F. Daykin [9, 10] has solved this problem for ordinary sets and Clements [3] has solved it for multisets, but only for c = 1.     

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.     

A unique exchange property for bases

We define the concept of unique exchange on a sequence (X₁,…, X_m) of bases of a matroid M as an exchange of x ? X_i for y ? X_j such that y is the unique element of X_j which may be exchanged for x so that (X_i ? {x}) ∪ {y} and (X_j ? {y}) ∪ {x} are both bases. Two sequences X and Y are compatible if they are on the same multiset. Let UE(1) [UE(2)] denote the class of matroids such that every pair of compatible basis sequences X and Y are related by a sequence of unique exchanges [unique exchanges and permutations in the order of the bases]. We similarly define UE(3) by allowing unique subset exchanges. Then UE(1),UE(2), and UE(3) are hereditary classes (closed under minors) and are self-dual (closed under orthogonality). UE(1) equals the class of series-parallel networks, and UE(2) and UE(3) are contained in the class of binary matroids. We conjecture that UE(2) contains the class of unimodular matroids, and prove a related partial result for graphic matroids. We also study related classes of matroids satisfying transitive exchange, in order to gain information about excluded minors of UE(2) and UE(3). A number of unsolved problems are mentioned.     

Matricial logarithmic derivatives

If θ is a norm on Cⁿ, then the mapping $\text{A→}\text{lim}{}_{\mathrm{h\downarrow 0}}\text{6I+hA6}{}_{\mathrm{\theta }}\text{?1}\text{/h}$ from M_n(C) (=C^{n × n}) into R is called the logarithmic derivative induced by the vector norm θ. In this paper we generalize this concept to a mapping γ from M_n(C) into M_k(R), where k ? n. Denoting by α(B) the spectral abscissa of a square matrix B (the largest of the real parts of the eigenvalues), we show, in particular, that α(A) ?α(γ(A)). As a byproduct we obtain simple sufficient conditions for the stability of a matrix.     

Properties of Euclidean and non-Euclidean distance matrices

A distance matrix D of order n is symmetric with elements $\text{?}\text{1}\text{2}\text{d}{}_{\mathrm{ij}}{}^2$, where d_ii=0. D is Euclidean when the $\text{1}\text{2}\text{n(n?1)}$ quantities d_ij can be generated as the distances between a set of n points, X (n×p), in a Euclidean space of dimension p. The dimensionality of D is defined as the least value of p=rank(X) of any generating X; in general p+1 and p+2 are also acceptable but may include imaginary coordinates, even when D is Euclidean. Basic properties of Euclidean distance matrices are established; in particular, when ρ=rank(D) it is shown that, depending on whether e^TD^?e is not or is zero, the generating points lie in either p=ρ?1 dimensions, in which case they lie on a hypersphere, or in p=ρ?2 dimensions, in which case they do not. (The notation e is used for a vector all of whose values are one.) When D is non-Euclidean its dimensionality p=r+s will comprise r real and s imaginary columns of X, and (r, s) are invariant for all generating X of minimal rank. Higher-ranking representations can arise only from p+1=(r+1)+s or p+1=r+ (s+1) or p+2=(r+1)+(s+1), so that not only are r, s invariant, but they are both minimal for all admissible representations X.     

Inequalities for the product of the volumes of a partition determined in a convex body by a surface

A generalization is given of the work of J. Bokowski [1] referring to the product of the volumes of the two parts into which a convex body is divided by a plane. The proof uses formulas of Integral Geometry and a conjecture of L. A. Santaló [2], and holds for the two parts determined by any (n?1)-dimensional surface in the euclideann-space and for dimensionsn=2, 3 in the hyperbolic space.     

Computational Complexity over thep-adic Numbers

A model of computation over thep-adic numbers, for odd primesp, is defined following the approach of Blum, Shub, and Smale. This model employs branching on the property of being a square inQ_pand unit height. The feasibility of systems of quadratic polynomials is shown to be NP-complete in this model. A polynomial time algorithm is given for feasibility of a single quadratic polynomial overQ_p.     

On fuzzy metrizability

In this paper we answer two questions raised by M. A. Erceg [J. Math. Anal. Appl. 69 (1979), 205–230]: precisely we show that the fuzzy unit interval is never T₀ except in the standard case and that a fuzzy pseudo-metrizable T₀ space is metrizable in the sense of Erceg (ibid.); hence the two definitions of metrizable space given in B. Hutton and I. Reilly [Fuzzy Sets and Systems3 (1980), 93–104] and Erceg (ibid.) are equivalent.     

On Odd Symplectic Schur Functions

Proctor defined combinatorially a family of Laurent Polynomials, called odd symplectic Schur functions, indexed by pairs (λ, c), where λ is partition andcis a column length of λ. A conjecture of Proctor (Invent. Math.92,1988, 307–332) includes the statement that the odd symplectic Schur functions are actually characters ofSp(2n + 1, C). The purpose of the present note is to prove this.