Related papers: Embedding a $\theta$-invariant code into a complet…
In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…
In this work, we explore the concept of Watson-Crick conjugates, also known as $\theta$-conjugates (where $\theta$ is an antimorphic involution), of words and languages. This concept extends the classical idea of conjugates by incorporating…
This paper determines the group of continuous invariants corresponding to an inner function $ \Theta $ with finitely many singularities on the unit circle $T$; that is, the continuous mappings $g: T \to T$ such that $\Theta \circ g = \Theta…
A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…
Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 +…
In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…
Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…
We demonstrate that the soft supersymmetry-breaking terms in a N=1 theory can be linked by simple renormalisation group invariant relations which are valid to all orders of perturbation theory. In the special case of finite N=1 theories,…
In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…
In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a countable set. More specifically, we show…
It is a recent observation that entanglement classification for qubits is closely related to local $SL(2,\CC)$-invariants including the invariance under qubit permutations, which has been termed $SL^*$ invariance. In order to single out the…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…
Rank invariants are a parametrized version of Betti numbers of a space multi-filtered by a continuous vector-valued function. In this note we give a sufficient condition for their finiteness. This condition is sharp for spaces embeddable in…
To a homotopy algebra one may associate its deformation complex, which is naturally a differential graded Lie algebra. We show that infinity quasi-isomorphic homotopy algebras have L-infinity quasi-isomorphic deformation complexes by an…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
We give a language-parametric solution to the problem of total correctness, by automatically reducing it to the problem of partial correctness, under the assumption that an expression whose value decreases with each program step in a…