Related papers: Unambiguously coded shifts
We consider diffusive systems, regarded as input/output systems with a kernel given as the Fourier--Borel transform of a measure in the left half-plane. Associated with these are a family of weighted Hankel integral operators, and we…
The theory of noninterference supports the analysis of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on bisimilarity. In a nondeterministic setting, assessing…
An obfuscator is an algorithm that translates circuits into functionally-equivalent similarly-sized circuits that are hard to understand. Efficient obfuscators would have many applications in cryptography. Until recently, theoretical…
Recently, many surveys are devoted to study the Clifford Fourier transform. Dealing with the real Clifford Fourier transform introduced by Hitzer [10], we establish analogues of the classical Heisenberg's inequality and Hardy's theorem in…
Some binary quadratic operads are endowed with anticyclic structures and their characteristic functions as anticyclic operads are determined, or conjectured in one case.
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition…
The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to…
We consider the set of bimodal linear systems consisting of two linear dynamics acting on each side of a given hyperplane, assuming continuity along the separating hyperplane. Focusing on the unobservable planar ones, we obtain a simple…
Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…
We consider finite state non-deterministic but unambiguous transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality of sequences of symbols. When these transducers are strongly connected, and…
Let $B$ be a commutative algebra and $A$ be a $B$-algebra (determined by an algebra homomorphism $\varepsilon:B\rightarrow A$). M. D. Staic introduced a Hochschild like cohomology $H^{\bullet}((A,B,\varepsilon);A)$ called secondary…
We will introduce twisted cycles and their associated regulators to cohomology. We prove the conjecture that this regulator is surjective for a general smooth projective surface. We construct indecomposable twisted cycles on elliptic…
In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…
Hankel determinants of sequences related to Bernoulli and Euler numbers have been studied before, and numerous identities are known. However, when a sequence is shifted by one unit, the situation often changes significantly. In this paper…
Electronics has changed greatly during recent decades, and some its basic concepts should be revisited. Starting from the sampling procedure, we consider some mathematical, physical and engineering aspects related to singular, mainly…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…
We show that the Euclidean Snyder non-commutative space implies infinitely many different physical predictions. The distinct frameworks are specified by generalized uncertainty relations underlying deformed Heisenberg algebras. Considering…