we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all $k$-subsets ofa $v$-set into $n$ disjoint $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$. we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...