Bill Whitaker: So tell me, what was this bonus question? Calcea Johnson: It was to create a new proof of the Pythagorean Theorem. And it kind of gave you a few guidelines on how would you start a ...

Abstract: In this paper, four algebraic and combinatorial constructions for optimal frequency-hopping sequence (FHS) sets employing additive groups of finite fields, u-flats in projective geometries ...

Borg, Peter and Meagher, Karen 2016. The Katona cycle proof of the Erdős–Ko–Rado theorem and its possibilities. Journal of Algebraic Combinatorics, Vol. 43, Issue. 4, p. 915.

The famous ‘Four Color Theorem’ (K. Appel and W. Haken, 1977) states that if G is planar, then χ(G) ≤ 4. Proof 1: As is the case in many theorems in combinatorial analysis, one can prove the theorem ...