Related papers: Quadratic equations in the Grigorchuk group

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We show that the wreath product $G \wr \mathbb{Z}^n$ of any finitely generated group $G$ with $\mathbb{Z}^n$ has finite palindromic width. We also show that $C \wr A$ has finite palindromic width if $C$ has finite commutator width and $A$…

This paper studies systems of linear difference equations on the lattice $\Z^n$ that are invariant under a finite group of symmetries, and shows that there exist solutions to such systems that are also invariant under this group of…

In this paper we prove that the profinite completion $\mathcal{\hat G}$ of the Grigorchuk group $\mathcal{G}$ is not finitely presented as a profinite group. We obtain this result by showing that $H^2(\mathcal{\hat G},\field{F}_2)$ is…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…

We prove that the asymptotic dimension of the first Grigorchuk group is infinity.

Exponential equations in free groups were studied initially by Lyndon and Schutzenberger and then by Comerford and Edmunds. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential…

We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…

Following the construction from `Degrees of growth of finitely generated groups and the theory of invariant means' we generalize the Grigorchuk's overgroup $\tilde{\mathcal{G}}$, studied in `On parabolic subgroups and Hecke algebras of some…

We study L-equivalence in the Grothendieck ring of varieties and its interaction with categorical invariants of cubic fourfolds. Assuming a Derived Torelli-type criterion for Kuznetsov components and a mild condition on the discriminant of…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…

We study combinatorial properties of the subshift induced by the substitution that describes Lysenok's presentation of Grigorchuk's group of intermediate growth by generators and relators. This subshift has recently appeared in two…

We prove that the groupoid of transformations of rigid structures on surfaces has a finite presentation as a 2-groupoid establishing a result first conjectured by G.Moore and N.Seiberg. An alternative proof was given by B.Bakalov and…

We construct examples of nodal quartic double solids that admit uniformly rational, and so elliptic in Gromov' sense, small algebraic resolutions.

In this paper, we consider linear quadratic team problems with an arbitrary number of quadratic constraints in both stochastic and deterministic settings. The team consists of players with different measurements about the state of nature.…

We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.