Related papers: The Conjugacy Relation on One-sided Subshifts is N…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
We solve the lifting problem in C^*-algebras for many sets of relations that include the relations x_j^{N_j} = 0 on each variable. The remaining relations must be of the form \| p(x_1,...,x_n) \| \leq C for C a positive constant and p a…
This paper is a systematic study about the syndetically proximal relation and the possible existence of syndetically scrambled sets for the dynamics of continuous self-maps of compact metric spaces. Especially we consider various classes of…
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…
We construct a hierarchy of supersymmetric string theories by showing that the general N-extended superstrings may be viewed as a special class of the (N+1)-extended superstrings. As a side result, we find a twisted (N+2) superconformal…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
Let G be a connected reductive group. We define a map from the set of unipotent classes in G to the set of conjugacy classes in the Weyl group (assuming that the characteristic is not bad). This map is a one sided inverse of a map in the…
In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
In [Decompositions and statistics for \beta(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on \beta(1,0)-trees. We neglected, however, to prove that h indeed is an…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
Numerous fundamental database and reasoning problems are known to be NP-hard in general but tractable on instances where the underlying hypergraph structure is $\beta$-acyclic. Despite the importance of many of these problems, there has…
We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…
If $X$ is an abelian variety over a field and $L$ is an invertible sheaf, we know that the degree of the 0-cycle $L^g$ is divisible by $g!$. As a 0-cycle, it is not, even over a field of cohomological dimension 1. But we show that over a…
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
In this paper we explore the link between the theory of sheaves on graphs and noncommutative geometry showing that many concepts and constructions in the latter can be generalized and enhanced using methods coming from the former. They…
We discuss gauge theories for commutative but non-associative algebras related to the $ SO(2k+1)$ covariant finite dimensional fuzzy $2k$-sphere algebras. A consequence of non-associativity is that gauge fields and gauge parameters have to…
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
For a fixed $n\ge2$, the Houghton group $H_n$ consists of bijections of $X_n=\{1,\ldots,n\} \times \mathbb{N}$ that are `eventually translations' of each copy of $\mathbb{N}$. The Houghton groups have been shown to have solvable conjugacy…
We study symmetries between untwisted and twisted strings on asymmetric orbifolds. We present a list of asymmetric orbifold models to possess intertwining currents which convert untwisted string states to twisted ones, and vice versa. We…