Related papers: The Conjugacy Relation on One-sided Subshifts is N…
Commutation formulae with respect to a non-symmetric affine connection are obtained in this paper. The components of commutation formulae in this paper are covariant derivatives of tensors with respect to symmetric and non-symmetric affine…
Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two…
An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…
In this article, the theory of sheaves is studied from a categorical point of view. This perspective vastly generalizes the usual theory of sheaves of sets to a more abstract setting which allows us to investigate the theory of sheaves with…
In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…
In a recent work it has been shown that the bosonic strings could be embedded into a special class of $N=1$ fermionic strings. We argue that the superpartners of any physical state in the spectrum of this fermionic string is non-physical.…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
Let $G$ be a supersolvable group and $A$ be a conjugacy class of $G$. Observe that for some integer $\eta(AA^{-1})>0$, $AA^{-1}=\{a b^{-1}\mid a,b\in A\}$ is the union of $\eta(AA^{-1})$ distinct conjugacy classes of $G$. Set ${\bf…
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these attachments through transformation sequences and error-driven…
We prove that for any nondegenerate dendrite $D$ there exist topologically mixing maps $F : D \to D$ and $f : [0, 1] \to [0, 1]$, such that the natural extensions (aka shift homeomorphisms) $\sigma_F$ and $\sigma_f$ are conjugate, and…
We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…
We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…
The descent relations between string field theory (SFT) vertices are characteristic relations of the operator formulation of SFT and they provide self-consistency of this theory. The descent relations <V_2|V_1> and <V_3|V_1> in the NS…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…
We give an example of a computably enumerable closed subset of [0,1] that is not homeomorphic to any computably compact space. This answers a question of Koh, Melnikov and Ng.
AdS/CFT is a conjectured equivalence between a field theory without gravity (conformal field theory) and a string theory in a special curved background (anti de-Sitter space), where theories on both sides of the equivalence is…
In the article 'Recursive queries on trees and data trees' (ICDT'13), Abiteboul et al., asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is…
We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…