Let k be an arbitrary given positive integer and let f(x) ∈ Z[x] be a quadratic polynomial with D as its discriminant and a as the coefficient of its quadratic
A k-hypertournament H on n vertices with 2 ≤ k ≤ n is a pair H =(V, AH),where V is a set of n vertices and AH is a set of k-tuples of vertices, called arcs, s
The classical parking functions are defined as follows.There are n parking spaces which are arranged in a line, numbered 0 to n-1 left to right and n drivers la
This paper proves that for any graph G and any positive integer m, G is (2m, m)-paintable if and only if G is 2-paintable.It was asked by Zhu in 2009 whether k-
Concept lattice theory is an efficient tool for data analysis.Reduction of attributes and objects for a context is an important issue in concept lattice theory.
I will talk about multipartite regular digraphs, tournaments, Hadamard matrices and small imprimitve association schemes.These combinatorial configurations are
The permutation group (S)n, signed permutation group Bn and even-signed permutation group Dn are known as the Coxeter groups of type A, B and D, respectively.On