λ-fold indecomposable large sets of Steiner triple systems

A family (X, B1), (X, B2), . . . , (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTSλ(v) if there exists no LSTSλ (v) contained in the collection for any λ λ. In 1995, Griggs and Rosa posed a problem: For which values of λ 1 and orders v ≡ 1, 3 (mod 6) do there exist IDLSTSλ(v)? In this paper, we use partitionable candelabra systems (PCSs) and holey λ-fold large set of STS(v) (HLSTSλ(v)) as auxiliary designs to establish a recursive construction for IDLSTSλ(v) and show that there exists an IDLSTSλ(v) for λ = 2, 3, 4 and v ≡ 1, 3 (mod 6).     

The spectrum for large sets of pure directed triple systems

An LPDTS(ν) is a collection of 3(ν-2) disjoint pure directed triple systems on the same set ofνelements. It is showed in Tian's doctoral thesis that there exists an LPDTS(ν) forν=0,4 (mod 6),ν≥4. In this paper, we establish the existence of an LPDTS(ν) forν= 1,3 (mod 6),ν> 3. Thus the spectrum for LPDTS(ν) is completely determined to be the set {ν:ν= 0, 1 (mod 3),ν≥4}.     

Small embeddings of partial directed triple systems and partial triple systems with even λ

In 1976, Lindner and Rosa (Ars Combin. 1 (1976), 159–166) showed that a partial triple system with λ > 1 can be embedded in a finite triple system with the same λ. This result is improved in the case when λ is even by embedding a partial triple system on υ symbols in a triple system on t symbols, t ≡ 0,1 (mod 3), for all t >/ 3(λυ² + υ(2 ? λ) + 1). In the process, it is shown that for any λ >/ 1, a partial directed triple system on υ symbols can be embedded in a directed triple system on t symbols, t ≡ 0, 1 (mod 3), for all t ? 6λv² + 6v(1 ? λ) + 3, thus generalizing a result of Hamm (Proceedings, 14th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, 1983).     

Vertex Degrees of Steiner Minimal Trees in ℓ p d and Other Smooth Minkowski Spaces

We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) in the d -dimensional Banach spaces _p ^d independent of d . This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows exponentially in d [19]. Our upper bounds follow from characterizations of singularities of SMTs due to Lawlor and Morgan [14], which we extend, and certain _p -inequalities. We derive a general upper bound of d+1 for the degree of vertices of an SMT in an arbitrary smooth d -dimensional Banach space (i.e. Minkowski space); the same upper bound for Steiner points having been found by Lawlor and Morgan. We obtain a second upper bound for the degrees of vertices in terms of 1 -summing norms. Received April 22, 1997, and in revised form October 1, 1997.     

Rates of convergence for the approximation of dual shift-invariant systems in ℓ2(ℤ)

A shift-invariant system is a collection of functions {g_m,n} of the form g_m,n(k)=g_m(k–an). Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual system _m,n(k)=_m(k–an) such that each functionf can be written asf= f, _m,ngm,n. The mathematical theory usually addresses this problem in infinite dimensions (typically in L² () or ²()), whereas numerical methods have to operate with a finite-dimensional model. Exploiting the link between the frame operator and Laurent operators with matrix-valued symbol, we apply the finite section method to show that the dual functions obtained by solving a finite-dimensional problem converge to the dual functions of the original infinite-dimensional problem in ²(). For compactly supported g_{m, n} (FIR filter banks) we prove an exponential rate of convergence and derive explicit expressions for the involved constants. Further we investigate under which conditions one can replace the discrete model of the finite section method by the periodic discrete model, which is used in many numerical procedures. Again we provide explicit estimates for the speed of convergence. Some remarks on tight frames complete the paper.Part of this work was done while the author was a visitor at the Department of Statistics at the Stanford University.The author has been partially supported by Erwin-Schrödinger scholarship J01388-MAT of the Austrian Science foundation FWF.     

Existence of complex ℓ2 solutions of linear delay systems of difference equations

We give sufficient conditions for the existence of complex ?₂ solutions of a non-homogeneous system of linear difference equations and of two general classes of delay systems of linear difference equations. In some cases, bounds of the established solutions are also given. As a consequence of the space ?₂ where we work, information can be obtained about the asymptotic behavior of the established solutions and, the asymptotic stability of the zero equilibrium point of the systems under consideration. The method we use is a functional-analytic one.     

Large sets of pure directed triple systems with index λ

A directed triple system of order v with index λ, briefly by DTS（v,λ）, is a pair （X, B） where X is a v-set and B is a collection of transitive triples （blocks） on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS（v, λ） is a DTS（v, λ） without repeated blocks. A simple DTS（v, ）,） is called pure and denoted by PDTS（v, λ） if （x, y, z） ∈ B implies （z, y, x）, （z, x, y）, （y, x, z）, （y, z, x）, （x, z, y） B. A large set of disjoint PDTS（v, λ）, denoted by LPDTS（v, λ）, is a collection of 3（v - 2）/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS（v, λ） are presented. Especially, we determine the spectrum of LPDTS（v, 2）.     

Turán and Ramsey numbers in linear triple systems II

In this paper we continue our studies of Turán and Ramsey numbers in linear triple systems, defined as 3-uniform hypergraphs in which any two triples intersect in at most one vertex. In [7] the two main problems left open were the Turán number of the wicket and the Ramsey property of the sail. In this paper we present some progress towards both of these problems.     

The projection onto the center of an ℓ-algebra

In a uniformly complete -algebra with unite>0 the principal band {e} ^dd generated bye is a projection band. We prove that the formula of A. R. Schep for the projection onto this band which holds in the -algebra of order bounded operators on a Dedekind complete vector lattice, in general defines a projection onto the commutant of {e} ^dd . We present some examples to show that the commutant may be strictly larger than the band {e} ^dd , and also conditions which guarantee equality.This paper was written during the fall semester of 1993 while the first author visited the Department of Mathematics of the University of Leiden as a guest of Dr. C. B. Huijsmans, to whom the express his gratitude for the hospitality offered to him.     

The interpolation ofℓ r sequences by hp functions

The sequence spaceH ^P (z)={{f (z_h)}:f H ^p} is defined for a fixed sequence Z={z_k} of different points of the open unit disk and the Hardy class HP of analytic functions in the disk. For an arbitrary p[1, ) is constructed a point sequence Z= {z_k} such that ¹h ^p(z), but ^r h^p (Z) for r > 1. It follows from a well-known result of L. Carleson that the inclusions ^r h (Z) for all r[1,] are equivalent.Translated from Matematicheskie Zametki, Vol. 21, No. 4, pp. 503–508, April, 1977.     

Finite Representability of ℓp in Quotients of Banach Spaces

A typical result of the paper states that if X is a Banach space with a basis and for some 1pq, the spaces _p and _q are finitely block representable in every block subspace of X, then every block subspace of X admits a block quotient Z such that for every r[p,q], the space _r is finitely block representable in Z. Results of a similar nature are also established for ^N _p-block-sequences and asymptotic spaces.     

Distribution of Increasing ℓ-sequences in a Random Permutation

This paper examines the distribution of the number, k, of increasing -sequences in a random permutation of . A new solution is determined based on the compositions of n which requires, at most, summands. This solution easily yields existing results for the special case and provides an alternate form for the case . The expected number of increasing -sequences in a random permutation is determined and it is shown that the limiting distribution is degenerate about 0 for 2$$ " align="middle" border="0"> . An alternate algorithm to determine the exact distribution is presented, based on the partitions of n, which is easy to implement and efficient for small n. Applications in non-parametric statistics and graph theory are discussed.     

Minimax detection of a signal in ℓp metrics

The problem of the minimax detection of a signal is considered in a Gaussian white noise of intensity 0. The set of the signals represents an ellipsoid in the _p-metric with lengths of semiaxes a_k ^–1 0 as k , from which a ball of radius 0 as 0 in the _p-metric has been removed. Asymptotically minimax tests have been constructed for the cases 1 < p and asymptotically sharp estimates of the minimax efficiency have been obtained.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 184, pp. 152–168, 1990.