A latin square of order n is an n× n array of n symbols in which each symbol occurs exactly
once in each row and column. A transversal of such a square is a set of n entries containing …

Combinatorial t‐designs have wide applications in coding theory, cryptography,
communications, and statistics. It is well known that the supports of all codewords with a …

" The William Lowell Putnam Mathematical Competition is the premier undergraduate
mathematical competition in North America. This volume contains problems from the years …

Let μ be a positive measure on R^d invariant under the group of reflections and
permutations, and let m be a natural number. We describe a method to construct cubature …

Abstract In 1982, Cameron and Liebler investigated certain special sets of lines in PG (3, q),
and gave several equivalent characterizations. Due to their interesting geometric and …

Interplay between coding theory and combinatorial t-designs has attracted a lot of attention.
It is well known that the supports of all codewords of a fixed Hamming weight in a linear …

Given a graph G, a K_3-decomposition of G, also called a triangle decomposition, is a set of
subgraphs isomorphic to K_3 whose edges partition the edge set of G. Further, a rational …

In this paper we modify Buchberger's S-pair reduction algorithm for computing a Gröbner
basis of a toric ideal so as to apply it to an integer program (IP) in inequality form with fixed …

In this paper, we survey constructions of and nonexistence results on combinatorial/
geometric structures which arise from unions of cyclotomic classes of finite fields. In …

One of the central problems of extremal hypergraph theory is the description of unavoidable
subhypergraphs, in other words, the Turán problem. Let a=(a1,…, ap) be a sequence of …