Counting Split Interval Orders

A poset (X,) is a split interval order (a.k.a. unit bitolerance order, proper bitolerance order) if a real interval and a distinguished point in that interval can be assigned to each xX so that xy precisely when x's distinguished point precedes y's interval, and x's interval precedes y's distinguished point. For each |X|9, we count the split interval orders and identify all posets that are minimal forbidden posets for split interval orders. The paper is a companion to Counting Split Semiorders by Fishburn and Reeds (this issue).     

On Jump-Critical Posets with Jump-Number Equal to Width

We investigate the structure of m-jump-critical posets P with w(P) = m. We prove that the size of such posets satisfies |P| 3m ². For the special when the maximum antichain occurs as the maximal (or minimal) elements, we have the sharp upper bound |P| 3m - k; where k = min {|{Max}(P)|, |{Min}(P)|}. We give examples of posets which illustrate the explored structure of these m-jump-critical posets P with width m.     

On the zetafunction of an arithmetical semigroup

The Zetafunction Z of an additive, multiplicative arithmetical semigroup is a power series with radius of convergence (01), a Dirichlet series with abscissa of convergence (0), respectively.Conditions are given which ensure that >0 and Z()=,< and Z()= hold true, respectively. Jürgen Neukirch zum Gedächtnis Mathematics Subject Classification (2000):11N45, 05A16.     

Conditions for non-oscillation of singular linear differential equations of second order

Conditions are found in the fulfillment of which each non-trivial solution of the equation u+ (t)u+(t)u=0, where(t) L(a, b) and (t–a)(t–b)(t) L(a, b) has not more than one zero on the interval atb.Translated from Matematicheskie Zametki, Vol. 6, No. 5, pp. 633–639, November, 1969.     

Interrelations between the Length, the Structure and the Cardinality of a Chain

Let (Z,) be a chain and let (Z,) be its dual chain. Then the length l(Z) of (Z,) is the least upper bound of all cardinal numbers which can be order-embedded into (Z,) or (Z,). In particular, a chain is said to be short if its length is not greater than the smallest infinite cardinal. In this paper we shall prove that the cardinality |Z| of a chain (Z,) cannot be smaller than l(Z) and not greater than 2 ^l(Z). The inequality |Z|2 ^l(Z) is an immediate consequence of a general theorem which combines the structure of a chain with its length. In case of a short chain it follows that its structure may be rather complicated but that its cardinality cannot be greater than the cardinality of the real line.     

Optimal relaxation parameter for the Uzawa Method

Summary. We consider the Uzawa method to solve the stationary Stokes equations discretized with stable finite elements. An iteration step consists of a velocity update uⁿ⁺¹ involving the (augmented Lagrangian) operator ––÷ with 0, followed by the pressure update pⁿ⁺¹=pⁿ–div uⁿ⁺¹, the so-called Richardson update. We prove that the inf-sup constant satisfies 1 and that, if =1+^–1, the iteration converges linearly with a contraction factor ^2-1(2-) provided 0<<2. This yields the optimal value = regardless of .Mathematics Subject Classification (1991): 65N12, 65N15Partially supported by NSF Grant DMS-9971450Partially supported by NSF Grants DMS-9971450 and DMS-0204670Revised version received September 30, 2003     

Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices

A poset P is -conditionally complete ( a cardinal) if every set X P all of whose subsets of cardinality < have an upper bound has a least upper bound. For we characterize the subposets of a -complete poset which can occur as the set of fixed points of some montonic function on P. This yields a generalization of Tarski's fixed point theorem. We also show that for every the class of -conditionally complete posets forms an order variety and we exhibit a simple generating poset for each such class.Research supported in part by NSERC while the author was visiting Professor Ivo Rosenberg at the Université de Montreal.Research supported in part by NSF-grant DMS-8703743.     

Improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set

We will establish the following improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set: For each k and d, 0 k d, define f(d,k) = d+1 if k = 0 and f(d,k) = max{d+1,2d–2k+2} if 1 k d.Theorem 1. Let S be a compact, connected, locally starshaped set in R^d, S not convex. Then for a k with 0 k d, dim ker S k if and only if every f(d, k) lnc points of S are clearly visible from a common k-dimensional subset of S.Theorem 2. Let S be a nonempty compact set in R^d. Then for a k with 0 k d, dim ker S k if and only if every f (d, k) boundary points of S are clearly visible from a common k-dimensional subset of S. In each case, the number f(d, k) is best possible for every d and k.     

Counting Split Semiorders

A poset P=(X,) is a split semiorder if a unit interval and a distinguished point in that interval can be assigned to each xX so that xy precisely when x's distinguished point precedes y's interval, and y's distinguished point follows x's interval. For each |X|10, we count the split semiorders and identify all posets that are minimal forbidden posets for split semiorders.     

Sur une conjecture de Mukai

Résumé Généralisant une question de Mukai, nous conjecturons quune variété de Fano X de nombre de Picard _X et de pseudo-indice _X vérifie $ _X ( _X - 1) dim(X). Nous démontrons cette conjecture dans plusieurs situations: X est une variété de Fano de dimension 4, X est une variété de Fano torique de dimension 7 ou X est une variété de Fano torique de dimension arbitraire avec $ _X dim(X) / 3 + 1. Enfin, nous présentons une approche nouvelle pour le cas général.      

Smoothness of solutions of a nonlinear ode

Smoothness of aC -functionf is measured by (Carleman) sequence {M _k} ₀ ; we sayfC _M [0, 1] if|f ^(k) (t)|CR ^k M _k,k=0, 1, ... withC, R>0. A typical statement proven in this paper isTHEOREM: Let u, b be two C -functions on [0, 1]such that (a) u=u ²+b, (b) |b ^(k) (t)|CR ^k (k!) , >1,k_–.Then |u^(k)(t)|C₁R^k((k–1)!),k_–.The first author acknowledges the hospitality of Mathematical Research Institute of the Ohio State University during his one month visit there in the spring of 1999     

Upper bound for transversals of tripartite hypergraphs

We prove 2 7/9v for 3-partite hypergraphs. (This is an improvement of the trivial bound 3v.)     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

A note on characterizations of Abelian varieties by topological invariants

In this note, for any given n3 and 2mn (when m=n, we assume n divides 3 and n6), we construct examples of smooth projective varieties X of dimension n with p_g(X)=1, ₁(X)²ⁿ and the Kodaira dimension (X)=m.Mathematics Subject Classification (2000):14H45, 14H99     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

Counting finite posets and topologies

A refinement of an algorithm developed by Culberson and Rawlins yields the numbers of all partially ordered sets (posets) with n points and k antichains for n11 and all relevant integers k. Using these numbers in connection with certain formulae derived earlier by the first author, one can now compute the numbers of all quasiordered sets, posets, connected posets etc. with n points for n14. Using the well-known one-to-one correspondence between finite quasiordered sets and finite topological spaces, one obtains the numbers of finite topological spaces with n points and k open sets for n11 and all k, and then the numbers of all topologies on n14 points satisfying various degrees of separation and connectedness properties, respectively. The number of (connected) topologies on 14 points exceeds 10²³.     

Dependence Between Order Statistics in Samples from Finite Population and its Application to Ranked Set Sampling

Let X1, X2,..., Xm, Y1, Y2,..., Yn be a simple random sample without replacement from a finite population and let X(1) X(2) ... X(m) and Y(1) Y(2) ... Y(n) be the order statistics of X1, X2,..., Xm and Y1, Y2,..., Yn, respectively. It is shown that the joint distribution of X(i) and X(j) is positively likelihood ratio dependent and Y(j) is negatively regression dependent on X(i). Using these results, it is shown that when samples are drawn without replacement from a finite population, the relative precision of the ranked set sampling estimator of the population mean, relative to the simple random sample estimator with the same number of units quantified, is bounded below by 1.     

From Ginzburg-Landau to Gross-Pitaevskii

In this note we consider the Gross-Pitaevskii equation i _t ++(1–²)=0, where is a complex-valued function defined on ^N×, and study the following 2-parameters family of solitary waves: (x, t)=e ^it v(x ₁–ct, x), where and x denotes the vector of the last N–1 variables in ^N . We prove that every distribution solution , of the considered form, satisfies the following universal (and sharp) L -bound:

On unconditionally convergent basis expansions in the space of continuous functions

[0,1], - H .

---

---

This paper was written during the author's scholarship at the State University of Odessa in the USSR.     

Ergodicity of nonlinear first order autoregressive models

Criteria are derived for ergodicity and geometric ergodicity of Markov processes satisfyingX _n+1 =f(X _n )+(X _n ) _n+1 , wheref, are measurable, { _n } are i.i.d. with a (common) positive density,E| _n |>. In the special casef(x)/x has limits, , asx– andx+, respectively, it is shown that <1, <1, <1 is sufficient for geometric ergodicity, and that <-1, 1, 1 is necessary for recurrence.