相关论文: Computational explorations in Thompson's group F

This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…

Given a finitely generated group, the well-known Stability Problem asks whether the non-triviality of the Poisson-Furstenberg boundary (which is equivalent to the existence of non-constant bounded harmonic functions) depends on the choice…

Thompson's group F is the group of all increasing dyadic piecewise linear homeomorphisms of the closed unit interval. We compute Sigma^m(F) and Sigma^m(F;Z), the homotopical and homological Bieri-Neumann-Strebel-Renz invariants of F, and we…

We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…

Thompson sampling (TS) is one of the most popular exploration techniques in reinforcement learning (RL). However, most TS algorithms with theoretical guarantees are difficult to implement and not generalizable to Deep RL. While the emerging…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

We consider the problem of statistical inference when the data is collected via a Thompson Sampling-type algorithm. While Thompson Sampling (TS) is known to be both asymptotically optimal and empirically effective, its adaptive sampling…

Performance evolution of a number of complex scientific and technical systems demonstrate exponential progress with time exp(+t/C) . The speed of progress C - a measure of difficulty and complexity - is analyzed for high energy elementary…

The generalized master equation or the equivalent continuous time random walk equations can be used to compute the macroscopic first passage time distribution (FPTD) of a complex stochastic system from short-term microscopic simulation…

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

We study time-inhomogeneous random walks on finite groups in the case where each random walk step need not be supported on a generating set of the group. When the supports of the random walk steps satisfy a natural condition involving…

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

In this paper we consider the $T$- and $V$- versions, $T_{\tau}$ and $V_{\tau}$ , of the irrational slope Thompson group $F_{\tau}$ considered in [3]. We give infinite presentations for these groups and show how they can be represented by…

We produce a sequence of markings $S_k$ of Thompson's group $F$ within the space ${\mathcal G}_n$ of all marked $n$-generator groups so that the sequence $(F,S_k)$ converges to the free group on $n$ generators, for $n \geq 3$. In addition,…

This paper demonstrates the uniformly finite homology developed by Block and Weinberger and its relationship to amenable spaces via applications to the Cayley graph of Thompson's Group F. In particular, a certain class of subgraph of F is…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the…

We show that for any countable amenable group action, along F{\o}lner sequences that have for any $c>1$ a two sided $c$-tempered tail, one have universal estimate for the probability that there are $n$ fluctuations in the ergodic averages…

We define a family of groups that generalises Thompson's groups $T$ and $G$ and also those of Higman, Stein and Brin. For groups in this family we descrine centralisers of finite subgroups and show, that for a given finite subgroup $Q$,…

We study period growth in co-context-free groups, giving general results and looking at specific examples such as Thompson groups $T$ and $V$ and the Houghton groups $H_m$. Along the way, we give a refined upper bound on the word metric in…