1 citations · 2 across the 3 of their papers we have counts for
4 papers
Solvability of Mazes by Blind Robots
Stefan David, Marius Tiba
In this paper we introduce and investigate a new type of automata which turns out to be rich in deep and complex phenomena. For our model, a maze is a countable strongly connected…
Strong Ramsey Games in Unbounded Time
Stefan David, Ivailo Hartarsky, Marius Tiba
For two graphs and the strong Ramsey game on the board and with target is played as follows. Two players alternately claim edges of . The firs…
Symmetric Chain Decompositions of Products of Posets with Long Chains
Stefan David, Hunter Spink, Marius Tiba
We ask if there exists a symmetric chain decomposition of the cuboid such that no chain is "taut", i.e. no chain has a subchain of the form $(a_1,\ldots, a_k,0)\prec…
Geometric Symmetric Chain Decompositions
Stefan David, Hunter Spink, Marius Tiba
We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results re…