We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...