The following pages link to Chester J. Salwach (Q730699):
Displaying 50 items.
- (Q587857) (redirect page) (← links)
- Enumeration formulas for latin and frequency squares (Q686458) (← links)
- A construction method of a class of SIDS\((n)\) (Q687133) (← links)
- Existence of affine \(\alpha\)-resolvable PBIB designs with some constructions (Q730700) (← links)
- On avoiding odd partial Latin squares and \(r\)-multi Latin squares (Q860463) (← links)
- When is a partial Latin square uniquely completable, but not its completable product? (Q924972) (← links)
- Blocker sets, orthogonal arrays and their application to combination locks (Q924978) (← links)
- On the range of influences in back-circulant Latin squares (Q924979) (← links)
- A constraint on the biembedding of Latin squares (Q1003587) (← links)
- Classification of simple 2-(11,3,3) designs (Q1011489) (← links)
- New examples of Euclidean tight 4-designs (Q1011507) (← links)
- Uniformly resolvable three-wise balanced designs with block sizes four and six (Q1045185) (← links)
- On generalized Steiner systems and semi-biplanes (Q1060416) (← links)
- Full and quarter plane complete infinite Latin squares (Q1126210) (← links)
- Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\) (Q1126282) (← links)
- The (16,6,2) designs (Q1134765) (← links)
- Matrix constructions of divisible designs (Q1175275) (← links)
- Blocking sets in designs with block size four. II (Q1175420) (← links)
- \(t\)-designs with few intersection numbers (Q1175994) (← links)
- A characterization of Hermitian curves (Q1176183) (← links)
- Balanced incomplete block design and the construction of geodetic blocks (Q1178404) (← links)
- Quasi-symmetric designs and biplanes of characteristic three (Q1186113) (← links)
- Inequalities and bounds for quasi-symmetric 3-designs (Q1193568) (← links)
- \(t\)-divisible designs from imprimitive permutation groups (Q1199778) (← links)
- The four biplanes with k=9 (Q1245222) (← links)
- The four known biplanes with k=11 (Q1259855) (← links)
- The lost theorem (Q1272410) (← links)
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles (Q1277147) (← links)
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model (Q1301862) (← links)
- \((2s-1)\)-designs with \(s\) intersection numbers (Q1312328) (← links)
- Nonexistence of certain perfect arrays (Q1322259) (← links)
- On existence of two symbol complete orthogonal arrays (Q1323840) (← links)
- Signs on Latin squares (Q1342759) (← links)
- On even and odd latin squares (Q1344239) (← links)
- On the number of even and odd Latin squares of order \(p+1\) (Q1362611) (← links)
- The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture (Q1364322) (← links)
- Centrally symmetric and magic rectangles (Q1377676) (← links)
- Construction of referee squares (Q1377852) (← links)
- Avoiding partial Latin squares and intricacy (Q1377867) (← links)
- A decoding algorithm for orthogonal Latin square codes (Q1386815) (← links)
- Generalized whist tournament designs (Q1398248) (← links)
- Completing the spectrum of \(r\)-orthogonal Latin squares (Q1398282) (← links)
- Enumeration of balanced ternary designs. (Q1428560) (← links)
- Completing the spectrum of 2-chromatic \(S(2,4,v)\) (Q1598801) (← links)
- The existence theorem for group divisible designs of large order (Q1601428) (← links)
- A family of perfect factorisations of complete bipartite graphs (Q1601439) (← links)
- Pairwise balanced designs from finite fields (Q1808780) (← links)
- The spectrum of \(\text{HSOLSSOM}(h^ n)\) where \(h\) is even (Q1815306) (← links)
- More mutually disjoint Steiner systems \(S(5,8,24)\) (Q1873823) (← links)
- On non-polynomial Latin squares (Q1877356) (← links)
