Related papers: Unambiguously coded shifts
This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We discuss a classical nonlinear oscillator, which is proved to be a superintegrable system for which the bounded motions are quasiperiodic oscillations and the unbounded (scattering) motions are represented by hyperbolic functions. This…
A refinement of the classic equivalence relation among Cauchy sequences yields a useful infinitesimal-enriched number system. Such an approach can be seen as formalizing Cauchy's sentiment that a null sequence "becomes" an infinitesimal. We…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over…
We show that the imperceptibility of several existing linguistic steganographic systems (Fang et al., 2017; Yang et al., 2018) relies on implicit assumptions on statistical behaviors of fluent text. We formally analyze them and empirically…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
We enrich the Lambek calculus with the cyclic shift operation, which is expected to model the closure operator of formal languages with respect to cyclic shifts. We introduce a Gentzen-style calculus and prove cut elimination. Secondly, we…
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability…
A formal sequent system dealing with Menelaus' configurations is introduced in this paper. The axiomatic sequents of the system stem from 2-cycles of Delta-complexes. The Euclidean and projective interpretations of the sequents are defined…
Real spherical designs and real and complex projective designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code. In contrast,…
In this note we use Blanchfield forms to study knots that can be turned into an unknot using a single $\overline{t}_{2k}$ move.
A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may…
We study skew-tolerant Gray codes, which are Gray codes in which changes in consecutive codewords occur in adjacent positions. We present the first construction of asymptotically non-vanishing skew-tolerant Gray codes, offering an…
In this paper, we provide a conceptual new construction of the algebraic structure on the pair of the Hochschild cohomology spectrum (cochain complex) and Hochschild homology spectrum, which is analogous to the structure of calculus on a…
In this work we use the well known formalism developed by Faddeev and Jackiw to introduce noncommutativity within two nonlinear systems, the SU(2) Skyrme and O(3) nonlinear sigma models. The final result is the Lagrangian formulations for…
In this paper, we present a new hypercomplex number system, Trinition, that has an unusual structure of commutativity, noncommutativity, nonassociativity, and deformability.
This paper discusses stability and robustness properties of a recently proposed observer algorithm for linear time varying systems. The observer is based on the approximation and subsequent modification of the non-negative Lyapunov…
Building software-driven systems that are easily understood becomes a challenge, with their ever-increasing complexity and autonomy. Accordingly, recent research efforts strive to aid in designing explainable systems. Nevertheless, a common…