Publication:4828542

From MaRDI portal
Revision as of 03:07, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1051.05001MaRDI QIDQ4828542

R. A. Bailey

Publication date: 22 November 2004



05B05: Combinatorial aspects of block designs

05E30: Association schemes, strongly regular graphs

05B15: Orthogonal arrays, Latin squares, Room squares

62K10: Statistical block designs

05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics


Related Items

Sesqui-arrays, a generalisation of triple arrays, ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN, Cyclotomic association schemes of broad classes and applications to the construction of combinatorial structures, Locally finite complexes, modules and generalized information systems, The geometry of diagonal groups, Tests and relevancies for the hypotheses of an orthogonal family in a model with orthogonal block structure, Graphs defined on groups, Unnamed Item, Association schemes for diagonal groups, Decision systems in rough set theory: A set operatorial perspective, SYMMETRY GEOMETRY BY PAIRINGS, CONTINUOUS ASSOCIATION SCHEMES AND HYPERGROUPS, The geometry of sets of orthogonal frequency hypercubes, Preface, Estimability of variance components when all model matrices commute, Fusions of tensor powers of Johnson schemes, Perfect state transfer over interacting boson networks associated with group schemes, Bose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walks, Association schemes based on the subspaces of type \((2, 1, 0)\) in singular symplectic space over finite fields, Decomposition tables for experiments. II: Two-one randomizations, The subconstituent algebra of strongly regular graphs associated with a Latin square, Trees, wreath products and finite Gelfand pairs, The Erdős-Ko-Rado property for some 2-transitive groups, Nested row-column designs for near-factorial experiments with two treatment factors and one control treatment, Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm, Cyclotomy over products of finite fields and combinatorial applications, The subconstituent algebra of a Latin square, Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory, Crested products of Markov chains, The mathematics of Donald Gordon Higman, Variance and concurrence in block designs, and distance in the corresponding graphs, Commutative association schemes, Markov chains on orthogonal block structures, Decomposition tables for experiments. I: A chain of randomizations, Tamaschke's results on Schur rings and a generalization of association schemes, Perturbations and projections of Kalman-Bucy semigroups, Partially metric association schemes with a multiplicity three, Association schemes and permutation groups, Partial difference sets and amorphic group schemes from pseudo-quadratic bent functions, New perspectives of granular computing in relation geometry induced by pairings, Spectral PCA for MANOVA and data over binary trees, Substitutes for the non-existent square lattice designs for 36 varieties, Quadratic residue codes, rank three groups and PBIBDs, Jordan schemes, Finite Gelfand pairs and cracking points of the symmetric groups, Schur rings over infinite groups. II, Set relations and set systems induced by some families of integral domains, Isomorphism check for \(2^n\) factorial designs with randomization restrictions, What is a design? how should we classify them?, Estimation and incommutativity in mixed models, Simplicial complexes and closure systems induced by indistinguishability relations, On generalized strongly regular graphs, Hypergroups derived from random walks on some infinite graphs, Theorems of Erdős-Ko-Rado type in polar spaces, Quantum search in structured database using local adiabatic evolution and spectral methods, A new proof for the Erdős-Ko-Rado theorem for the alternating group, Buildings and Hecke algebras., The construction of association schemes by parameter amendment, Motifs, coherent configurations and second order network generation, Fusions of the generalized Hamming scheme on a strongly-regular graph, Topological quantum structures from association schemes, On symmetric association schemes and associated quotient-polynomial graphs, Designs, Groups and Computing, Uniform Semi-Latin Squares and Their Schur-Optimality, The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures, Perfect state transfer of a qudit over underlying networks of group association schemes, Circulant association schemes on triples, Commutative Schur Rings of Maximal Dimension, Reversible Markov structures on divisible set partitions