Related papers: On independent families of normal subgroups in fre…

The object of this paper is to find a necessary and sufficient condition for the groups $G_1, G_2, ..., G_n$ so that every normal subgroup of the product $\prod_{i=1}^{n} G_i$ is of the type $\prod_{i=1}^{n} N_i$ with $N_i \trianglelefteq…

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…

Given a family $\mathcal{I}$ of independent sets in a graph, a rainbow independent set is an independent set $I$ such that there is an injection $\phi\colon I\to \mathcal{I}$ where for each $v\in I$, $v$ is contained in $\phi(v)$. Aharoni,…

For normal subgoups $R$ and $S$ of a free group $F$, an identification of the subgroup $F\cap (1+\mathfrak r\mathfrak f\mathfrak s)$ is derived, and it is shown that the the quotient $\frac{F\cap (1+\mathfrak r\mathfrak f\mathfrak…

We show that if $N$, an open connected $n$-manifold with finitely generated fundamental group, is $C^{2}$ foliated by closed planes, then $\pi_{1}(N)$ is a free group. This implies that if $\pi_{1}(N)$ has an Abelian subgroup of rank…

We consider a family of distance graphs in $\mathbb{R}^n$ and find its independent numbers in some cases. Define graph $J_{\pm}(n,k,t)$ in the following way: the vertex set consists of all vectors from $\{-1,0,1\}^n$ with $k$ nonzero…

Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…

Suppose that $\mathcal{C}$ is a root class of groups (i.e., a class of groups that contains non-trivial groups and is closed under taking subgroups and unrestricted wreath products), $G$ is the free product of residually…

An independent set in a graph $G$ is a set $S$ of pairwise non-adjacent vertices in $G$. A family $\mathcal{F}$ of independent sets in $G$ is called a $k$-independence covering family if for every independent set $I$ in $G$ of size at most…

Factors $\frac{X}{Y}$ in a free group $F$ with $Y$ normal in $X$ are considered. Precise results on the free structure of ${Y}$ relative to the free structure of ${X}$ when $\frac{X}{Y}$ is abelian are obtained. Some extensions and…

Let $N_1$ (resp., $N_2$) be the normal closure of a finite symmetrized set $R_1$ (resp., $R_2$) of a finitely generated free group $F = F(A)$. It is well-known that if $R_i$ satisfies the condition C(6), then the conjugacy problem is…

We present an explicit geometric construction of a large parametrized family of graphs with no $k$-cliques and with bounded independence number, generalizing the triangle-free Ramsey graphs of Codenotti, Pudl\'ak, and Resta and revisiting…

It is shown that a nontrivial normal subgroup $N$ of a group $G$ is a free factor of the $N$'s normal closure in the $G$'s free product with arbitrary nontrivial groups.

Let $n$ be a prime or its square. We prove that the congruence subgroup $\Gamma_0(n)$ admits a free product decomposition into cyclic factors in such a way that the $(2,1)$-component of each cyclic generator is either $n$ or $0$, answering…

We obtain an estimate of free entropy of generators in a type ${II}_1$-factor $\mc{M}$ which has a subfactor $\mc{N}$ of finite index with a subalgebra $\mc{P}=\mc{P}_1\vee\mc{P}_2\subset\mc{N}$ where $\mc{P}_1=\mc{R}_1'\cap\mc{P}$,…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

For every natural number $d$, we construct finite $d$-regular simple graphs that, for every $r \le d$, contain an independent exact $r$-cover. This answers a question of Gray and Johnson that arose in their study of 2-step transit…

An $n$-vertex, $d$-regular graph can have at most $2^{n/2+o_d(n)}$ independent sets. In this paper we address what happens with this upper bound when we impose the further condition that the graph has independence number at most $\alpha$.…

A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…

The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…