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

$H$-Packing is the problem of finding a maximum number of vertex-disjoint copies of $H$ in a given graph $G$. $H$-Partition is the special case of finding a set of vertex-disjoint copies that cover each vertex of $G$ exactly once. Our goal…

Let $S$ be a non-empty subset of a group $G$. We say $S$ is product-free if $S\cap SS=\varnothing$, and $S$ is locally maximal if whenever $T$ is product-free and $S\subseteq T$, then $S=T$. Finally $S$ fills $G$ if $G^*\subseteq S \sqcup…

For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years. In this…

For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G covering all vertices of G. We prove that for a fixed tree T on…

Let $G = H_1 * ... * H_k * F_r$ be a torsion-free group and $\phi$ an automorphism of $G$ that preserves this free factor system. We show that when $\phi$ is fully irreducible and atoroidal relative to this free factor system, the mapping…

Let $S=K[x_1,...,x_n]$ or $S=K[[x_1,...,x_n]]$ be either a polynomial or a formal power series ring in a finite number of variables over a field $K$ of characteristic $p > 0$ with $[K:K^p] < \infty$. Let $R$ be the hypersurface $S/fS$ where…

Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…

We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stalling's folding process in time O(N log^*(N)), where N is the sum of the word lengths of the given generators of H.

We investigate canonical factorizations of ordered functors of ordered groupoids through star-surjective functors. Our main construction is a quotient ordered groupoid, depending on an ordered version of the notion of normal subgroupoid,…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

For two graphs $F,H$ and a positive integer $n$, the function $f_{F,H}(n)$ denotes the largest $m$ such that every $H$-free graph on $n$ vertices contains an $F$-free induced subgraph on $m$ vertices. This function has been extensively…

A framework consists of an undirected graph $G$ and a matroid $M$ whose elements correspond to the vertices of $G$. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing paths of…

We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…

A graph $G$ factors into graphs $H$ and $K$ via a matrix product if $A = BC$, where $A$, $B$, and $C$ are the adjacency matrices of $G$, $H$, and $K$, respectively. The graph $G$ is prime if, in every such factorization, one of the factors…

Let $H, K$ be two finitely generated subgroups of a free group, let $\langle H, K \rangle$ denote the subgroup generated by $H, K$, called the join of $H, K$, and let neither of $H$, $K$ have finite index in $\langle H, K \rangle$. We prove…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

We establish a $K-$type decomposition of the Harish-Chandra Schwartz algebra $\mathcal{C}^{p}(G),$ for any real-rank $1$ reductive group $G$ with a maximal compact subgroup $K$ and $0<p\leq2.$ This decomposition is then used to give an…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used by many authors to solve a wide collection of decision problems for free groups and their subgroups. In the present…