Posets isomorphic to their extensions

A standard extension for a poset P is a system Q of lower ends (descending subsets) of P containing all principal ideals of P. An isomorphism between P and Q is called recycling if [Y]Q for all YQ. The existence of such an isomorphism has rather restrictive consequences for the system Q in question. For example, if Q contains all lower ends generated by chains then a recycling isomorphism between P and Q forces Q to be precisely the system of all principal ideals. For certain standard extensions Q, it turns out that every isomorphism between P and Q (if there is any) must be recycling. Our results include the well-known fact that a poset cannot be isomorphic to the system of all lower ends, as well as the fact that a poset is isomorphic to the system of all ideals (i.e., directed lower ends) only if every ideal is principal.     

Harmonic analysis on tori

We consider measurable subsets {ofR}ⁿ with 0<m()<, and we assume that has a spectral set . (In the special case when is also assumed open, may be obtained as the joint spectrum of a family of commuting self-adjoint operators {H _k: 1kn} in L ² () such that each H _k is an extension of i(/x _k) on C _c (), k=1, ..., n.)It is known that is a fundamental domain for a lattice if is itself a lattice. In this paper, we consider a class of examples where is not assumed to be a lattice. Instead is assumed to have a certain inhomogeneous form, and we prove a necessary and sufficient condition for to be a fundamental domain for some lattice in {ofR}ⁿ. We are thus able to decide the question, fundamental domain or not, by considering only properties of the spectrum . Our criterion is obtained as a corollary to a theorem concerning partitions of sets which have a spectrum of inhomogeneous form.Work supported in part by the NSF.Work supported in part by the NSRC, Denmark.     

Lattice Polytopes Associated to Certain Demazure Modules of sl n + 1

Let w be an element of the Weyl group of sl _{n + 1}. We prove that for a certain class of elements w (which includes the longest element w₀ of the Weyl group), there exist a lattice polytope R ^l(w) , for each fundamental weight _i of sl _{n + 1}, such that for any dominant weight = _{i = 1} ⁿ a _{i i} , the number of lattice points in the Minkowski sum _w = _{i = 1} ⁿ a _{i i} ^w is equal to the dimension of the Demazure module E _w (). We also define a linear map A ^w : R ^l(w) P _Z R where P denotes the weight lattice, such that char E _w () = e e^–A(x) where the sum runs through the lattice points x of ^w .     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

Decompositions of complete graphs into isomorphic bipartite subgraphs

Let |E(G)|= andf, a 1-1 mapping ofV(G) into {0,1,...,}. Thenf is called a -valuation ofG if the induced function given by , for alluvE(G) is 1-1. A -valuationf is called an -valuation ofG if there exists a nonnegative number such that for everyuvE(G) withf(u)<f(v),f(u)<f(v). Let denote the graph of then-dimensionalG-cube. ForG=K _{3, 3},K _{4, 4}, andP _k ,it is shown that for any positive integern, then-dimensionalG-cube has an -valuation. This gives rise to decompositions of some complete graphs into certain bipartite graphs.     

A Local Approach to 1-Homogeneous Graphs

Let bea distance-regular graph with diameter d. For vertices x and y of at distancei, 1 i d, we define the setsC _i(x,y) = i–1(x) (y), A _i (x,y) = _i (x) (y) and B _i (x,y) = _i+1(x) (y).Then we say has the CAB_j property,if the partition CAB _i (x,y) = {C _i (x,y),A _i (x,y),B _i (x,y)}of the local graph of y is equitable for each pairof vertices x and y of at distance i j. We show that in with the CAB_j property then the parameters ofthe equitable partitions CAB i(x,y) do not dependon the choice of vertices x and y atdistance i for all i j. The graph has the CAB property if it has the CAB _d property. We show the equivalence of the CAB property and the1-homogeneous property in a distance-regular graph with a ₁ 0. Finally, we classify the 1-homogeneous Terwilligergraphs with c ₂ 2.     

Completion of Countably Seminormed Spaces

Let E be a vector space with a topology generated by countably many increasing seminorms p1 p2 ...and let _{p i} be the completion of E/ker (pi) with respect to pi. If pi are norms compatible in a certain sense, it is known that E is a complete space if and only if E=_{i=1 p i} . In this paper we give a similar characterization of complete spaces in a general case when pi are seminorms, without any additional assumptions. Our characterization coincides with the known one if pi are compatible norms.     

Some extensions of the Hewitt-Savage zero-one law

Summary Let denote the class of infinite product probability measures = ₁× ₂× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and _{0 n} for some n 1, then ₀× ₁× ₂×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556     

Semimodular lattices with isomorphic graphs

Two discrete modular lattice and have isomorphic graphs if and only if is of the form A × and is of the form A × for some lattices A and and . We prove that for discrete semimodular lattices and this latter condition holds if and only if and have isomorphic graphs and the isomorphism preserves the order on all cover-preserving sublattices of which are isomorphic to the seven-element, semimodular, nonmodular lattice (see Figure 1). This answers in the affirmative a question posed by J. Jakubik.     

Asymptotic behavior of general M-estimates for regression and scale with random carriers

Summary Let (xini, y _i be a sequence of independent identically distributed random variables, where x _i R ^p and y _i R, and let R ^p be an unknown vector such that y _i =x _i +u _i (^*), where u _i is independent of x _i and has distribution function F(u/), where >0 is an unknown parameter. This paper deals with a general class of M-estimates of regression and scale, ( ^*,^*), defined as solutions of the system: , where r= (y _i –x _i ^1*/)^*, with R ^p ×RR and RR. This class contains estimators of (, ) proposed by Huber, Mallows and Krasker and Welsch. The consistency and asymptotic normality of the general M-estimators are proved assuming general regularity conditions on and and assuming the joint distribution of (x _i , y _i ) to fulfill the model (^*) only approximately.     

General Blowings-up of ℙ2 and Injectivity of Gauss Maps

We consider the blowing-up Y _k of the projective plane along k general points P ₁,...,P _k . Let _k : Y _k ² be the projection map and E _i the exceptional divisor corresponding to P _i for 1ik. For m2 and km(m+3)/2–4 let _k be the invertible sheaf _k ^*( ²(m)) _{Y k} (–E ₁–···–E _k ) on Y _k , and let _k: Y _k ^N be the morphism corresponding to _k . As _k is a local embedding, the Gauss map _k corresponding to _k is defined on Y _k by _k (x)=(d _{x k} )(T _x (Y _k )) for all xY _k . We prove that this Gauss map _k is injective.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Estimation of Local Smoothness Coefficients for Continuous Time Processes

We consider processes that satisfied a local Hölder condition with coefficient ₀. According to the sampling times of observations given by i _n with i=0,...,n–1, we study two general classes of estimators for ₀. Their almost sure rates of convergence depend on asymptotic independence of the observed processes, on _n and eventually on an extra parameter ₀. Since this last parameter is in general unknown, we construct a family of preliminary estimators for ₀ with their rates of almost sure convergence. Finally we present some numerical simulations in order to compare the behaviour of our various estimators.     

An efficient algorithm for solving semi-infinite inequality problems with box constraints

Many design objectives may be formulated as semi-infinite constraints. Examples in control design, for example, include hard constraints on time and frequency responses and robustness constraints. A useful algorithm for solving such inequalities is the outer approximations algorithm. One version of an outer approximations algorithm for solving an infinite set of inequalities(x, y) 0 for allyY proceeds by solving, at iterationi of the master algorithm, a finite set of inequalities ((x, y) 0 for allyY _i) to yieldx _i and then updatingY _i toY _i+1=Y _i {y_i } wherey _i arg max {(x _i,y)¦y Y}. Since global optimization is computationally extremely expensive, it is desirable to reduce the number of such optimizations. We present, in this paper, a modified version of the outer approximations algorithm which achieves this objective.The research reported herein was sponsored by the National Science Foundation Grants ECS-9024944, ECS-8816168, the Air Force Office of Scientific Research Contract AFOSR-90-0068, and the NSERC of Canada under Grant OGPO-138352.     

Mathematical expectations of functions of sums of a random number of independent terms

Conditions are found which must be imposed on a function g(x) in order that M g(₁+₂+ + _v < if M g(_i) < and M g(v) < ,, ₁, ₂, , _n, ... being non-negative and independent, being integral, and {_i} being identically distributed. The result is applied to the theory of branching processes.Translated from Matematicheskie Zametki, Vol. 3, No. 4, pp. 387–394, April, 1968.     

Jensen inequalities for functions with higher monotonicities

Summary We investigate generalizations of the classical Jensen and Chebyshev inequalities. On one hand, we restrict the class of functions and on the other we enlarge the class of measures which are allowed. As an example, consider the inequality (J)(f(x) d) A (f(x) d, d d = 1. Iff is an arbitrary nonnegativeL _x function, this holds if 0, is convex andA = 1. Iff is monotone the measure need not be positive for (J) to hold for all convex withA = 1. If has higher monotonicity, e.g., is also convex, then we get a version of (J) withA < 1 and measures that need not be positive.     

Présentations des groupes de Fischer (II)

In this paper we give Coxeter presentation (X, ) for the three Fischer groupsG=Fi₂₂, Fi₂₃, Fi₂₄; we apply methods exposed in the first part. Each of these groups is generated by a class of 3-transpositions (named here a Fischer class) in which elements ofX are chosen. A subset of is the set of all the relations (xy) ^m(x,y)=1, wherex andy are inX and wherem(x,y) means the order ofxy inG. We obtainG as a specified quotient of the Coxeter group (X, ) with the appropriate diagram .     

Relaxation of a Quadratic Functional Defined by a Nonnegative Unbounded Matrix

We study the lower semicontinuous envelope in L^p(), F, of a functional F of the form F(u)=A uudx where A=A(x) is not strictly elliptic and not bounded. We prove that F; may also be written as F;(u)= Buudx with B=AP A for a matrix P which is the matrix of an orthogonal projection. In the one-dimensional case, we characterize the domain of F and we explicit the matrix P.     

A Kähler structure on the moduli space of isometric maps of a circle into Euclidean space

We study the spaces and and _Lip of smooth (resp. non-degenerate Lipschitz) isometric maps of a circle into Euclidean space modulo orientation preserving Euclidean motions. We prove that and _Lip are infinite dimensional Kähler manifolds. In particular, they are complex Fréchet (resp. Banach) manifolds. This is proved by an infinite dimensional version of the Kirwan, Kempf-Ness Theorem [Kir84], [KN78], [Nes84] relating symplectic quotients to holomorphic quotients, applied to the action ofPSL ₂() on the free loop space ofS ².Oblatum 15-X-1994 & 5-VII-1995This research was supported in part by NSF grant DMS-92-05154.This research was partially supported by AFOSR grant F49620-92-J-0093.     

On depth first search strees inm-out digraphs

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let _i be thei ^th vertex encountered by DFS andL(i, m, n) be the height of _i in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.