Related papers: Introduction to Iterated Monodromy Groups
A strictly truncated (weak-coupling) perturbation theory is applied to the attractive Holstein and Hubbard models in infinite dimensions. These results are qualified by comparison with essentially exact Monte Carlo results. The second order…
Topological full groups originated from the theory of topological dynamical systems and have been having considerable impact on group theory in recent years. This text represents an introduction/survey on topological full groups. After…
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…
The structure of monoidal categories in which every arrow is invertible is analyzed in this paper, where we develop a 3-dimensional Schreier-Grothendieck theory of non-abelian factor sets for their classification. In particular, we state…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…
Combinatorial groups together with the groups of natural coalgebra transformations of tensor algebras are linked to the groups of homotopy classes of maps from the James construction to a loop space. This connection gives rise to…
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…
This paper is an introduction to classical polylogarithms and is an expanded version of a talk given by the author at the Motives conference. Topics covered include, monodromy; the polylogarithm local systems; Bloch's constructions of…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
This study addresses the challenge of forming effective groups in collaborative problem-solving environments. Recognizing the complexity of human interactions and the necessity for efficient collaboration, we propose a novel approach…
We present some effective approaches in studying the relative monodromy group of elliptic logarithms with respect to periods of elliptic schemes. We provide explicit ways of constructing explicit loops which leave periods unchanged but…
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…
The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the…
This is an almost self-contained monograph (containing some new results) on left-orderable groups which mostly rely on dynamical and probabilistic aspects, but also on geometric, combinatorial, analytic, and topological ones. This new…
We investigate the structure of logarithmic modes in critical topologically massive gravity (CTMG) at the chiral point $\mu \ell=1$ from the perspective of analytic continuation and monodromy. Starting from the degeneration of massive and…