Related papers: A Method to Construct $1$-Rotational Factorization…
Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Let $\mathfrak{g}$ be a simple Lie algebra over $\mathbb{C}$. The KZ connection is a connection on the constant bundle associated to a set of $n$ finite dimensional irreducible representations of $\mathfrak{g}$ and a nonzero $\kappa \in…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\Sigma^0_3$-complete and the conjugacy problem…
A complex matrix is called \emph{coninvolutory} if $T\overline{T}=I$. In this paper, we study decompositions of affine transformations in $\mathrm{Aff}(n,\mathbb{C})=\mathrm{GL}(n,\mathbb{C})\ltimes \mathbb{C}^n$ into products of…
Given a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S$, we provide criteria to determine when uniqueness of factorization into irreducible $\mathcal{F}$--invariant representations holds. We use them to prove uniqueness of…
We consider matrix functions with certain invariance under inversion in the unit circle. If such a function satisfies a positivity assumption on the unit circle, then only zero partial indices appear in its Riemann-Hilbert (Wiener-Hopf)…
Let $O$ be a closed Poisson conjugacy class of the complex algebraic Poisson group GL(n) relative to the Drinfeld-Jimbo factorizable classical r-matrix. Denote by $T$ the maximal torus of diagonal matrices in GL(n). With every $a\in O\cap…
We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degrees are odd). We develop two techniques: {\em layering}, which…
Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…
We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…
This work presents the conjugacy classes of finite abelian subgroups of the Cremona group of the plane. Using a well-known theory, this problem amounts to the study of automorphism groups of some Del Pezzo surfaces and conic bundles. We…
Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $\left[ g_{ij}\right]_{i,j\in \mathbb{N}}$ with at most one 1 in each row and each column such that…
We investigate certain classes of normal completely positive (CP) maps on the hyperfinite $II_1$ factor $\mathcal A$. Using the representation theory of a suitable irrational rotation algebra, we propose some computable invariants for such…
In [11] we showed that a loop in a simply connected compact Lie group $\dot{U}$ has a unique Birkhoff (or triangular) factorization if and only if the loop has a unique root subgroup factorization (relative to a choice of a reduced sequence…
Let $F$ be a field of characteristic zero. We prove that if a group grading on $UT_m(F)$ admits a graded involution then this grading is a coarsening of a $\mathbb{Z}^{\lfloor\frac{m}{2}\rfloor}$-grading on $UT_m(F)$ and the graded…
A perfect $1$-factorisation of a graph is a decomposition of that graph into $1$-factors such that the union of any two $1$-factors is a Hamiltonian cycle. A Latin square of order $n$ is row-Hamiltonian if for every pair $(r,s)$ of distinct…
We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a…
Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…