We define a discrete ω-sequence of index sets to be a sequence {θ An}n ≥ 0 of index sets of classes of recursively enumerable sets, such that for each n, θ An + 1 is an immediate successor of θ An in ...

De Bruijn sequences are cyclic sequences characterised by the property that every possible subsequence of a given length over a fixed alphabet appears exactly once. Their study intertwines with that ...

Compositions are conceptualized as non alternating sequences of blocks of non-decreasing and strictly decreasing partitions. We find the generating function F(x, y, q) where x marks the size of the ...

Majors usually begin by taking the calculus sequence. By the end of their first year, it is highly suggested for students to take either of the introductory proof classes (Discrete Math or Number ...