Circle orders,N-gon orders and the crossing number

Let ={P ₁,...,P _m } be a family of sets. A partial order P(, <) on is naturally defined by the condition P _i <P _j iff P _i is contained in P _j . When the elements of are disks (i.e. circles together with their interiors), P(, <) is called a circle order; if the elements of are n-polygons, P(, <) is called an n-gon order. In this paper we study circle orders and n-gon orders. The crossing number of a partial order introduced in [5] is studied here. We show that for every n, there are partial orders with crossing number n. We prove next that the crossing number of circle orders is at most 2 and that the crossing number of n-gon orders is at most 2n. We then produce for every n4 partial orders of dimension n which are not circle orders. Also for every n>3, we prove that there are partial orders of dimension 2n+2 which are not n-gon orders. Finally, we prove that every partial order of dimension 2n is an n-gon order.This research was supported under Natural Sciences and Engineering Research Council of Canada (NSERC Canada) grant numbers A2507 and A0977.     

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.     

The associativity equation revisited

Summary Consideration of the Associativity Equation,x (y z) = (x y) z, in the case where:I × I I (I a real interval) is continuous and satisfies a cancellation property on both sides, provides a complete characterization of real continuous cancellation semigroups, namely that they are topologically order-isomorphic to addition on some real interval: ( – ,b), ( – ,b], –, +), (a, + ), or [a, + ) — whereb = 0 or –1 anda = 0 or 1. The original proof, however, involves some awkward handling of cases and has defied streamlining for some time. A new proof is given following a simpler approach, devised by Páles and fine-tuned by Craigen.     

Characterization theorem of generalized polynomial of best approximation having bounded coefficients

Let the set of generalized polynomials having bounded coefficients beK={p= _jg_j. _{j j j},j=1, 2, ...,n}, whereg ₁,g ₂, ...,g _n are linearly independent continuous functions defined on the interval [a, b], _j, _j are extended real numbers satisfying _j<+, _j>-, and _{j j}. Assume thatf is a continuous function defined on a compact setX [a, b]. This paper gives the characterization theorem forp being the best uniform approximation tof fromK, and points out that the characterization theorem can be applied in calculating the approximate solution of best approximation tof fromK.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

A characterization ofL n(K) as a permutation group

In 1972 M. O'Nan proved thatL _n (q),h 3; can be characterized as a doubly-transitive groupG on a finite set , whereG _a has an Abelian normal subgroup acting not semi-regularly on -a. In the Main Theorem we show that a similar statement holds if is infinite. Our result implies O'Nan's theorem.This paper is part of the author's Ph.D. thesis written under supervision of Prof. F. G. Timmesfeld.     

The distortion of Hilbert space

The unit sphere of Hilbert space, ₂, is shown to contain a remarkable sequence of nearly orthogonal sets. Precisely, there exist a sequence of sets of norm one elements of ₂, (C _i ) _i=1 , and reals _i 0 so that a) each setC _i has nonempty intersection with every infinite dimensional closed subspace of ₂ and b) forij,xC, andyC _j , |x, y|<_{min(i, j)} E. Odell was partially supported by NSF and TARP. Th. Schlumprecht was partially supported by NSF and LEQSF.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Inequalities in Products of Minors of Totally Nonnegative Matrices

Let _I,I be the minor of a matrix which corresponds to row set I and column set I. We give a characterization of the inequalities of the form _{I,I K,K J,J L,L} which hold for all totally nonnegative matrices. This generalizes a recent result of Fallat, Gekhtman, and Johnson.     

Transposition generation of alternating permutations

A permutation _{1 2}... _n is alternating if ₁< ₂> ₃< ₄.... Alternating permutations are counted by the Euler numbers. Here we show that alternating permutations can be listed so that successive permutations differ by a transposition, ifn is odd. Extensions and open problems are mentioned.Research supported by the Natural Sciences and Engineering Research Council of Canada under grant A3379.     

The hypermetric cone is polyhedral

The hypermetric coneH _n is the cone in the spaceR ^n(n–1)/2 of all vectorsd=(d _ij)_1i<jn satisfying the hypermetric inequalities: –_1ijn z _j z _j d _ij 0 for all integer vectorsz inZ ⁿ with –_1in z _i =1. We explore connections of the hypermetric cone with quadratic forms and the geometry of numbers (empty spheres andL-polytopes in lattices). As an application, we show that the hypermetric coneH _n is polyhedral.     

Effilement minimal en une singularité isolée de l'équation de Schrödinger et application au principe de Picard

In this paper, the generalized Schrödinger equation (–)u=0 on the punctured unit disk of ² is investigated. If is rotation free and satisfies the Picard principle at the origin, it is shown that if a setE is minimal thin relatively to an extremal harmonic functionh with zero boundary values at {|x|=1}, there exists a sequence (r _n ) converging to zero such that B(O,r _n ) C E. Lete be the -unit. It is proved that if a measure satisfies _\E e h d<, for a minimal thin, relatively toh , setE then the Picard principle is valid for the measure + .

     

All Lambda-Designs With λ = 2 p are Type-1

A-design is a family B ₁,B ₂,...,B _v of subsets of X={1, 2,..., v} such that B _i B _j = for all i jand not all B _i are of the same size. Ryser's andWoodall's -design conjecture states thateach -design can be obtained from a symmetricblock design by a certain complementation procedure. Our mainresult is that the conjecture is true when is twice a prime number.     

Inclusion-exclusion: Exact and approximate

It is often required to find the probability of the union of givenn eventsA ₁ ,...,A _n . The answer is provided, of course, by the inclusion-exclusion formula: Pr(A _i )= _i – _i<j Pr(A _i A _j )±.... Unfortunately, this formula has exponentially many terms, and only rarely does one manage to carry out the exact calculation. From a computational point of view, finding the probability of the union is an intractable, #P-hard problem, even in very restricted cases. This state of affairs makes it reasonable to seek approximate solutions that are computationally feasible. Attempts to find such approximate solutions have a long history starting already with Boole [1]. A recent step in this direction was taken by Linial and Nisan [4] who sought approximations to the probability of the union, given the probabilities of allj-wise intersections of the events forj=1,...k. The developed a method to approximate Pr(A _i ), from the above data with an additive error of exp . In the present article we develop an expression that can be computed in polynomial time, that, given the sums _|S|=j Pr( _iS A _i ) forj=1,...k, approximates Pr(A _i ) with an additive error of exp . This error is optimal, up to the logarithmic factor implicit in the notation.The problem of enumerating satisfying assignments of a boolean formula in DNF formF=v _l ^m C _i is an instance of the general problem that had been extensively studied [7]. HereA _i is the set of assignments that satisfyC _i , and Pr( _iS A _i )=a _S /2ⁿ where _iS C _i is satisfied bya _S assignments. Judging from the general results, it is hard to expect a decent approximation ofF's number of satisfying assignments, without knowledge of the numbersa _S for, say, all cardinalities . Quite surprisingly, already the numbersa _S over |S|log(n+1)uniquely determine the number of satisfying assignments for F.We point out a connection between our work and the edge-reconstruction conjecture. Finally we discuss other special instances of the problem, e.g., computing permanents of 0,1 matrices, evaluating chromatic polynomials of graphs and for families of events whose VC dimension is bounded.Work supported in part by a grant of the Binational Israel-US Science Foundation.Work supported in part by a grant of the Binational Israel-US Science Foundation and by the Israel Science Foundation.     

First order properties of random posets

Let =(n,p) be a binary relation on the set [n]={1, 2, ..., n} such that (i,i) for every i and (i,j) with probability p, independently for each pair i,j [n], where i<j. Define as the transitive closure of and denote poset ([n], ) by R(n, p). We show that for any constant p probability of each first order property of R(n, p) converges as n .     

j-partitions for visible shorelines

Summary LetC be a compact set inR ². A setS R ² C is said to have aj-partition relative toC if and only if there existj or fewer pointsc ₁,, c _j inC such that each point ofS sees somec _i via the complement ofC. Letm, j be fixed integers, 3 m, 2 j, and writem (uniquely) asm = qj + r, where 1 r j. Assume thatC is a convexm-gon in R², withS R ² C. Forq = 0 orq = 1, the setS has aj-partition relative toC. Forq 2,S has aj-partition relative toC if and only if every (qj + 1)-member subset ofS has aj-partition relative toC, and the Helly numberqj + 1 is best possible.IfC is a disk, no such Helly number exists.     

Symmetric balanced ternary designs with ϱ1 = 1 or 2

Summary We prove the following two non-existence theorems for symmetric balanced ternary designs. If ₁ = 1 and 0 (mod 4) then eitherV = + 1 or 4₂ – + 1 is a square and (4₂ – + 1) divides ² – 1. If ₁ = 2 thenV = ((m + 1)/2) ² + 2,K = (m ² + 7)/4 and = ((m – 1)/2)² + 1 wherem 3 (mod 4). An example belonging to the latter series withV = 18 is constructed.     

The caratheodory number for thek-core

Thek-core of the setS ⁿ is the intersection of the convex hull of all setsA S with ¦SA¦<-k. The Caratheodory number of thek-core is the smallest integerf (d,k) with the property thatx core _{kS, S} ⁿ implies the existence of a subsetT S such thatx core_kT and ¦T¦f (d, k). In this paper various properties off(d, k) are established.Research of this author was partially supported by Hungarian National Science Foundation grant no. 1812.     

Dual-orthogonal polynomials

Let (x, ) and (x,) be two functions,x[a, b] and { _j } _j=1 and { _j } _j=1 be two sequences where _{i j} and _{i j} whenij. We define the vector spacesU _k =span{(x, _j )} _j=1 ^k andV _k =span{(x, _j )} _j=1 ^k where we assume thatdim(U _k )=dim(V _k )=k,k1. We then look for the generalized polynomialsp _m xU _m+1\U _m so that _a ^b p _m (x)(x, _j )d(x)=0,j=1,2,...,m. If such generalized polynomials exist for allm1 we say that {p _m } _m=1 is a dual-orthogonal polynomial sequence from {(x, _j )} _j=1 to {(x, _j )} _j=1 with respect to the distribution (x),x[a, b]. In this article we present existence theorems for dual-orthogonal polynomials, explicit formulae forp _m(x), theorems about the zeros ofp _m(x), and, in the end, a Gauss-type quadrature formula for dual-orthogonal polynomials.     

On the asymptotic and invariantσ-algebras of random walks on locally compact groups

Summary Consider a random walk of law on a locally compact second countable groupG. Let the starting measure be equivalent to the Haar measure and denote byQ the corresponding Markov measure on the space of pathsG . We study the relation between the spacesL (G , ^a ,Q) andL (G , ⁱ ,Q) where ^a and ⁱ stand for the asymptotic and invariant -algebras, respectively. We obtain a factorizationL (G , ^a ,Q) L (G , ⁱ ,Q)L (C) whereC is a cyclic group whose order (finite or infinite) coincides with the period of the Markov shift and is determined by the asymptotic behaviour of the convolution powers ⁿ.