Related papers: Characterizing Weighted MSO for Trees by Branching…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…
We study the weighted composition operators between the Lipschitz space and the space of bounded functions on the set of vertices of an infinite tree. We characterized the boundedness, the compactness, and the boundedness from below of…
We give a definition of an operad with general groups of equivariance suitable for use in any symmetric monoidal category with appropriate colimits. We then apply this notion to study the 2-category of algebras over an operad in Cat. We…
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and…
We prove a boundedness criterion for a class of dyadic multilinear forms acting on two-dimensional functions. Their structure is more general than the one of classical multilinear Calder\'{o}n-Zygmund operators as several functions can now…
We revisit the twisted multiplicativity property of Voiculescu's S-transform in the operator-valued setting, using a specific bijection between planar binary trees and noncrossing partitions.
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
Kadison's transitivity theorem implies that, for irreducible representations of C*-algebras, every invariant linear manifold is closed. It is known that CSL algebras have this propery if, and only if, the lattice is hyperatomic (every…
This paper provides a fully abstract semantics for value-passing CCS for trees (VCCTS). The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. The labelled transition…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
We study a circular order on labelled, m-edge-coloured trees with k vertices, and show that the set of such trees with a fixed circular order is in bijection with the set of RNA m-diagrams of degree k, combinatorial objects which can be…
The Schr\"odinger operator on a metric tree is a family of ordinary differential operators on its edges complemented by certain matching conditions at the vertices. The regular trees are highly symmetric. This allows one to construct an…
We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
In the paper we consider some piecewise deterministic Markov process whose continuous component evolves according to semiflows, which are switched at the jump times of a Poisson process. The associated Markov chain describes the states of…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…