activity
20202023
most citedThe saturation spectrum for antichains of subsets

6 citations · 8 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2023★ 1 cited

Sizes of flat maximal antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

This is the second of two papers investigating for which positive integers there exists a maximal antichain of size in the Boolean lattice (the power set of $[n]:=\{1…

math.NT2021

What is worthy of investigation? Philosophical attitudes and their impact on mathematical development by the example of discovering 10-adic numbers

Merlin Carl, Michael Schmitz

We describe in dialogue form a possible way of discovering and investigating 10-adic numbers starting from the naive question about a `largest natural number'. Among the topics we…

math.CO2021★ 1 cited

Maximal antichains of subsets II: Constructions

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

This is the second in a sequence of three papers investigating the question for which positive integers there exists a maximal antichain of size in the Boolean lattice $B_n…

math.CO2021★ 6 cited

The saturation spectrum for antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

Extending a classical theorem of Sperner, we characterize the integers such that there exists a maximal antichain of size in the Boolean lattice , that is, the power s…

math.HO2020

Envelopes are solving machines for quadratics and cubics and certain polynomials of arbitrary degree

Michael Schmitz, André Streicher

Everybody knows from school how to solve a quadratic equation of the form graphically. But this method can become tedious if several equations ought to be solved, as f…

math.HO2020

A probabilistic way to discover the rainbow

Joscha Prochno, Michael Schmitz

"No two rainbows are the same. Neither are two packs of Skittles. Enjoy an odd mix!". Using an interpretation via spatial random walks, we quantify the probability that two randoml…