Packing circuits in eulerian digraphs

LetG be an eulerian digraph; let (G) be the maximum number of pairwise edge-disjoint directed circuits ofG, and (G) the smallest size of a set of edges that meets all directed circuits ofG. Borobia, Nutov and Penn showed that (G) need not be equal to (G). We show that (G)=(G) provided thatG has a linkless embedding in 3-space, or equivalently, if no minor ofG can be converted toK ₆ by –Y andY– operations.     

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.     

Decktransformationen transnormaler Mannigfaltigkeiten

For every transnormal m-manifold V (see [3] or [7]) in ⁿ :VW, mapping pV into its normal plane (p) is a covering map onto a submanifold W of the open Grassmannian H_n,n–m of all (n–m)-dimensional planes in ⁿ. The transnormal frame T:=^–1((p)) admits a transitive operation by a group J of isometries. The group action of the covering transformations of (V,,W) on T commutes with the action of J. The elements of J, which are restrictions of covering transformations to T, are exactly the elements of the centre of J. This property is applied to show the existence of nontrivial covering transformations of (V,,W) for n–m3.

---

---

Diese Arbeit faßt die Kapitel 5, 6 und 7 der von der Fakultät für Allgemeine Ingenieurwissenschaften der TU Berlin genehmigten Dissertation [6] zusammen.     

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.     

Limits of balayage measures

LetA be a subset of a balayage space (X,W) and a measure onX. It is shown that for every sequence _n of measures such that lim_nn and lim_{n n} ^A = the limit measure is of the formf+[(1-f)]^A for some (unique) Borel function 0f1_Cb(A). Furthermore, conditions are given such that any such functionf occurs.     

Aperture-Angle Optimization Problems in Three Dimensions

Let [a,b] be a line segment with end points a, b and a point at which a viewer is located, all in R ³. The aperture angle of [a,b] from point , denoted by (), is the interior angle at of the triangle (a,b,). Given a convex polyhedron P not intersecting a given segment [a,b] we consider the problem of computing _max() and _min(), the maximum and minimum values of () as varies over all points in P. We obtain two characterizations of _max(). Along the way we solve several interesting special cases of the above problems and establish linear upper and lower bounds on their complexity under several models of computation.     

On a construction related to the non-abelian tensor square of a group

LetG andG be isomorphic groups. We introduce and study a quotient (G) of the free productG *G which is a group extention of the non-abelian tensor squareG G. This seems to bring computational advantages to calculate this last group. Looking over as an operator in the class of groups we prove that it preserves properties of the argumentG such as finiteness, set of prime divisors, nilpotency and solvability. For a finitep-groupG we find a good polynomial bound for the order of (G).     

Compact Toeplitz operators via the Berezin transform on bounded symmetric domains

Let be an irreducible bounded symmetric domain of genusp, h(x, y) its Jordan triple determinant, andA ² () the standard weighted Bergman space of holomorphic functions on square-integrable with respect to the measureh(z, z) ^–p dz. Extending the recent result of Axler and Zheng for =D, =p=2 (the unweighted Bergman space on the unit disc), we show that ifS is a finite sum of finite products of Toeplitz operators onA ² () and is sufficiently large, thenS is compact if and only if the Berezin transform ofS tends to zero asz approaches . An analogous assertion for the Fock space is also obtained.The author's research was supported by GA AV R grant A1019701 and GA R grant 201/96/0411.     

Sources in posets and comparability graphs

A vertex in a poset is a source if its indegree is zero. Further, a vertex in a comparability graph G is a source if there is a transitive orientation of G in which is a source. We characterize sources in comparability graphs in terms of forbidden subgraphs. Certain results follow, including a brief proof of a theorem by Olariu.     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

Sur un problème de Rényi

Let (n) be the number of all prime divisors ofn and (n) the number of distinct prime divisors ofn. We definev _q (x)=|{nx(n)–(n)=q}|. In this paper, we give an asymptotic development ofv _q (x); this improves on previous results.

     

Weak Sequential Completeness of β-duals of Double Sequence Spaces

We consider dual pairs E,E ⁽⁾ of double sequence spaces E and E ⁽⁾, where E ⁽⁾ is the -dual space of E with respect to the -convergence of double sequences for = p (Pringsheim convergence), bp (bounded p-convergence) and r (regular convergence). Motivated by Boos, Fleming and Leiger [3], we introduce two oscillating properties (signed P_OSCP(k), k {1,2}) for a double sequence space E such that the signed P_OSCP(1) guarantees the (E ^(p), E)-sequential completeness of E ^(p), whereas the signed P_OSCP(2) implies the equalities E ^(r) = E ^(bp) = E ^(p) and the (E ⁽⁾, E)-sequentialcompleteness of E ⁽⁾ for = bp and r.     

An automatic integration procedure for infinite range integrals involving oscillatory kernels

Let the real functionsK(x) andL(x) be such thatM(x)=K(x)+iL(x)=e^ix g(x), whereg(x) is infinitely differentiable for all largex and is non-oscillatory at infinity. We develop an efficient automatic quadrature procedure for numerically computing the integrals _a K(t)f(t) and _a L(t)f(t)dt, where the functionf(t) is smooth and nonoscillatory at infinity. One such example for which we also provide numerical results is that for whichK(x)=J (x) andL(x)=Y (x), whereJ (x) andY (x) are the Bessel functions of order . The procedure involves the use of an automatic scheme for Fourier integrals and the modified W-transformation which is used for computing oscillatory infinite integrals.     

Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.     

Some Ramsey-Turán type results for hypergraphs

To everyk-graphG let(G) be the minimal real number such that for every>0 andn>n ₀(,G) everyk-graphH withn vertices and more than (+) ( ) edges contains a copy ofG. The real number (G) is defined in the same way adding the constraint that all independent sets of vertices inH have sizeo(n). Answering a problem of Erds and Sós it is shown that there exist infinitely manyk-graphs with 0<(G)<(G) for everyk3. It is worth noting that we were unable to find a singleG with the above property.This paper was written while the authors were visiting AT&T Bell Laboratories, Murray Hill, NJ 07974.     

Ornstein–Uhlenbeck Path Integral and Its Application

Introducing a path integral for the Ornstein–Uhlenbeck process distorted by a potential V(x), we find out the T limit of the probability distributions of X[]:=1/T ₀ ^T V((t))dt for Ornstein–Uhlenbeck process (t), with appropriate values of the exponent that depend on V. The results are compared with those for the Wiener process.     

Canonical and Boundary Representations on a Hyperboloid of One Sheet

For the hyperboloid of one sheet X=G/H, G=SO₀(1,2), H=SO₀(1,1), canonical representations R _,, C, =0,1, are defined as the restrictions to G of representations of the overgroup =SO₀(2,2) associated with a cone. They act on the torus containing two copies of X as open G-orbits. We study boundary representations generated by R _,. For some , they contain Jordan blocks. The decomposition of R _, into irreducible constituents includes a finite number (depending on ) of irreducible parts of the boundary representations.     

A remark on covering graphs

Every graph G may be transformed into a covering graph either by deletion of edges or by subdivision. Let _E (G) and _V (G) denote corresponding minimal numbers. We prove _E (G) = _V (G) for every graph G.     

Local Recognition Of Non-Incident Point-Hyperplane Graphs

Let be a projective space. By H() we denote the graph whose vertices are the non-incident point-hyperplane pairs of , two vertices (p,H) and (q,I) being adjacent if and only if p I and q H. In this paper we give a characterization of the graph H() (as well as of some related graphs) by its local structure. We apply this result by two characterizations of groups G with PSL _n ( )GPGL _n ( ), by properties of centralizers of some (generalized) reflections. Here is the (skew) field of coordinates of .     

On sequences of Dirichlet polynomials uniformly bounded on half planes

Given and a sequence of Dirichlet polynomials estimates for the coefficientsa _n are proved if {_n} is uniformly bounded on a region containing a half plane. Thereby a result is obtained which is an analogue of a known result for polynomials, that is for theA-transforms of the geometric sequence; moreover a Jentzsch type theorem for {_n(z)} is derived.