This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...