Related papers: Lattice structures for bisimilar Probabilistic Aut…

We study two subclasses of the class of automatic structures: automatic structures of polynomial growth and Presburger structures. We present algebraic characterisations of the groups and the equivalence structures in these two classes.

We present a correspondence and bisimulation between variants of parametrically polymorphic type systems and variants of finite control automata, such as FSA, PDA, tree automata and Turing machine. Within this correspondence we show that…

Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…

We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…

A bi-Hamiltonian structure is a pair of Poisson structures $\mathcal P$, $\mathcal Q$ which are compatible, meaning that any linear combination $\alpha \mathcal P + \beta \mathcal Q$ is again a Poisson structure. A bi-Hamiltonian structure…

This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…

We present a mechanism which lifts a multiplicative lattice to a (weak) ideal system on some monoid.

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

We introduce an algebraic concept of the frame for abstract conditional independence (CI) models, together with basic operations with respect to which such a frame should be closed: copying and marginalization. Three standard examples of…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.…

Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal…

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…

We show that on the boundary of the dyadic tree, any self-similar dilatation structure induces a web of interacting automata. This is a short version, for publication, of the paper arXiv:math/0612509v2

Let $\Sigma$ be the Davis complex for a Coxeter system (W,S). The automorphism group G of $\Sigma$ is naturally a locally compact group, and a simple combinatorial condition due to Haglund--Paulin determines when G is nondiscrete. The…

Let $(W,S)$ be a Coxeter system with Davis complex $\Sigma$. The polyhedral automorphism group $G$ of $\Sigma$ is a locally compact group under the compact-open topology. If $G$ is a discrete group (as characterised by Haglund--Paulin),…

We introduce a family of compatible Poisson brackets on the space of rational functions with denominator of a fixed degree and use it to derive a multi-Hamiltonian structure for a family of integrable lattice equations that includes both…

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications that involve both stochastic and timed behaviours. In this…