Related papers: On symmetric higher-dimensional automata and bisim…
The hierarchical distribution matching (Hi-DM) approach for probabilistic shaping is described. The potential of Hi-DM in terms of trade-off between performance,complexity, and memory is illustrated through three case studies.
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
The topological and metrical equivalence of fractals is an important topic in analysis. In this paper, we use a class of finite state automata, called $\Sigma$-automaton, to construct psuedo-metric spaces, and then apply them to the study…
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a…
While there is substantial need for dependence models in higher dimensions, most existing models quickly become rather restrictive and barely balance parsimony and flexibility. Hierarchical constructions may improve on that by grouping…
We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be $\SIGMA^1_1$-hard. We do not go into much detail, since the constructions are relatively standard.
In this paper, we show that three different generalized similarities enclose all unitary and anti-unitary symmetries that induce exceptional points in lower-dimensional non-Hermitian systems. We prove that the generalized similarity…
A similarity transformation is constructed through which a system of particles interacting with inverse-square two-body and harmonic potentials in one dimension, can be mapped identically, to a set of free harmonic oscillators. This…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we…
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided by this theory, we propose automata cascades as a structured, modular, way to describe automata as…
Pseudo-harmonic morphisms give rise on the domain space to a distribution which admits an almost complex structure compatible with the given Riemannian metric. We shall show that this property, together with the harmonicity, are preserved…
We consider generic optimal Bayesian inference, namely, models of signal reconstruction where the posterior distribution and all hyperparameters are known. Under a standard assumption on the concentration of the free energy, we show how…
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset construction has been lifted to a more general framework that…
Given a quaternionic manifold $M$ with a certain $\mathrm{U}(1)$-symmetry, we construct a hypercomplex manifold $M'$ of the same dimension. This construction generalizes the quaternionic K\"ahler/hyper-K\"ahler-correspondence. As an example…
We extend the definition of generalized parity $P$, charge-conjugation $C$ and time-reversal $T$ operators to nondiagonalizable pseudo-Hermitian Hamiltonians, and we use these generalized operators to describe the full set of symmetries of…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton $\mathcal{A}$ is determinizable by pruning (DBP) if we can obtain a deterministic automaton equivalent to $\mathcal{A}$ by removing some of its…
It has been shown that a positive semi-definite Hamiltonian H, that has a tridiagonal matrix representation in a given basis, can be represented in the form H = A{\dag}A, where A is a forward shift operator playing the role of an…