Classification of some countable descendant-homogeneous digraphs

For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable descendant-homogeneous digraph in which the descendant set of any vertex is isomorphic to G.Comment: 16 page

Continuity argument revisited: geometry of root clustering via symmetric products

We study the spaces of polynomials stratified into the sets of polynomial with fixed number of roots inside certain semialgebraic region $\Omega$, on its border, and at the complement to its closure. Presented approach is a generalisation, unification and development of several classical approaches to stability problems in control theory: root clustering ($D$-stability) developed by R.E. Kalman, B.R. Barmish, S. Gutman et al., $D$-decomposition(Yu.I. Neimark, B.T. Polyak, E.N. Gryazina) and universal parameter space method(A. Fam, J. Meditch, J.Ackermann). Our approach is based on the interpretation of correspondence between roots and coefficients of a polynomial as a symmetric product morphism. We describe the topology of strata up to homotopy equivalence and, for many important cases, up to homeomorphism. Adjacencies between strata are also described. Moreover, we provide an explanation for the special position of classical stability problems: Hurwitz stability, Schur stability, hyperbolicity.Comment: 45 pages, 4 figure

On Ramsey properties of classes with forbidden trees

Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F) by unary relations to an amalgamation class. This expanded class, enhanced with a linear ordering, has the Ramsey property.Comment: Keywords: forbidden substructure; amalgamation; Ramsey class; partite method v2: changed definition of expanded class; v3: final versio

Developing a Mathematical Model for Bobbin Lace

Bobbin lace is a fibre art form in which intricate and delicate patterns are created by braiding together many threads. An overview of how bobbin lace is made is presented and illustrated with a simple, traditional bookmark design. Research on the topology of textiles and braid theory form a base for the current work and is briefly summarized. We define a new mathematical model that supports the enumeration and generation of bobbin lace patterns using an intelligent combinatorial search. Results of this new approach are presented and, by comparison to existing bobbin lace patterns, it is demonstrated that this model reveals new patterns that have never been seen before. Finally, we apply our new patterns to an original bookmark design and propose future areas for exploration.Comment: 20 pages, 18 figures, intended audience includes Artists as well as Computer Scientists and Mathematician