Related papers: Functions on groups and computational complexity
This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
We construct easy embeddings of relatively free groups (say the free Burnside group, the free solvable group) into finitely presented groups. We introduce a concept of verbal isoperimetric function of a group variety. We prove that if the…
Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
In 1996, Gersten proved that finitely presented subgroups of a word hyperbolic group of integral cohomological dimension 2 are hyperbolic. We use isoperimetric inequalities over arbitrary rings to extend this result to any ring. In…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…
We study symmetries enjoyed by the polynomials enumerating non-degenerate flags in finite vector spaces, equipped with a non-degenerate alternating bilinear, hermitian or quadratic form. To this end we introduce Igusa-type rational…
We introduce a notion of a length function exponentially distorted on a (compactly generated) subgroup of a locally compact group. We prove that for a connected linear complex Lie group there is a maximum equivalence class of length…
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
A new class of positive definite functions related to colour-length function on arbitrary Coxeter group is introduced. Extensions of positive definite functions, called the Riesz-Coxeter product, from the Riesz product on the Rademacher…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
We address a question from \cite{BKV25} regarding the finiteness of the homological $R$-isoperimetric function. Let $R$ be a subfield of the complex numbers $\mathbb{C}$ with the absolute value norm. We prove that for any group $G$ that…
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the second in a series of papers in…
We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…