Dimension and embedding theorems for geometric lattices

Let G be an n-dimensional geometric lattice. Suppose that 1 ? e, f ? n ? 1, e + f ? n, but e and f are not both n ? 1. Then, in general, there are E, F? G with dim E = e, dim F = f, E ? F = 1, and dim E ∧ F = e + f ? n ? 1; any exception can be embedded in an n-dimensional modular geometric lattice M in such a way that joins and dimensions agree in G and M, as do intersections of modular pairs, while each point and line of M is the intersection (in M) of the elements of G containing it.     

F-limit points in dynamical systems defined on the interval

Given a free ultrafilter p on ? we say that x ∈ [0, 1] is the p-limit point of a sequence (x _n ) _n∈? ? [0, 1] (in symbols, x = p -lim _n∈? x _n ) if for every neighbourhood V of x, {n ∈ ?: x _n ∈ V} ∈ p. For a function f: [0, 1] → [0, 1] the function f ^p : [0, 1] → [0, 1] is defined by f ^p (x) = p -lim _n∈? f ⁿ (x) for each x ∈ [0, 1]. This map is rarely continuous. In this note we study properties which are equivalent to the continuity of f ^p . For a filter F we also define the ω ^F -limit set of f at x. We consider a question about continuity of the multivalued map x → ω _f ^F (x). We point out some connections between the Baire class of f ^p and tame dynamical systems, and give some open problems.     

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.     

Newton Polygons of L Functions Associated with Exponential Sums of Polynomials of Degree Four over Finite Fields

Let F_q be the finite field of q elements with characteristic p and F_q^m its extension of degree m. Fix a nontrivial additive character Ψ of F_p. If f(x₁,…, x_n)∈F_q[x₁,…, x_n] is a polynomial, then one forms the exponential sum S_m(f)=∑_{(x1,…,xn)∈(Fq^m)ⁿ}Ψ(Tr_Fq^m/Fp(f(x₁,…,x_n))). The corresponding L functions are defined by L(f, t)=exp(∑^∞_m=0S_m(f)t^m/m). In this paper, we apply Dwork's method to determine the Newton polygon for the L function L(f(x), t) associated with one variable polynomial f(x) when deg f(x)=4. As an application, we also give an affirmative answer to Wan's conjecture for the case deg f(x)=4.     

Number of Zeros of Diagonal Polynomials over Finite Fields

Let F be a finite field with q=pf elements, where p is a prime. Let N be the number of solutions (x1,…,xn) of the equation c1xd11+···+cnxdnn=c over the finite fields, where d1∣q−1, ciϵF*(i=1, 2,…,n), and cϵF. In this paper, we prove that if b1 is the least integer such that b1≥∑ni=1 (f/ri) (Di, p−1)/(p−1), then q[b1/f]−1∣N, where ri is the least integer such that di∣pri−1, Didi=pri−1, the (Di, p−1) denotes the greatest common divisor of Di and p−1, [b1/f] denotes the integer part of b1/f. If di=d, then this result is an improvement of the theorem that pb∣N, where b is an integer less than n/d, obtained by J. Ax (1969, Amer. J. Math.86, 255–261) and D. Wan (1988, Proc. AMS103, 1049–1052), under a certain natural restriction on d and n.     

An Erdös-Ko-Rado theorem for the subcubes of a cube

LetP be that partially ordered set whose elements are vectors x=(x ₁, ...,x _n ) withx _i ε {0, ...,k} (i=1, ...,n) and in which the order is given byx≦y iffx _i =y _i orx _i =0 for alli. LetN _i (P)={x εP : |{j:x _j ≠ 0}|=i}. A subsetF ofP is called an Erdös-Ko-Rado family, if for allx, y εF it holdsx ≮y, x ≯ y, and there exists az εN ₁(P) such thatz≦x andz≦y. Let ? be the set of all vectorsf=(f ₀, ...,f _n ) for which there is an Erdös-Ko-Rado familyF inP such that |N _i (P) ∩F|=f _i (i=0, ...,n) and let 〈?〉 be its convex closure in the (n+1)-dimensional Euclidean space. It is proved that fork≧2 (0, ..., 0) and \(\left( {0,...,0,\overbrace {i - component}^{\left( {\begin{array}{*{20}c} {n - 1} \\ {i - 1} \\ \end{array} } \right)}k^{i - 1} ,0,...,0} \right)\) (i=1, ...,n) are the vertices of 〈?〉.     

On number system constructions

We investigate various number system constructions. After summarizing earlier results we prove that for a given lattice Λ and expansive matrix M: Λ → Λ if ρ(M ⁻¹) < 1/2 then there always exists a suitable digit set D for which (Λ, M, D) is a number system. Here ρ means the spectral radius of M ⁻¹. We shall prove further that if the polynomial f(x) = c ₀ + c ₁ x + ··· + c _k x ^k ∈ Z[x], c _k = 1 satisfies the condition |c ₀| > 2 Σ _i=1 ^k |c _i | then there is a suitable digit set D for which (Z ^k , M, D) is a number system, where M is the companion matrix of f(x). The research was supported by OTKA-T043657 and Bolyai Fellowship Committee.     

A Characterization of the free n-generated MV-algebra

An MV-algebra A=(A,0,¬,⊕) is an abelian monoid (A,0,⊕) equipped with a unary operation ¬ such that ¬¬x=x,x⊕¬0=¬0, and y⊕¬(y⊕¬x)=x⊕¬(x⊕¬y). Chang proved that the equational class of MV-algebras is generated by the real unit interval [0,1] equipped with the operations ¬x=1?x and x⊕y=min(1,x+y). Therefore, the free n-generated MV-algebra Free _n is the algebra of [0,1]-valued functions over the n-cube [0,1] ⁿ generated by the coordinate functions ξ _i ,i=1, . . . ,n, with pointwise operations. Any such function f is a McNaughton function, i.e., f is continuous, piecewise linear, and each piece has integer coefficients. Conversely, McNaughton proved that all McNaughton functions f: [0,1] ⁿ →[0,1] are in Free _n . The elements of Free _n are logical equivalence classes of n-variable formulas in the infinite-valued calculus of ?ukasiewicz. The aim of this paper is to provide an alternative, representation-free, characterization of Free _n .     

Non-L 1 functions with rotation sets of Hausdorff dimension one

Suppose that f: ? → ? is a given measurable function, periodic by 1. For an α ∈ ? put M _n ^α f(x) = 1/n+1 Σ _k=0 ⁿ f(x + kα). Let Γ _f denote the set of those α’s in (0;1) for which M _n ^α f(x) converges for almost every x ∈ ?. We call Γ _f the rotation set of f. We proved earlier that from |Γ _f | > 0 it follows that f is integrable on [0; 1], and hence, by Birkhoff’s Ergodic Theorem all α ∈ [0; 1] belongs to Γ _f . However, Γ _f \? can be dense (even c-dense) for non-L ¹ functions as well. In this paper we show that there are non-L ¹ functions for which Γ _f is of Hausdorff dimension one.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

An embedding theorem for partial algebras and the free completion of a free partial algebra within a primitive class

Let U be any nontrivial primitive class of partial algebras, i.e. there existsA ∈ U with |A|≥2, and U is closed with respect to homomorphic images (in the weak sense), subalgebras (on closed subsets) and cartesian products of U-algebras, and let U _f denote the—also nontrivial and primitive—class of all full U-algebras. Then every U-algebra with at least two elements is a relative algebra of some U _f -algebra. For any U-algebraAsetU _A =U _i εI({i}×(A ^K _i—domf _i ^A )), where (K _i) _i εI is the type under consideration. Furthermore let F(N, U) denote any U-algebra U-freely generated by some setN (and let F (M, U _f ) be similarly defined). Then for every nonempty setM there exists a setN satisfyingM ?N such that there exists a bijective mapping σ:U _{F(N, U)} →N ?M satisfying σ((i, α)) ? α(K _i ) for all (i, α) ∈U _{F (N, U)}, and, for the structureg=(g _i)_iεI defined by ,g _i : =f _i ^{F(N, U)} ∪ {(α, σ((i, α))) | (i, α ∈U _{F(N, U)}} id _M induces an isomorphism betweenF(M, U _f ), and (F(N, U)g).     

A global genericity theorem for bifurcations in variational problems

Let C be a Banach space, H a Hilbert space, and let F(C,H) be the space of C^∞ functions f: C × H → R having Fredholm second derivative with respect to x at each (c, x) ?C × H for which $\text{D?}{}_{\mathrm{c}}\text{(x) = 0}$; here we write $\text{?}{}_{\mathrm{c}}\text{(x)}$ for $\text{?(c, x)}$. Say ? is of standard type if at all critical points of ?_c it is locally equivalent (as an unfolding) to a quadratic form Q plus an elementary catastrophe on the kernel of Q. It is proved that if f?F (A × B, H) satisfies a certain ‘general position’ condition, and dim B ? 5, then for most a?A the function f_o?F(B,H) is of standard type. Using this it is shown that those f?F(B,H) of standard type form an open dense set in F(B,H) with the Whitney topology. Thus both results are Hilbert-space versions of Thom's theorem for catastrophes in $\text{R}$ⁿ.     

Univariate multiquadric approximation: Quasi-interpolation to scattered data

The univariate multiquadric function with centerx _j ∈R has the form {? _j (x)=[(x?x _j )²+c ²]^1/2, x∈R} wherec is a positive constant. We consider three approximations, namely, ? _A f, ?_? f, and ? _C f, to a function {f(x),x ₀≤x≤x _N } from the space that is spanned by the multiquadrics {? _j :j=0, 1, ...,N} and by linear polynomials, the centers {x _j :j=0, 1,...,N} being given distinct points of the interval [x ₀,x _N ]. The coefficients of ? _A f and ?_? f depend just on the function values {f(x _j ):j=0, 1,...,N}. while ? _A f, ? _C f also depends on the extreme derivativesf′(x ₀) andf′(x _N ). These approximations are defined by quasi-interpolation formulas that are shown to give good accuracy even if the distribution of the centers in [x ₀,x _N ] is very irregular. Whenf is smooth andc=O(h), whereh is the maximum distance between adjacent centers, we find that the error of each quasi-interpolant isO(h ²|logh|) away from the ends of the rangex ₀≤x≤x _N. Near the ends of the range, however, the accuracy of ? _A f and ?_? f is onlyO(h), because the polynomial terms of these approximations are zero and a constant, respectively. Thus, some of the known accuracy properties of quasiinterpolation when there is an infinite regular grid of centers {x _j =jh:j ∈F} given by Buhmann (1988), are preserved in the case of a finite rangex ₀≤x≤x _N , and there is no need for the centers {x _j :j=0, 1, ...,N} to be equally spaced.     

Additive operators preserving rank-additivity on symmetry matrix spaces

We characterize the additive operators preserving rank-additivity on symmetry matrix spaces. LetS _n(F) be the space of alln×n symmetry matrices over a fieldF with 2,3 ∈F ^*, thenT is an additive injective operator preserving rank-additivity onS _n(F) if and only if there exists an invertible matrixU∈M _n(F) and an injective field homomorphism ? ofF to itself such thatT(X)=cUX ^?U^T, ?X=(x_ij)∈S_n(F) wherec∈F ^*,X ^?=(?(x _ij)). As applications, we determine the additive operators preserving minus-order onS _n(F) over the fieldF.     

Scalar polynomial functions on the n×n matrices over a finite field

Let F=GF(q) denote the finite field of order q, and let $\text{?(x)?F[x]}$. Then f(x) defines, via substitution, a function from F_n×n, the n×n matrices over F, to itself. Any function $\text{?:F}{}_{\mathrm{n\times n}}\text{→ F}{}_{\mathrm{n\times n}}$ which can be represented by a polynomialf(x)?F[x] is called a scalar polynomial function on F_n×n. After first determining the number of scalar polynomial functions on F_n×n, the authors find necessary and sufficient conditions on a polynomial $\text{?(x) ? F[x]}$ in order that it defines a permutation of (i) $\text{D}$_n, the diagonalizable matrices in F_n×n, (ii)$\text{R}$_n, the matrices in F_n×n all of whose roots are in F, and (iii) the matric ring F_n×n itself. The results for (i) and (ii) are valid for an arbitrary field F.     

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.     

Uniqueness properties in finite-continuous additive measurement

Let ? be a binary relation on A×X, and suppose that there are real valued functions f on A and g on X such that, for all ax, by ∈ A×X, ax ? by if and only if f (a)+g(x) ? f(b)+g(y). This paper establishes uniqueness properties for f and g when A is a finite set, X is a real interval with g increasing on X, and for any a, b and x there is a y for which f(a)+g(x)=f(b)+g(y). The resultant uniqueness properties occupy an intermediate position among uniqueness properties for other structural cases of two-factor additive measurement.It is shown that f is unique up to a positive affine transformation (αf+β₁ with α > 0), but that g is unique up to a similar positive affine transformation (αg+β₂) if and only if the ratio [f(a)?f(b)]/[f(a)?f(c)] is irrational for some a, b, c ∈ A. When the f ratios are rational for all cases where they are defined, there will be a half-open interval (x₀, x₁) in X such that the restriction of g on (x₀, x₁) can be any increasing function for which sup {g(x)?g(x₀): x₀ ? x < x₁} does not exceed a specified bound, and, when g is thus defines on (x₀, x₁), it will be uniquely determined on the rest of X. In general, g must be continuous only in the ‘irrational’ case.     

Optimum designs when the observations are second-order processes

Let the process {Y(x,t) : t?T} be observable for each x in some compact set X. Assume that Y(x, t) = θ₀f₀(x)(t) + … + θ_kf_k(x)(t) + N(t) where f_i are continuous functions from X into the reproducing kernel Hilbert space H of the mean zero random process N. The optimum designs are characterized by an Elfving's theorem with $\text{R}$ the closed convex hull of the set {(φ, f(x))_H : 6φ 6_H ≤ 1, x?X}, where (·, ·)_H is the inner product on H. It is shown that if X is convex and f_i are linear the design points may be chosen from the extreme points of X. In some problems each linear functional c′θ can be optimally estimated by a design on one point x(c). These problems are completely characterized. An example is worked and some partial results on minimax designs are obtained.