The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

Lax-type isospectral deformations on nilmanifolds

A one-parameter familyg(t) (0 t T) of Riemannian metric on a compact manifold is called an isospectral deformation of a metricg(0) if the Laplace-Beltrami operators associated to the metricsg(t) have the same spectra. Examples of non-trivial isospectral deformations were constructed on solvmanifolds for the first time by C.S. Gordon and E. Wilson on the basis of Kirillov theory. This paper considers the isospectral deformations on nilmanifolds from the dynamical point of view. First, we see for certain isospectral deformations that the associated Hamiltonian systems of geodesic flows are decomposed into a collection of reduced systems which are left invariant as Hamiltonian systems under the deformations. This fact is formulated by the classical Lax equations. Next, by using a quantization procedure, we attempt to obtain Lax equations for the reduced Laplacians from the classical Lax equations. As a result, we show that certain isospectral deformations by Gordon-Wilson are represented by the Lax equations.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

On the E- and MV-optimality of block designs having k≥v

In this paper we consider the problem of determining and constructing E- and MV-optimal block designs to use in experimental settings where treatments are applied to experimental units occurring in b blocks of size k, k. It is shown that some of the well-known methods for constructing E- and MV-optimal unequally replicated designs having k fail to yield optimal designs in the case where . Some sufficient conditions are derived for the E- and MV-optimality of block designs having and methods for constructing designs satisfying these sufficient conditions are given.     

Some Conditions for a C0-Semigroup to Be Asymptotically Finite-Dimensional

We study the class of bounded C ₀-semigroups T=(T _t ) _t0 on a Banach space X satisfying the asymptotic finite dimensionality condition: codim X ₀(T)<, where X ₀(T):={x X:lim_t T _t x=0}. We prove a theorem which provides some necessary and sufficient conditions for asymptotic finite dimensionality.     

Some Y-Groups

We call a Y-group a quotient of a Coxeter group with a Y _pqr -diagram in accordance with the ATLAS terminology. Here we prove, without computer aid, that some 3-transposition groups are also Y-groups. For each of these groups, the arms of the Coxeter diagram Y _pqr are such that (1 = r q p 5) or (2 = r q 3, q p 5) holds, the additional relations generally describe the center or the Schur multiplier.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

A finite characterization ofK-matrices in dimensions less than four

The class of realn × n matricesM, known asK-matrices, for which the linear complementarity problemw – Mz = q, w 0, z 0, w ^T z =0 has a solution wheneverw – Mz =q, w 0, z 0 has a solution is characterized for dimensionsn <4. The characterization is finite and practical. Several necessary conditions, sufficient conditions, and counterexamples pertaining toK-matrices are also given. A finite characterization of completelyK-matrices (K-matrices all of whose principal submatrices are alsoK-matrices) is proved for dimensions <4.Partially supported by NSF Grant MCS-8207217.Research partially supported by NSF Grant No. ECS-8401081.     

Radical Classes of Lattice-Ordered Groups vs. Classes of Compact Spaces

For a given class T of compact Hausdorff spaces, let Y(T) denote the class of -groups G such that for each gG, the Yosida space Y(g) of g belongs to T. Conversely, if R is a class of ;-groups, then T(R) stands for the class of all spaces which are homeomorphic to a Y(g) for some gGR. The correspondences TY(T) and RT(R) are examined with regard to several closure properties of classes. Several sections are devoted to radical classes of -groups whose Yosida spaces are zero-dimensional. There is a thorough discussion of hyper-projectable -groups, followed by presentations on Y(e.d.), where e.d. denotes the class of compact extremally disconnected spaces, and, for each regular uncountable cardinal , the class Y(disc), where disc stands for the class of all compact -disconnected spaces. Sample results follow. Every strongly projectable -group lies in Y(e.d.). The -group G lies in Y(e.d.) if and only if for each gG Y(g) is zero-dimensional and the Boolean algebra of components of g, comp(g), is complete. Corresponding results hold for Y(disc). Finally, there is a discussion of Y(F), with F standing for the class of compact F-spaces. It is shown that an Archimedean -group G is in Y(F) if and only if, for each pair of disjoint countably generated polars P and Q, G=P +Q .     

Automorphisms on a Lie group contracting modulo a compact subgroup and applications to semistable convolution semigroups

Let ( _t ) _t0 be a -semistable convolution semigroup of probability measures on a Lie groupG whose idempotent ₀ is the Haar measure on some compact subgroupK. Then all the measures ₁ are supported by theK-contraction groupC _K() of the topological automorphism ofG. We prove here the structure theoremC _K()=C()K, whereC() is the contraction group of . Then it turns out that it is sufficient to study semistable convolution semigroups on simply connected nilpotent Lie groups that have Lie algebras with a positive graduation.     

Small into isomorphisms onL ∞ spaces

IfT is an isomorphism ofL (A, ) intoL (B, ) which satisfies the condition T T ^–11+, where (A, ) is a -finite measure space, thenT/T is close to an isometry with an error less than 4.     

On Solutions of the q-Hypergeometric Equation with q N = 1

We consider the q-hypergeometric equation with q ^N = 1 and , , . We solve this equation on the space of functions given by a power series multiplied by a power of the logarithmic function. We prove that the subspace of solutions is two-dimensional over the field of quasi-constants. We get a basis for this space explicitly. In terms of this basis, we represent the q-hypergeometric function of the Barnes type constructed by Nishizawa and Ueno. Then we see that this function has logarithmic singularity at the origin. This is a difference between the q-hypergeometric functions with 0 < |q| < 1 and at |q| = 1.     

Аппроксимация субга рмонических функций

The following statement is proved. Letu be a subharmonic function in the region and _u the associated measure. Then there exists a functionf holomorphic in and such that if _f is the associated measure of the function in ¦f¦, then ¦u(z)–ln¦f(z)¦ A¦ln s¦+B¦ln diam¦+ s(¦lns¦+1)+C. hold at every point z for which the setsD(z, t)={w: ¦w–z¦},t(0,s) lie in and satisfy(D(z, t))t both for= _u and for= _f . In the case where is an unbounded region, In diam should be replaced by ln ¦z¦. The constants, , do not depend on andu.

---

---

. . .     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Einige Aspekte in der Zuordnungstheorie

Zusammenfassung Gegeben seien endliche MengenX, Y undZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y) Z}.Man nenntA X (bzw.B Y)zuordenbar, wenn es eine Injektion:A Y (bzw.: B X) mit(x) Z _x (bzw.(y) Z _y ) gibt, und (A, B) mit #A=#B > 0 einZuordnungspaar, wenn eine Bijektionf:A B mitf(x)Z _x B (bzw.f ^–1 (y) Z _y A) existiert. Die Bijektionf heißtZuordnungsplan fürA, B.In der vorliegenden Arbeit werden Fragen nach der Existenz von optimal zuordenbaren Mengen und optimalen Zuordnungspaaren behandelt, wenn man auf den MengenX undY Ordnungen vorgibt, wobei auch Nebenbedingungen berücksichtigt werden. In manchen Fällen lassen sich anhand der Beweise Zuordnungspläne oder ihre Berechnungsvorschrift explizit angeben.Zum Schluß werden die Aussagen an konkreten, dem Bereich der Wirtschaftswissenschaften entnommenen Beispielen erläutert.

---

Summary LetX, Y be finite sets andZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y)Z}. A X (resp.B Y) is calledassignable if there is an injection: A Y (resp.: B X) with (x) Z _x (resp.(y) Z _y ), (A, B) with #A=#B > 0 anassigned pair if there is a bijection f:A B withf (x) Z _x B (resp.f ^–1(y) Z _y A). The bijectionf is called aplan forA andB.In this paper problems are discussed concerning the existence of optimal assignable sets and optimal assigned pairs ifX andY are totally ordered, additional constraints are also considered. In some cases the proofs give explicit constructions of plans. The results are illustrated by application to problems occurring in Operations Research.

---

---

Diese Arbeit ist mit Unterstützung des Sonderforschungsbereiches 72 an der Universität Bonn entstanden.     

On Sobolev and Capacitary Inequalities for Contractive Besov Spaces over d-sets

We derive Sobolev inequalities for Besov spaces B ^p,p (F), 0<<1, 1p< on d-sets F in R ⁿ , dn, from a metric property of the Bessel capacity on R ⁿ . We first extend Kaimanovitch's result on the equivalence of Sobolev and capacitary inequalites for contractive p-norms in a general setting allowing unbounded Lévy kernels. A simple part of the Jonsson–Wallin trace theorem for Besov spaces and some basic properties of Bessel and Besov capacities on R ⁿ are then utilized in getting the desired inequalities. When p=2, the Besov space being considered is a non-local regular Dirichlet space and gives rise to a jump type symmetric Markov process M over the d-set. The upper bound of the transition function of M and metric properties of M -polar sets are then exhibited.     

Asymptotic Expansions for the Congestion Period for the M/M/∞ Queue

We consider the M/M/ queue with arrival rate , service rate and traffic intensity =/. We analyze the first passage distribution of the time the number of customers N(t) reaches the level c, starting from N(0)=m>c. If m=c+1 we refer to this time period as the congestion period above the level c. We give detailed asymptotic expansions for the distribution of this first passage time for , various ranges of m and c, and several different time scales. Numerical studies back up the asymptotic results.     

The existence of probability measures with specified projections

Let X and Y be locally compact-compact topological spaces, F X×Y is closed, and P(F) is the set of all Borel probability measures on F. For us to find, for the pair of probability measures (_x, _y P (X)×P(Y), a probability measure P(F) such that _X = _X ^–1 , _Y = _Y ^–1 it is necessary and sufficient that, for any pair of Borel sets A X, B Y for which (A× B) F=Ø, the condition _XA+ _YB 1 holds.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 573–576, October, 1973.