Minimum Cutsets for an Element of a Subspace Lattice over a Finite Vector Space

Let L_n(q) denote the lattice of subspaces of ann-dimensional vector space over the finite field of q elements, ordered byinclusion. In this note, we prove that for all n and m the minimum cutsetfor an element A with is justL(A) if m < n/ 2, is U(A) if m > n/ 2, and both L(A) andU(A) if m = n/ 2, where L(A) is the collection of all such that and , and U(A) the collection of all such that and . Hence a finite vector space analog isgiven for the theorem of Griggs and Kleitman that determines all the minimumcutsets for an element of a Boolean algebra.     

The Dimension of Neighboring Levels of the Boolean Lattice

The order dimension of suborders of the Boolean lattice is considered. It is shown that the suborder of consisting of levels s and s+1 has dimension O(\log n/log log n). This improves a bound in [1].     

Dimensions of Split Semiorders

A poset P=(X,P) is a split semiorder when there exists a function I thatassigns to each x X a closed interval of the real line R and a set of real numbers, with , suchthat x<y in P if and only if and in R. Every semiorder is a split semiorder, and thereare split semiorders which are not interval orders. It is well known thatthe dimension of a semiorder is at most 3. We prove that the dimension of asplit semiorder is at most 6. We note also that some split semiorders havesemiorder dimension at least 3, and that every split semiorder has intervaldimension at most 2.     

Limiting Laws for Entrance Times of Critical Mappings of a Circle

A renormalization group transformation R ₁ has a single stable point in the space of the analytic circle homeomorphisms with a single cubic critical point and with the rotation number (the golden mean). Let a homeomorphism T be the C ¹-conjugate of . We let denote the sequence of distribution functions of the time of the kth entrance to the nth renormalization interval for the homeomorphism T. We prove that for any , the sequence has a finite limiting distribution function , which is continuous in , and singular on the interval [0,1]. We also study the sequence for k>1.     

Zonotopal Subdivisions of Cyclic Zonotopes

The cyclic zonotope (n, d) is the zonotope in ^d generated by any n distinct vectors of the form (1, t, t ²,..., t ^d–1). It is proved that the refinement poset of all proper zonotopal subdivisions of (n, d) which are induced by the canonical projection : (n, d) (n, d), in the sense of Billera and Sturmfels, is homotopy equivalent to a sphere and that any zonotopal subdivision of (n, d) is shellable. The first statement gives an affirmative answer to the generalized Baues problem in a new special case and refines a theorem of Sturmfels and Ziegler on the extension space of an alternating oriented matroid. An important ingredient in the proofs is the fact that all zonotopal subdivisions of (n, d) are stackable in a suitable direction. It is shown that, in general, a zonotopal subdivision is stackable in a given direction if and only if a certain associated oriented matroid program is Euclidean, in the sense of Edmonds and Mandel.     

Auxiliary Problem Principle and Proximal Point Methods

An extension of the auxiliary problem principle to variational inequalities with non-symmetric multi-valued operators in Hilbert spaces is studied. This extension concerns the case that the operator is split into the sum of a single-valued operator , possessing a kind of pseudo Dunn property, and a maximal monotone operator . The current auxiliary problem is k constructed by fixing at the previous iterate, whereas (or its single-valued approximation ^k) k is considered at a variable point. Using auxiliary operators of the form ^k+ , with _k>0, the standard for the auxiliary problem principle assumption of the strong convexity of the function h can be weakened exploiting mutual properties of and h. Convergence of the general scheme is analyzed and some applications are sketched briefly.     

The Spectrum of the C*-Algebra of Pseudodifferential Boundary Value Problems on a Manifold with Smooth Edges

The C ^*-algebra generated by the operators of pseudodifferential boundary value problems on a manifold with smooth closed disjoint edges and boundary is studied. The operators act in the space L ₂( ) L ₂( ). The goal of this paper is to describe all (up to an equivalence) irreducible representations of the algebra Bibliography: 12 titles.     

Transversal Twistor Spaces of Foliations

The transversal twistor space of a foliation of an even codimension is the bundle of the complex structures of the fibers of the transversalbundle of . On there exists a foliation by covering spaces of the leaves of , and any Bottconnection of produces an ordered pair of transversal almost complex structures of . The existence of a Bott connection which yields a structure ₁ that is projectable to the space of leaves isequivalent to the fact that is a transversallyprojective foliation. A Bott connection which yields a projectablestructure ₂ exists iff isa transversally projective foliation which satisfies a supplementarycohomological condition, and, in this case, ₁is projectable as well. ₂ is never integrable.The essential integrability condition of ₁ isthe flatness of the transversal projective structure of .     

Lattice Ordered Polynomial Algebras

In this paper we define a lattice order on a set F of binary functions. We then provide necessary and sufficient conditions for the resulting algebra F to be a distributive lattice or a Boolean algebra. We also prove a Cayley theorem for distributive lattices by showing that for every distributive lattice , there is an algebra F of binary functions, such that is isomorphic to F and we show that F is a distributive lattice iff the operations and are idempotent and cummutative, showing that this result cannot be generalized to non-distributive lattices or quasilattices without changing the definitions of and . We also examine the equational properties of an Algebra for which , now defined on the set of binary -polynomials is a lattice or Boolean algebra.     

A Note on Extremes of Concomitants of Order Statistics

Let be a sequence of identically distributed variables. We study the asymptotic distribution of , where Y _[r:n] denotes the concomitant of the rth order statistic X _r:n , corresponding to , and is held fixed while . Conditions are given for the and to have the same asymptotic behavior as that we would apply if were i.i.d. The result is illustrated with a simple linear regression model , where is a stationary sequence with extremal index .     

Divergence of a Random Walk Through Deterministic and Random Subsequences

Let {S _n} _n0 be a random walk on the line. We give criteria for the existence of a nonrandom sequence n _i for which respectively We thereby obtain conditions for to be a strong limit point of {S _n} or {S _n /n}. The first of these properties is shown to be equivalent to for some sequence a _i , where T(a) is the exit time from the interval [–a,a]. We also obtain a general equivalence between and for an increasing function fand suitable sequences n _i and a _i. These sorts of properties are of interest in sequential analysis. Known conditions for and (divergence through the whole sequence n) are also simplified.     

A Higher-Order Analog of the Linking Number for a Pair of Divergence-Free Vector Fields

Pairs B, of divergence-free vector fields with compact support in are considered higher-order analog M(B, c (of order 3) of the Gauss helicity number H(B, )= , curl(A)=B; (of order 1) is constructed, which is invariant under volume-preserving diffeomorphisms. An integral expression for M is given. A degree-four polynomial m(B(x₁), B(x₂), ( ₁), ( ₂)), x₁, x₂, _{1 2} , is defined, which is symmetric in the first and second pairs of variables separately. M is the average value of m over arbitrary configurations of points. Several conjectures clarifying the geometric meaning of the invariant and relating it to invariants of knots and links are stated. Bibliography: 11 titles.     

The All-Paths Transit Function of a Graph

A transit function R on a set V is a function satisfying the axioms and , for all . The all-paths transit function of a connected graph is characterized by transit axioms.     

Determinants of Matrices Associated with Incidence Functions on Posets

Let S = x ₁,...,x _n} be a finite subset of a partially ordered set P. Let f be an incidence function of P. Let denote the n × n matrix having f evaluated at the meet of x _i and x _j as its i, j-entry and denote the n × n matrix having f evaluated at the join of x _i and x _j as its i, j-entry. The set S is said to be meet-closed if for all 1 i, j n. In this paper we get explicit combinatorial formulas for the determinants of matrices and on any meet-closed set S. We also obtain necessary and sufficient conditions for the matrices and on any meet-closed set S to be nonsingular. Finally, we give some number-theoretic applications.     

Quotient Groups of Groups of Certain Classes

For an arbitrary variety of groups and an arbitrary class of groups that is closed on quotient groups, we prove that a quotient group G/N of the group G possesses an invariant system with - and -factors (respectively, is a residually -group) if G possesses an invariant system with - and -factors (respectively, is a residually -group) and N (respectively, N is a maximal invariant -subgroup of the group G).     

On intervals and isometries of MV-algebras

Let Int be the lattice of all intervals of an MV-algebra . In the present paper we investigate the relations between direct product decompositions of and (i) the lattice Int , or (ii) 2-periodic isometries on , respectively.     

Simple Inductive Proofs of the Fishburn and Mirkin Theorem and the Scott–Suppes Theorem

This paper presents new proofs of two classic characterization theorems for families of ordered sets. The first is that any finite poset with no restriction isomorphic to has an interval representation. The second is that any finite poset with no restriction isomorphic to or to has a unit interval representation. Both proofs are straightforward and inductive.     

Some Combinatorial Properties of Schubert Polynomials

Schubert polynomials were introduced by Bernstein et al. and Demazure, and were extensively developed by Lascoux, Schützenberger, Macdonald, and others. We give an explicit combinatorial interpretation of the Schubert polynomial in terms of the reduced decompositions of the permutation w. Using this result, a variation of Schensted's correspondence due to Edelman and Greene allows one to associate in a natural way a certain set of tableaux with w, each tableau contributing a single term to . This correspondence leads to many problems and conjectures, whose interrelation is investigated. In Section 2 we consider permutations with no decreasing subsequence of length three (or 321-avoiding permutations). We show for such permutations that is a flag skew Schur function. In Section 3 we use this result to obtain some interesting properties of the rational function , where denotes a skew Schur function.Sara C. Billey: Supported by the National Physical Science Consortium. William Jockusch: Supported by an NSF Graduate Fellowship. Richard P. Stanley: Partially supported by NSF grants DMS-8901834 and DMS-9206374     

On the Asymptotic Behaviour of General Partition Functions,II

Let = {a ₁, a ₂,...} be a set of positive integers and let p (n) and q (n) denote the number of partitions of n into a's, resp. distinct a's. In an earlier paper the authors studied large values of log(max (2,p (n)))/log(max(2,q (n))). In this paper the small values of the same quotient are studied.