Simple homotopy types and finite spaces

We present a new approach to simple homotopy theory of polyhedra using finite topological spaces. We define the concept of collapse of a finite space and prove that this new notion corresponds exactly to the concept of a simplicial collapse. More precisely, we show that a collapse X↘Y of finite spaces induces a simplicial collapse K(X)↘K(Y) of their associated simplicial complexes. Moreover, a simplicial collapse K↘L induces a collapse X(K)↘X(L) of the associated finite spaces. This establishes a one-to-one correspondence between simple homotopy types of finite simplicial complexes and simple equivalence classes of finite spaces. We also prove a similar result for maps: We give a complete characterization of the class of maps between finite spaces which induce simple homotopy equivalences between the associated polyhedra. This class describes all maps coming from simple homotopy equivalences at the level of complexes. The advantage of this theory is that the elementary move of finite spaces is much simpler than the elementary move of simplicial complexes: It consists of removing (or adding) just a single point of the space.     

Bubble finite elements for the primitive equations of the ocean

We introduce in this paper two original Mixed methods for the numerical resolution of the (stationary) Primitive Equations (PE) of the Ocean. The PE govern the behavior of oceanic flows in shallow domains for large time scales. We use a reduced formulation (Lions et al. [28]) involving horizontal velocities and surface pressures. By using bubble functions constructed ad-hoc, we are able to define two stable Mixed Methods requiring a low number of degrees of freedom. The first one is based on the addition of bubbles of reduced support to velocities elementwise. The second one makes use of conic bubbles of extended support along the vertical coordinate. The latter constitutes a genuine mini-element for the PE, e.g., it requires the least number of extra degrees of freedom to stabilize piecewise linear hydrostatic pressures. Both methods verify a specific inf-sup condition and provide stability and convergence. Finally, we compare several numerical features of the proposed pairs in the context of other FE methods found in the literature.     

Plain ditopological texture spaces

Using the characterization of plain textures in terms of posets given by Mustafa Demirci (M. Demirci, Textures and C-spaces, Fuzzy Sets and Systems 158 (11) (2007) 1237-1245), the authors consider the important class of plain ditopological texture spaces and give several new results.     

Stability of Hodge decompositions in finite element spaces of differential forms in arbitrary dimension

We elaborate on the interpretation of some mixed finite element spaces in terms of differential forms. In particular we define regularization operators which, combined with the standard interpolators, enable us to prove discrete Poincaré–Friedrichs inequalities and discrete Rellich compactness for finite element spaces of differential forms of arbitrary degree on compact manifolds of arbitrary dimension.     

Regressions and monotone chains: A ramsey-type extremal problem for partial orders

Aregression is a functiong from a partially ordered set to itself such thatg(x)≦x for allz. Amonotone k-chain is a chain ofk elementsx ₁<x ₂ <...<x _k such thatg(x ₁)≦g(x ₂)≦...≦g(x _k ). If a partial order has sufficiently many elements compared to the size of its largest antichain, every regression on it will have a monotone (k + 1)-chain. Fixingw, letf(w, k) be the smallest number such that every regression on every partial order with size leastf(w, k) but no antichain larger thanw has a monotone (k + 1)-chain. We show thatf(w, k)=(w+1) ^k . Dedicated to Paul Erdős on his seventieth birthday Research supported in part by the National Science Foundation under ISP-80-11451.     

Two combinatorial problems on posets

Bialostocki proposed the following problem: Let nk2 be integers such that k|n. Let p(n, k) denote the least positive integer having the property that for every poset P, |P|p(n, k) and every Z _k -coloring f: P Z _k there exists either a chain or an antichain A, |A|=n and _aA f(a) 0 (modk). Estimate p(n, k). We prove that there exists a constant c(k), depends only on k, such that (n+k–2)²–c(k) p(n, k) (n+k–2)²+1. Another problem considered here is a 2-dimensional form of the monotone sequence theorem of Erdös and Szekeres. We prove that there exists a least positive integer f(n) such that every integral square matrix A of order f(n) contains a square submatrix B of order n, with all rows monotone sequences in the same direction and all columns monotone sequences in the same direction (direction means increasing or decreasing).     

Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas

Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this multivariate series identity and two formulas of Lucas. Finally we give a combinatorial proof of Lucas’ formulas.     

Canonization theorems for finite affine and linear spaces

In this paper we prove a canonical (i.e. unrestricted) version of the Graham—Leeb—Rothschild partition theorem for finite affine and linear spaces [3]. We also mention some other kind of canonization results for finite affine and linear spaces.     

Reproducing kernels for Hardy spaces on multiply connected domains

Associated with a boundedg-holed (g0) planar domainD are two types of reproducing kernel Hilbert spaces of meromorphic functions onD. We give explicit formulas for the reproducing kernel functions of these spaces. The formulas are in terms of theta functions defined on the Jacobian variety of the Schottky double of the regionD. As applications we settle a conjecture of Abrahamse concerning Nevalinna-Pick interpolation on an annulus and obtain explicit formulas for the curvature (in the sense of Cowen and Douglas) of rank 1 bundle shift operators.     

Intrinsic approach spaces on domains

The paper is a contribution to quantifiability of domains. We show that every domain X, regardless of cardinality conditions for a domain bases, is quantifiable in the sense that there exists an approach structure on X (Lowen (1997) [9]), defined by means of a gauge of quasi metrics, inducing the Scott topology. We get weightability for free and in the case of an algebraic domain satisfying the Lawson condition (Lawson (1997) [8]), a quantifying approach space can be obtained with a weight satisfying the kernel condition.     

New results from an algorithm for counting posets

In this paper we report on the success of a new technique for computing the number of unlabeled partial orders on n elements based on the partial order of partial orders ordered by containment. In addition to the number of partial orders, we obtain complete enumerations of the number of partial orders on n elements with r relations for n<-11, where r takes on all possible values. We point out some interesting sequences that arise in these tables.Supported by Natural Sciences and Engineering Research Council Grant No. OGP8053.     

Finite posets and topological spaces in locally finite varieties

We prove that if a finite connected poset admits an order-preserving Taylor operation, then all of its homotopy groups are trivial. We use this to give new characterisations of locally finite varieties omitting type 1 in terms of the posets (or equivalently, finite topological spaces) in the variety. Similar variants of other omitting-type theorems are presented. We give several examples of posets that admit various types of Taylor operations; in particular, we exhibit a topological space which is not an H-space but is compatible with a set of non-trivial identities, answering a question of W. Taylor.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived September 18, 2002; accepted in final form March 19, 2003.     

Decompositions of partially ordered sets into chains and antichains of given size

Every partially ordered set P on at least (1+o(1))n ³ elements can be decomposed into subposets of size n that are almost chains or antichains. This lower bound on P is asymptotically best possible. Similar results are presented for other types of combinatorial structures.Research supported in part by the AKA Research Fund of the Hungarian Academy of Sciences, grant 1-3-86-264.     

Continuous interior penalty finite element method for the time-dependent Navier–Stokes equations: space discretization and convergence

This paper focuses on the numerical analysis of a finite element method with stabilization for the unsteady incompressible Navier–Stokes equations. Incompressibility and convective effects are both stabilized adding an interior penalty term giving L ²-control of the jump of the gradient of the approximate solution over the internal faces. Using continuous equal-order finite elements for both velocities and pressures, in a space semi-discretized formulation, we prove convergence of the approximate solution. The error estimates hold irrespective of the Reynolds number, and hence also for the incompressible Euler equations, provided the exact solution is smooth.     

Cap pairings and spectral sequences

Let be a small category. For an -diagram X and -diagrams A and B of pointed spaces, each pairing X∧A→B satisfying the projection formula induces a pairing . In this note we show that there is an induced pairing of homotopy spectral sequences compatible with abutments in the sense that

     

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

LetP be a finite partially ordered set. The lengthl(x) of an elementx ofP is defined by the maximal number of elements, which lie in a chain withx at the top, reduced by one. Letw(P) (d(P)) be the maximal number of elements ofP which have the same length (which form an antichain). Further let . The numbers and as well as all partially ordered sets for which these maxima are attained are determined.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

A separation theorem for semicontinuous functions on preordered topological spaces

Suppose that X is a topological space with preorder , and that –g, f are bounded upper semicontinuous functions on X such that g(x) f(y) whenever x y. We consider the question whether there exists a bounded increasing continuous function h on X such that g h f, and obtain an existence theorem that gives necessary and sufficient conditions. This result leads to an extension theorem giving conditions that allow a bounded increasing continuous function defined on an open subset of X to be extended to a function of the same type on X. The application of these results to extremally disconnected locally compact spaces is studied.Received: 26 May 2004     

General lexicographic shellability and orbit arrangements

We introduce a new poset property which we call EC-shellability. It is more general than the more established concept of EL-shellability, but it still implies shellability. Because of Theorem 3.10, EC-shellability is entitled to be called general lexicographic shellability. As an application of our new concept, we prove that intersection lattices Π_λ of orbit arrangementsA _λ are EC-shellable for a very large class of partitions λ. This allows us to compute the topology of the link and the complement for these arrangements. In particular, for this class of λs, we are able to settle a conjecture of Björner [B94, Conjecture 13.3.2], stating that the cohomology groups of the complement of the orbit arrangements are torsion-free. We also present a class of partitions for which Π_λ is not shellable, along with other issues scattered throughout the paper.