Related papers: Remarks and problems about algorithmic description…

In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…

This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

Real-life tools for decision-making in many critical domains are based on ranking results. With the increasing awareness of algorithmic fairness, recent works have presented measures for fairness in ranking. Many of those definitions…

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 present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

In this monograph, we give an account of the relationship between the algebraic structure of finitely generated and countable groups and the regularity with which they act on manifolds. We concentrate on the case of one--dimensional…

Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…

Let $S$ be a closed oriented surface and $G$ a finite group of orientation preserving automorphisms of $S$ whose orbit space has genus at least $2$. There is a natural group homomorphism from the $G$-centralizer in $Diff^+(S)$ to the…

We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Let $G$ be a group with undecidable domino problem, such as $\mathbb{Z}^2$. We prove that all nontrivial dynamical properties for sofic $G$-subshifts are undecidable, that this is not true for $G$-SFTs, and an undecidability result for…

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…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…