Results 11 to 20 of about 7,845,575 (284)

Complexity of unification in free groups and free semi-groups [PDF]

open access: yesProceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
It is proved that the exponent of periodicity of a minimal solution of a word equation is at most 2/sup 2.54n/, where n is the length of the equation. Since the best known lower bound is 2/sup 0.31n/, this upper bound is almost optimal and exponentially better than the original bound.
Antoni Koscielski, Leszek Pacholski
openaire   +1 more source

The R property for free groups, free nilpotent groups and free solvable groups [PDF]

open access: yesBulletin of the London Mathematical Society, 2014
Let $F$ be either a free nilpotent group of a given class and of finite rank or a free solvable group of a certain derived length and of finite rank. We show precisely which ones have the $R_{\infty}$ property. Finally, we also show that the free group of infinite rank does not have the $R_{\infty}$ property.
Dekimpe, Karel, Gonçalves, Daciberg
openaire   +3 more sources

From mapping class groups to automorphism groups of free groups [PDF]

open access: yes, 2005
We show that the natural map from the mapping class groups of surfaces to the automorphism groups of free groups, induces an infinite loop map on the classifying spaces of the stable groups after plus construction.
Wahl, Nathalie
core   +2 more sources

Free paratopological groups

open access: yesApplied General Topology, 2015
Let FP(X) be the free paratopological group on a topological space X in the sense of Markov. In this paper, we study the group FP(X) on a $P_\alpha$-space $X$ where $\alpha$ is an infinite cardinal and then we prove that the group FP(X) is an Alexandroff
Ali Sayed Elfard
doaj   +1 more source

Annotation-free delineation of prokaryotic homology groups.

open access: yesPLoS Computational Biology, 2022
Phylogenomic studies of prokaryotic taxa often assume conserved marker genes are homologous across their length. However, processes such as horizontal gene transfer or gene duplication and loss may disrupt this homology by recombining only parts of genes,
Yongze Yin, Huw A Ogilvie, Luay Nakhleh
doaj   +1 more source

Algorithmic problems for free-abelian times free groups [PDF]

open access: yes, 2013
We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of $\ZZ^m \times ...
Delgado, J., Ventura, E.
core   +4 more sources

Subset currents on free groups [PDF]

open access: yes, 2012
We introduce and study the space of \emph{subset currents} on the free group $F_N$. A subset current on $F_N$ is a positive $F_N$-invariant locally finite Borel measure on the space $\mathfrak C_N$ of all closed subsets of $\partial F_N$ consisting of at
D. D’Angeli   +40 more
core   +1 more source

Free Boolean Topological Groups

open access: yesAxioms, 2015
Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given.
Ol’ga Sipacheva
doaj   +1 more source

On Sum-Free Subsets of Abelian Groups

open access: yesAxioms, 2023
In this paper, we discuss some of the key properties of sum-free subsets of abelian groups. Our discussion has been designed with a broader readership in mind and is hence not overly technical.
Renato Cordeiro de Amorim
doaj   +1 more source

FREE KNOTS AND GROUPS

open access: yesJournal of Knot Theory and Its Ramifications, 2010
Free knots are a simplification of virtual knots obtained by forgetting arrow/sign information at classical crossings. First non-trivial examples of free knots were constructed recently by the second named author. By using parity considerations, we construct invariants of free knots valued in certain groups.
Manturov V.O., Manturov O.V.
openaire   +6 more sources

Home - About - Disclaimer - Privacy