Journal of Combinatorial Theory, Series A 

TL;DR: The polynomial degree of a bent function P ( x ) is studied, as are the properties of the Fourier transform of (−1) P(x) , and a connection with Hadamard matrices.

TL;DR: Asymptotics are obtained for the number of n × n symmetric non-negative integer matrices subject to the following constraints: each row sum is specified and bounded, and a specified “sparse” set of entries must be zero.

TL;DR: This paper will answer the question in the affirmative by determining the exact upper bound of T if T is a family of subsets of some infinite set S then either there exists to each number n a set A ⊂ S with |A| = n such that |T ∩ A| = 2n or there exists some number N such that •A| c for each A⩾ N and some constant c.

TL;DR: If the simplicial complex formed by the neighborhoods of points of a graph is (k − 2)-connected then the graph is not k-colorable, and Kneser's conjecture is proved, asserting that if all n-subsets of a (2n − k)-element set are divided into k + 1 classes, one of the classes contains two disjoint n- subsets.

TL;DR: The characters of the adjacency algebra of Ω, which yield the MacWilliams transform on q-distance enumerators, are expressed in terms of generalized Krawtchouk polynomials.