Related papers: Erratum to ``Stabilization for the automorphisms o…
We present an effective algorithm for detecting automorphic orbits in free groups, as well as a number of algorithmic improvements of train tracks for free group automorphisms.
Two typos in the published paper are pointed out. Both are just typos and the calculations in that paper are based on the correct formulism.
This erratum corrects the proof given in \cite{E1,E2} about the existence of $ 3D $ Skyrmions. This is done by changing the arguments of the proof while remaining in the same framework of concentration-compactness. Note however that the use…
In this article we raise some new questions about positive definite functions on free groups, and explain how these are related to more well-known questions. The article is intended as a survey of known results that also offers some new…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.
The goal of this paper is to introduce a new tool, called {\em long turns}, which is a useful addition to the train track technology for automorphisms of free groups, in that it allows one to control periodic INPs in a train track map and…
The purpose of this erratum is to fill a gap in the proof of the `Composite Braid Theorem' in the manuscript "Studying Links Via Closed Braids IV: Composite Links and Split Links (SLVCB-IV)", Inventiones Math, \{bf 102\} Fasc. 1 (1990),…
This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper "The generalized stochastic likelihood decoder: random coding and expurgated bounds."
In our paper "Dendroidal sets as models for homotopy operads" (J. Topol. 4 (2011), no. 2, 257-299, and arXiv:0902.1954), we made the wrong claim about the behaviour of the tensor product with respect to cofibrations of dendroidal sets. We…
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves most of the edges. Focusing on the planted version where the…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…
The purpose of this article is to give an exposition of topological properties of spaces of homomorphisms from certain finitely generated discrete groups to Lie groups $G$, and to describe their connections to classical representation…
We correct a small gap found in the authors' paper 'On bounds for the effective differential Nullstellensatz' (J Algebra 449:1-21, 2016). This gap is due to an inequality that does not generally hold. However, under one additional…
An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.
This erratum aims to correct 1) the wrong expressions, 2) some typographical errors, 3) some erroneous points made in discussion of the disparity of heat flux ratios between our full RPA model and the local conductivity model, and 4) the…
The purpose of this note is to give a number of open problems on matching theory and their relation to the well-known results in this area. We also give a linear analogue of the acyclic matchings.
We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).
We develop a new adiabatic theorem for unique gapped ground states which does not require the gap for local Hamiltonians. We instead require a gap in the bulk and a smoothness of expectation values of sub-exponentially localized observables…