Related papers: On Whitehead's first free-group algorithm, cutvert…

Decomposition plays a significant role in cooperative co-evolution which shows great potential in large scale black-box optimization. However, current popular decomposition algorithms generally require to sample and evaluate a large number…

Let $F$ be a strictly $k$-balanced $k$-uniform hypergraph with $e(F)\geq |F|-k+1$ and maximum co-degree at least two. The random greedy $F$-free process constructs a maximal $F$-free hypergraph as follows. Consider a random ordering of the…

Given a family $\mathcal{F}$ of graphs, a graph is \emph{$\mathcal{F}$-subgraph-free} if it has no subgraph isomorphic to a member of $\mathcal{F}$. We present a fixed-parameter linear-time algorithm that decides whether a planar graph can…

A hypergraph ${\cal F}$ is a set family defined on vertex set $V$. The dual of ${\cal F}$ is the set of minimal subsets $H$ of $V$ such that $F\cap H \ne \emptyset$ for any $F\in {\cal F}$. The computation of the dual is equivalent to many…

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a…

We extend a factorization theorem by Gwo\'zdziewicz and Hejmej from the ring of formal power series to any complete regular local ring $ R $. More precisely, let $ f \in R $ and assume that its Newton polyhedron has a loose edge such that…

Let (G_i | i in I) be a family of groups, let F be a free group, and let G = F *(*I G_i), the free product of F and all the G_i. Let FF denote the set of all finitely generated subgroups H of G which have the property that, for each g in G…

The interpolated free group factors L(F_r), 1 < r <= \infty, are defined and proofs of their properties with respect to compression by projections and taking free products are proved. Hence it follows that all the free group factor are…

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Let F_2 denote the free group of rank 2. Our main technical result of independent interest is: for any element u of F_2, there is g in F_2 such that no cyclically reduced image of u under an automorphism of F_2 contains g as a subword. We…

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

Let $g$ be an element of a finite group $G$ and let $R_{n}(g)$ be the subgroup generated by all the right Engel values $[g,{}_{n}x]$ over $x\in G$. In the case when $G$ is soluble we prove that if, for some $n$, the Fitting height of…

Motivated by the work of Leininger on hyperbolic equivalence of homotopy classes of closed curves on surfaces, we investigate a similar phenomenon for free groups. Namely, we study the situation when two elements $g,h$ in a free group $F$…

Given $r$-uniform hypergraphs $G$ and $F$ and an integer $n$, let $f_{F,G}(n)$ be the maximum $m$ such that every $n$-vertex $G$-free $r$-graph has an $F$-free induced subgraph on $m$ vertices. We show that $f_{F,G}(n)$ is polynomial in $n$…

We study the lattice of finite-index extensions of a given finitely generated subgroup $H$ of a free group $F$. This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of $H$.…

The free product of an arbitrary pair of finite hyperfinite von Neumann algebras is examined, and the result is determined to be the direct sum of a finite dimensional algebra and an interpolated free group factor $L(\freeF_r)$. The finite…

We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…

In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x1,x2,...,xn over the field F. We obtain the following result Given a noncommutative…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We prove a rigidity result for cocycles from higher rank lattices to $\mathrm{Out}(F_N)$ and more generally to the outer automorphism group of a torsion-free hyperbolic group. More precisely, let $G$ be either a product of connected higher…