Related papers: Lattice structures for bisimilar Probabilistic Aut…
Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
Probabilistic B\"uchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of…
We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To…
The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…
This paper is mainly a review of the multi--Hamiltonian nature of Toda and generalized Toda lattices corresponding to the classical simple Lie groups but it includes also some new results. The areas investigated include master symmetries,…
This paper is an investigation of a procedure for constructing lattices by means of taking the sum of a pair of isometric lattices. We present various general results pertaining to this construction and discuss several examples of it…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…
We build models using an indiscernible model sub-structures of ${\kappa} \ge {\lambda}$ and related more complicated structures. We use this to build various Boolean algebras.
In this work, we study the transmission properties of one dimensional finite periodic systems with $\mathcal{PT}$-symmetry. A simple closed form expression is obtained for the total transmittance from a lattice of N cells, that allows us to…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are…
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…