Related papers: A Classification of Symbolic Transition Systems
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
We extend the concept of classicality in quantum optics to spin states. We call a state ``classical'' if its density matrix can be decomposed as a weighted sum of angular momentum coherent states with positive weights. Classical spin states…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way…
We consider a class of systems over finite alphabets, namely discrete-time systems with linear dynamics and a finite input alphabet. We formulate a notion of finite uniform bisimulation, and motivate and propose a notion of regular finite…
All finite sets of equiangular lines spanning finite-dimensional unitary spaces are determined for which the action on the lines of the set-stabilizer in the unitary group is 2-transitive with a regular normal subgroup.
In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections…
We introduce a class of states of a composite quantum system, the so-called cross states, that turn out to play a major role in the theory of entanglement for a genuinely infinite-dimensional bipartite system. In the case where at least one…
We classify all finite groups with five relative commutativity degrees. Also, we give a partial answer to our previous conjecture on a lower bound of the number of relative commutativity degrees of finite groups.
This paper presents a compositional framework for the construction of symbolic models for a network composed of a countably infinite number of finite-dimensional discrete-time control subsystems. We refer to such a network as infinite…
The T and Y-systems are ubiquitous structures in classical and quantum integrable systems. They are difference equations having a variety of aspects related to commuting transfer matrices in solvable lattice models, q-characters of…
We consider a particle system on $Z^d$ with finite state space and interactions of infinite range. Assuming that the rate of change is continuous and decays sufficiently fast, we introduce a perfect simulation algorithm for the stationary…
We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
In this paper we consider spinor Bose-Einstein condensates with spin f=5 and f=6 in the presence and absence of external magnetic field at the mean field level. We calculate all of so-called inert-states of these systems. Inert-states are…
We study the thermal equilibrium states (KMS states) of infinitely degenerate Hamiltonians, in particular, we study the example of the Landau levels. We classify all KMS states in an example of algebra suitable for describing infinitely…
In this work we develop some fifth-order integrable coupled systems of weight $0$ and $1$ which possess seventh-order symmetry. We establish four new systems, where in some cases, related recursion operator and bi-Hamiltonian formulations…
In this paper we introduce the concept of O-asymptotic classes of finite structures, melding ideas coming from 1-dimensional asymptotic classes and o-minimality. The results we present here include a cell-decomposition result for…
Formal control synthesis approaches over stochastic systems have received significant attention in the past few years, in view of their ability to provide provably correct controllers for complex logical specifications in an automated…
We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…