Hypergraphical t-designs

We introduce a theory of hypergraphical t-designs. We show the existence of these designs and prove a finiteness theorem on these designs for infinitely many parameter sets. We also give effective bounds on the number of points in these cases. These results generalize some results on graphical t-designs of Alltop, Chee and Betten-Klin-Laue-Wassermann.     

On some spherical t-designs

Let G be a finite subgroup of the orthogonal group O(d). It is shown that many spherical t-designs are constructed from G, if some particular irreducible representations of O(d) remain irreducible when restricted to G.     

Classifications of certain t-designs

The nonextendability and extendability of both a t-(v, k, λ_t) design (with $\text{k ?}\text{v}\text{2}$ and its complementary t-design are discussed in four cases: (A) a t-design is extendable and its complement is not extendable; (B) both a t-design and its complement are extendable; (C) a t-design is not extendable and its complement is extendable; (D) both a t-design and its complement are not extendable. Nontrivial examples for each case are presented. Furthermore, some series of t-designs belonging to cases (A), (B), and (D) are also given.     

Incidence matrices of t-designs

We point out a generalization of the matrix equation NN^T=(r? λ)I+λJ to t-designs with t>2 and derive extensions of Fisher's, Connor's, and Mann's inequalities for block designs.     

Association schemes and t-designs in regular semilattices

A concept of regularity is introduced for finite semilattices with a length function. It is shown that the upper fiber of a regular semilattice carries an association scheme, when points are associated according to the length of their meet. In this framework, a natural definition of t-design is also proposed. The theory applies to triangular- and hypercubic-type association schemes, and to their q-analogs.     

Large sets of t-designs through partitionable sets: A survey

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the recursive theorems. We also review the existence results and recursive constructions which have been found by this method.     

On the Student's t-distribution and the t-statistic

In this paper we provide rather weak conditions on a distribution which would guarantee that the t-statistic of a random vector of order n follows the t-distribution with n-1 degrees of freedom. The results sharpen the earlier conclusions of Mauldon [Characterizing properties of statistical distributions, Quart. J. Math. 2(7) (1956) 155-160] and the more recent advances due to Bondesson [When is the t-statistic t-distributed, Sankhyā, Ser. A 45 (1983) 338-345]. The basic tool involved in the derivations is the vertical density representation originally suggested by Troutt [A theorem on the density of the density ordinate and an alternative interpretation of the Box-Muller method, Statistics 22(3) (1991) 463-466; Vertical density representation and a further remark on the Box-Muller method, Statistics 24 (1993) 81-83]. Several illustrative examples are presented.     

Artin t-motifs

We show that analytically trivial t-motifs satisfy a Tannakian duality, without restrictions on the base field, save for that it be of generic characteristic. We show that the group of components of the t-motivic Galois group coincides with the absolute Galois group of the base field.     

On the solutions to x′(t) = A(t) x (t) over all A(t), where P ⩽ A(t) ⩽ Q

Let P_ij and q_ij be positive numbers for i ≠ j, i, j = 1, …, n, and consider the set of matrix differential equations x′(t) = A(t) x(t) over all A(t), where a_ij(t) is piecewise continuous, a_ij(t) = ?∑_{i ≠ j}a_ij(t), and p_ij ? a_ij(t) ? q_ij all t. A solution x is also to satisfy ∑_{i = 1}ⁿx_i(0) = 1. Let C_t denote the set of all solutions, evaluated at t to equations described above. It is shown that $\text{C}{}_{\mathrm{t}}$, the topological closure of C_t, is a compact convex set for each t. Further, the set valued function $\text{C}{}_{\mathrm{t}}$, of t is continuous and $\text{limit}{}_{\mathrm{t\; \to \; \infty }}\text{C}\text{?}{}_{\mathrm{t}}\text{= ∩}\text{C}\text{?}{}_{\mathrm{t}}$.     

Inequalities for t designs

A number of inequalities concerning the set structure of balanced incomplete block designs are unified, and strengthened in the case of t designs with t ? 4.     

Graphical t-wise balanced designs

A pair (X, $\text{B}$) will be a t-wise balanced design (tBD) of type t?(v, K, λ) if $\text{B}\text{= (B}{}_{\mathrm{i}}\text{: i ? I)}$ is a family of subsets of X, called blocks, such that: (i) $\text{|X| = v ?}\text{N}$, where $\text{N}$ is the set of positive integers; (ii) $\text{1?t?|B}{}_{\mathrm{i}}\text{|?K?}\text{N}$, for every i ? I; and (iii) if T ? X, |T| = t, then there are λ ? $\text{N}$ indices i ? I where T ? B_i. Throughout this paper we make three restrictions on our tBD's: (1) there are no repeated blocks, i.e. $\text{B}$ will be a set of subsets of X; (2) t ? K or there are no blocks of size t; and (3) $\text{P}{}_{\mathrm{k}}\text{(X)?}\text{B}$ or $\text{B}$ does not contain all k-subsets of X for any t<k?v. Note then that X ? $\text{B}$. Also, if we give the parameters of a specific tBD, then we will choose a minimal K.We focus on the $\text{t?((}\text{p}\text{2}\text{), K, λ)}$ designs with the symmetric group S_p as automorphism group, i.e. X will be the set of $\text{v = (}\text{p}\text{2}\text{)}$ labelled edges of the undirected complete graph K_p and if B ? $\text{B}$ then all subgraphs of K_p isomorphic to B are also in $\text{B}$. Call such tBD's ‘graphical tBD's’. We determine all graphical tBD's with λ = 1 or 2 which will include one with parameters 4?(15,{5,7},1).     

The t-median function on graphs

A median of a sequence π=x₁,x₂,…,x_k of elements of a finite metric space (X,d) is an element x for which is minimum. The function M with domain the set of all finite sequences on X and defined by M(π)={x:x is a median of π} is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(π), a generalization of the median function is introduced and studied on various graphs and ordered sets. In addition, new results are presented for median graphs.     

Representation theorems for t-Wright convexity

In the present paper we prove some representation theorems for t-Wright convex functions, as a consequence of a support theorem, which was proved by the author in earlier paper.     

The t#-property for integral domains

Generalizing work of Gilmer and Heinzer, we define a t#-domain to be a domain R in which for any two distinct subsets and of the set of maximal t-ideals of R. We provide characterizations of these domains, and we show that polynomial rings over t#-domains are again t#-domains. Finally, we study overrings of t#-domains.     

On maximal t-linearly independent sets

Consider a finite t + r ? 1 dimensional projective space PG(t + r ? 1, s) over a Galois field GF(s) of order s = ?^h, where ? and h are positive integers and ? is the prime characteristic of the field. A collection of k points in PG (t + r ? 1, s) constitutes an L(t, k)-set if no t of them are linearly dependent. An L(t, k)-set is maximal if there exists no other L(t, k′)-set with k′ > k. The largest k for which an L(t, k)-set exists is denoted by M_t(t + r, s). K. A. Bush [3] established that M_t(t, s) = t + 1 for t ? s. The purpose of this paper is to generalize this result and study M_t(t + r, s) for t, r, and s in certain relationships.