Related papers: Fixed points of morphisms among binary generalized…
We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic…
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
We study in this paper some criterions to get polarized morphisms between abelian varieties. We deduce explicit dynamical systems with particular intersection properties.
We define a subgroup of the universal sofic group, obtained as the normaliser of a separable abelian subalgebra. This subgroup can be obtained as an extension by the group of automorphisms on a standard probability space. We show that each…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
We investigate fixed subgroups of automorphisms of generalised Baumslag-Solitar (GBS) groups. Our main results are for automorphisms leaving a Bass-Serre tree invariant, under the assumption that all edge stabilisers are strictly contained…
Let $G$ be a group of collineations of a finite thick generalised quadrangle $\Gamma$. Suppose that $G$ acts primitively on the point set $\mathcal{P}$ of $\Gamma$, and transitively on the lines of $\Gamma$. We show that the primitive…
We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…
We obtain explicit formulas for the rational homotopy groups of generalised symmetric spaces, i.e., the homogeneous spaces for which the isotropy subgroup appears as the fixed point group of some finite order automorphism of the group. In…
We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to…
We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope $\alpha$, there exists exactly six minimal squares in its language (a minimal square does not have a square as a proper prefix). A…
This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…
We ask questions generalizing uniform versions of conjectures of Mordell and Lang and combining them with the Morton--Silverman conjecture on preperiodic points. We prove a few results relating different versions of such questions.
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…
We study the homomorphisms between scalar generalized Verma modules. We conjecture that any homomorphism between is composition of elementary homomorphisms. The purpose of this article is to show the conjecture is affirmative for many…
We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…
In this paper we propose a refinement of Sims conjecture concerning the cardinality of the point stabilizers in finite primitive groups and we make some progress towards this refinement. In this process, when dealing with primitive groups…
We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.