Related papers: Lattice structures for bisimilar Probabilistic Aut…
This is a survey on disjointly homogeneous Banach lattices and their applicactions. Several structural properties of this class are analyzed. In addition we show how these spaces provide a natural framework for studying the compactness of…
We construct Poisson structures for Ermakov systems, using the Ermakov invariant as the Hamiltonian. Two classes of Poisson structures are obtained, one of them degenerate, in which case we derive the Casimir functions. In some situations,…
We establish character rigidity for all non-uniform higher-rank irreducible lattices in semisimple groups of characteristic other than 2. This implies stabilizer rigidity for probability measure preserving actions and rigidity of invariant…
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree…
We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However,…
In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the…
We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
By examining the behaviour of the "SLAC" lattice derivative operators, it is found that lattices with an even number of sites have a somewhat strange self-consistency requirement for extra structure in the spatial derivative operator, which…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…
An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…
In any connected non-compact semi-simple Lie group without factors locally isomorphic to SL_2(R), there can be only finitely many lattices (up to isomorphism) of a given covolume. We show that there exist arbitrarily large families of…
We recover the rays in the tensor product of Hilbert spaces within a larger class of so called `states of compoundness', structured as a complete lattice with the `state of separation' as its top element. At the base of the construction…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We generalize Toda--like integrable lattice systems to non--symmetric case. We show that they possess the bi--Hamiltonian structure.