Related papers: Odometer Based Systems
A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S|that contains a representation of each element in S exactly once as a substring. If S is the set of k-subsets of [n] = {1, 2, . . . , n}, it is…
The biopolymers actin and microtubules are often in an ongoing assembling/disassembling state far from thermal equilibrium. Above a critical density this leads to spatially periodic patterns, as shown by a scaling argument and in terms of a…
We consider the one-parameter family of interval maps arising from generalized continued fraction expansions known as alpha-continued fractions. For such maps, we perform a numerical study of the behaviour of metric entropy as a function of…
Session-types specify communication protocols for communicating processes, and session-typed languages are often specified using substructural operational semantics given by multiset rewriting systems. We give an observed communication…
We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…
We demonstrate that a Poisson structure can always be associated to a general nonautonomous 3D vector field of ODEs by means of a diffeomorphism that preserves both the orientation and the volume of phase-space. The only prerequisite is the…
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
In this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every aperiodic dynamical system, for every increasing sequence $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and…
Individual phases are commonly considered as the building blocks of materials. However, the accurate theoretical prediction of properties of individual phases remains elusive. The top-down approach by decoding genomic building blocks of…
Recurrent auto-encoder model summarises sequential data through an encoder structure into a fixed-length vector and then reconstructs the original sequence through the decoder structure. The summarised vector can be used to represent time…
Behavioural distances of transition systems modelled via coalgebras for endofunctors generalize traditional notions of behavioural equivalence to a quantitative setting, in which states are equipped with a measure of how (dis)similar they…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
A broad class of blocked or jammed configurations of particles on the one-dimensional lattice can be characterized in terms of local rules involving only the lengths of clusters of particles (occupied sites) and of holes (empty sites).…
Many navigation problems can be formulated as observer design on linear observed systems with a two-frame group structure, on which an invariant filter can be implemented with guaranteed consistency and stability. It's still unclear how…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
The Sombor index, a degree-based topological descriptor introduced by Gutman in 2021, lacks closed-form expressions for complex hierarchical trees with multi-level pendant structures and nonuniform degree distributions, despite extensive…
This paper introduces an objective metric for evaluating a parsing scheme. It is based on Shannon's original work with letter sequences, which can be extended to part-of-speech tag sequences. It is shown that this regular language is an…
Since their introduction by Atserias, Kolaitis, and Vardi in 2004, proof systems where each line is represented by an ordered binary decision diagram (OBDD) have been intensively studied as they allow to compactly represent Boolean…
We consider parameterized concurrent systems consisting of a finite but unknown number of components, obtained by replicating a given set of finite state automata. Components communicate by executing atomic interactions whose participants…