λ-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).     

On Large Sets of v−1 L-Intersecting Steiner Triple Systems of Order v

This paper presents four new recursive constructions for large sets of v–1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n2 a large set of 3 ⁿ –1 STS (3 ⁿ ) whose systems intersect in 0 or 3 blocks.     

The configuration polytope of ℓ-line configurations in Steiner triple systems

It has been shown that the number of occurrences of any ℓ-line configuration in a Steiner triple system can be written as a linear combination of the numbers of full m-line configurations for 1 ≤ m ≤ ℓ; full means that every point has degree at least two. More precisely, the coefficients of the linear combination are ratios of polynomials in v, the order of the Steiner triple system. Moreover, the counts of full configurations, together with v, form a linear basis for all of the configuration counts when ℓ ≤ 7. By relaxing the linear integer equalities to fractional inequalities, a configuration polytope is defined that captures all feasible assignments of counts to the full configurations. An effective procedure for determining this polytope is developed and applied when ℓ = 6. Using this, minimum and maximum counts of each configuration are examined, and consequences for the simultaneous avoidance of sets of configurations explored. To Alex Rosa on the Occasion of his Seventieth Birthday     

(S − 1,S) Perishable systems with stochastic leadtimes

This article discusses a one-to-one ordering perishable system, in which reorders are processed in the order of their arrival and the processing times are arbitrarily distributed, and as such, the leadtimes are not independent. The Markov renewal techniques are employed to obtain the various operating characteristics for the case of Poisson demand and exponential lifetimes. The problem of minimizing the steady state expected cost rate is also discussed, and in the special case of exponential processing times, the optimal stock level is derived explicitly.     

Diagonal-preserving ring ⁎-isomorphisms of Leavitt path algebras

The graph groupoids of directed graphs E and F are topologically isomorphic if and only if there is a diagonal-preserving ring ?-isomorphism between the Leavitt path algebras of E and F.     

The Contraction of S2p−1 to Hp−1

 A contraction of the sphere , considered as the homogeneous space , to the Heisenberg group is defined. The infinite dimensional irreducible unitary representations of Heisenberg group are then shown to be the limits of the irreducible representations of which are class-1 with respect to . Our results generalise the earlier results of Fulvio Ricci. (Received 1 July 1998; in revised form 3 November 1998)     

Steiner定理的拓广

Steiner定理是一个著名的几何题,它的证明更是给广大数学爱好者予启发和想象.本文给出Steiner定理的拓广,供大家参考.Steiner定理在△ABC中,∠B和∠C的平分线BD与CE相等,则AB=AC.拓广定理(如图1)在△ABC中,设BD、CE分别为∠ABC和∠ACB的n≥2等分角线中的任意两条相应的分角线段     

关于Steiner比猜想

本文所讨论的是Ｓｔｅｉｎｅｒ比猜想。全文共分两部分：第一部分包括历史回顾和对ｎ＝３,４,５三种情况对该猜想的正确性给出了简单的证明;第二部分则对于一般的ｎ给出了一个证明。     

On the Diophantine Equations (2 n − 1)(6 n − 1) = x 2 and (a n − 1)(a kn − 1) = x 2

In this paper we prove that the equation (2 ⁿ – 1)(6 ⁿ – 1) = x ² has no solutions in positive integers n and x. Furthermore, the equation (a ⁿ – 1) (a ^kn – 1) = x ² in positive integers a > 1, n, k > 1 (kn > 2) and x is also considered. We show that this equation has the only solutions (a,n,k,x) = (2,3,2,21), (3,1,5,22) and (7,1,4,120).