English
Related papers

Related papers: On the group of a rational maximal bifix code

200 papers

It is conjectured that a rational map whose coefficients are algebraic over $\Q_p$ has no wandering components of the Fatou set. R. Benedetto has shown that any counter example to this conjecture must have a wild recurrent critical point.…

Dynamical Systems · Mathematics 2007-05-23 Juan Rivera-Letelier

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

Group Theory · Mathematics 2018-05-22 Pedro V. Silva , Alexander Zakharov

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

Group Theory · Mathematics 2017-05-16 Alan J. Cain , Robert Gray , António Malheiro

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper…

Group Theory · Mathematics 2024-02-20 Peter J. Cameron , David Craven , Hamid Reza Dorbidi , Scott Harper , Benjamin Sambale

An inverse monoid $S$ is called $F$-inverse if each $\sigma$-class of $S$, where $\sigma$ is the minimum group congruence of $S$, has a maximum element with respect to the natural order of $S$. Since the property of an inverse monoid being…

Group Theory · Mathematics 2026-03-10 Igor Dolinka , Ganna Kudryavtseva

Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to…

Logic in Computer Science · Computer Science 2007-05-29 Antoine Meyer

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…

Group Theory · Mathematics 2021-11-15 Oleg Gutik , Inna Pozdnyakova

We show that $C(X)$ admits an equivalent pointwise lower semicontinuous locally uniformly rotund norm provided $X$ is Fedorchuk compact of spectral height 3. In other words $X$ admits a fully closed map $f$ onto a metric compact $Y$ such…

Functional Analysis · Mathematics 2018-11-26 S. P. Gul'ko , A. V. Ivanov , M. S. Shulikina , S. Troyanski

We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.

Group Theory · Mathematics 2015-08-20 Tullio Ceccherini-Silberstein , Michel Coornaert

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

Dynamical Systems · Mathematics 2022-04-20 Guizhen Cui , Yan Gao , Jinsong Zeng

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

Group Theory · Mathematics 2007-05-23 W. Ethan Duckworth

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…

Formal Languages and Automata Theory · Computer Science 2016-11-15 Clelia De Felice

Let X be a smooth complex projective surface. We prove that for any sufficiently big m there exists a rational dominant map f from X into a complex rational ruled surface Y, such that f is generically finite of degree m and has monodromy…

Algebraic Geometry · Mathematics 2007-05-23 Sonia Brivio , Gian Pietro Pirola

Let $w$ be a multilinear commutator word. In the present paper we describe recent results that show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely (or in some cases countably) many subgroups…

Group Theory · Mathematics 2017-03-06 Cristina Acciarri , Pavel Shumyatsky

We construct irreducible hyperfinite subfactors of index 6 with a prescribed fundamental group from a large family containing all countable and many uncountable subgroups of R_+. We also prove that there are unclassifiably many irreducible…

Operator Algebras · Mathematics 2016-07-25 Arnaud Brothier , Stefaan Vaes

Let $M$ be a cancellative commutative monoid and call a submonoid $S$ of $M$ an undermonoid if $\G(S)=\G(M)$ inside the Grothendieck group of $M$. Gotti and Li asked whether the finite factorization property is hereditary once it is known…

Group Theory · Mathematics 2026-05-28 Yutong Zhang , Yaoran Yang

Let X be a smooth variety over a field of positive characteristic, and let E be an overconvergent isocrystal on X. We establish a criterion for the existence of a "canonical logarithmic extension" of E to a good compactification of X. In…

Number Theory · Mathematics 2007-05-23 Kiran S. Kedlaya

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…

Group Theory · Mathematics 2011-12-19 Colin D. Reid

Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…

Group Theory · Mathematics 2020-03-25 Olga Sapir

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

Group Theory · Mathematics 2021-12-20 Daria Lytkina , Archil Zhurtov
‹ Prev 1 4 5 6 7 8 10 Next ›