Related papers: Edge sliding and ergodic hyperfinite decomposition

We suggest a modified and briefer version for the proof of Higman's embedding theorem stating that a finitely generated group can be embedded in a finitely presented group if and only if it is recursively presented. In particular, we…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…

We show an $\widetilde{O}(m^{1.5} \epsilon^{-1})$ time algorithm that on a graph with $m$ edges and $n$ vertices outputs its spanning tree count up to a multiplicative $(1+\epsilon)$ factor with high probability, improving on the previous…

We study F-theory compactifications with up to two Abelian gauge group factors that are based on elliptically fibered Calabi-Yau 4-folds describable as generic hypersurfaces. Special emphasis is put on elliptic fibrations based on generic…

A graph is almost bipartite if it contains exactly one odd cycle, and it is Konig-Egervary if the sum of the independence number and the matching number equals the order of the graph. We introduce the class of Bipartite-Almost Bipartite…

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

Given a countable group $G$ splitting as a free product $G=G_1\ast\dots\ast G_k\ast F_N$, we establish classification results for subgroups of the group $Out(G,\mathcal{F})$ of all outer automorphisms of $G$ that preserve the conjugacy…

A number of recent works have employed decision trees for the construction of explainable partitions that aim to minimize the $k$-means cost function. These works, however, largely ignore metrics related to the depths of the leaves in the…

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent…

We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acts absolutely non-freely on the boundary of the…

Let P be a semigroup that admits an embedding into a group G. Assume that the embedding satisfies a certain Toeplitz condition and that the Baum-Connes conjecture holds for G. We prove a formula describing the K- theory of the reduced…

The entangled ergodic theorem concerns the study of the convergence in the strong, or merely weak operator topology, of the multiple Cesaro mean $$\frac{1}{N^{k}}\sum_{n_{1},...,n_{k}=0}^{N-1} U^{n_{\a(1)}}A_{1}U^{n_{\a(2)}}...…

This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to…

Let $G$ be a $3$-connected graph with a $3$-connected (or sufficiently small) simple minor $H$. We establish that $G$ has a forest $F$ with at least $\left\lceil(|G|-|H|+1)/2\right\rceil$ edges such that $G/e$ is $3$-connected with an…

Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…

We establish compact presentability, i.e. the locally compact version of finite presentability, for an infinite family of tree almost automorphism groups. Examples covered by our results include Neretin's group of spheromorphisms, as well…

We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…