Related papers: Asymptotic invariants, complexity of groups and re…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…
We report on results about a study of algebraic graph invariants, based on computer exploration, and motivated by graph-isomorphism and reconstruction problems.
We bound the higher-order Dehn functions and other filling invariants of certain Carnot groups using approximation techniques. These groups include the higher-dimensional Heisenberg groups, jet groups, and central products of two-step…
Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
We analyze the sequence of polynomials defined by the differential-difference equation $P_{n+1}(x)=P_{n}^{\prime}(x)+x(n+1)P_{n}(x)$ asymptotically as $n\to\infty$. The polynomials $P_{n}(x)$ arise in the computation of higher derivatives…
We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…
A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and…
We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…
We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…
In this article we relate word and subgroup growth to certain functions that arise in the quantification of residual finiteness. One consequence of this endeavor is a pair of results that equate the nilpotency of a finitely generated group…
Convergence rate estimates in limit theorems for sums of independent random variables are considered.
We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…