Related papers: One-sided Hom shifts
In \cite{SH}, A. L. Shields proved a well-known theorem for the similarity of unilateral weighted shift operators. By using the generalization of this theorem for multivariable weighted shifts and the curvature of holomorphic bundles, we…
We provide two alternative ways to determine the number of (bi-)twisted conjugacy classes in a finite group: one by counting certain irreducible characters and one by counting certain twisted conjugacy classes of other endomorphisms. In…
By showing the compatibility of folding almost positive roots and folding cluster categories, we prove that there is a one-to-one correspondence between seeds and tilting seeds in non-simply-laced finite cases.
We give evidence for a uniformization-type conjecture, that any algebraic variety can be altered into a variety endowed with a tower of smooth fibrations of relative dimension one.
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
It has been proposed that the Poincare and some other symmetries of noncommutative field theories should be twisted. Here we extend this idea to gauge transformations and find that twisted gauge symmetries close for arbitrary gauge group.…
In this paper we develop an axiomatic approach to coarse homology theories. We prove a uniqueness result concerning coarse homology theories on the category of `coarse CW-complexes'. This uniqueness result is used to prove a version of the…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
We show that the Union-Closed Conjecture holds for the union-closed family generated by the cyclic translates of any fixed set.
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
We will characterize topological conjugate one-sided topological Markov shifts in terms of their subgroups of continuous full groups and subalgebras of Cuntz--Krieger algebras.
We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that…
We prove that the joint embedding property is undecidable for hereditary graph classes, via a reduction from the tiling problem. The proof is then adapted to show the undecidability of the joint homomorphism property as well.
Given a finite $\mathbb{Z}_2$-graded group $\hat{\mathsf{G}}$ with ungraded subgroup $\mathsf{G}$ and a twisted cocycle $\hat{\lambda} \in Z^n(B \hat{\mathsf{G}}; \mathsf{U}(1)_{\pi})$ which restricts to $\lambda \in Z^n(B \mathsf{G};…
We revisit the notion of one-sided recognizability of morphisms and its relation to two-sided recognizability.
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…
We propose a geometric and categorical approach to the Hodge Conjecture for all smooth projective complex varieties. By embedding any such variety into a flat family with general fibers smooth complete intersections, we prove the conjecture…
In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…