Related papers: Snakes can be fooled into thinking they live in a …

Much of dynamical algebraic combinatorics focuses on global dynamical systems defined via maps that are compositions of local toggle operators. The second author and Roby studied such maps that result from toggling independent sets of a…

Prisoner's Dilemma is a game theory model used to describe altruistic behavior seen in various populations. This theoretical game is important in understanding why a seemingly selfish strategy does persist and spread throughout a population…

Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

In this paper, we focus on the prediction phase of a random forest and study the problem of representing a bag of decision trees using a smaller bag of decision trees, where we only consider binary decision problems on the binary domain and…

Deliberate deceptiveness intended to gain an advantage is commonplace in human and animal societies. In a social dilemma, an individual may only pretend to be a cooperator to elicit cooperation from others, while in reality he is a…

We examine the question of which finitely generated groups act properly on a finite product of simplicial trees, considering both arbitrary trees and where all trees are locally finite. In the second case we present evidence in favour of…

We prove the tame-wild dichotomy conjecture, due to D. Simson, for infinite dimensional algebras and coalgebras. The key part of the approach is proving new representation theoretic characterizations local finiteness. Among other, we show…

Spontaneous symmetry breaking plays a fundamental role in many areas of condensed matter and particle physics. A fundamental problem in ecology is the elucidation of the mechanisms responsible for biodiversity and stability. Neutral theory,…

Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and…

Using forcing with measured creatures we build a universe of set theory in which: (a) every sup-measurable function f:RxR-->R is measurable, and (b) every function f:R-->R is continuous on a non-measurable set. This answers a question of…

Consider tuples of separable algebras over a common local or global number field, related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…

We give a computational approach to theorem proving in homological algebra. This approach is based on computations in the free abelian category of an additive category $\mathbf{A}$. We show that the free abelian category is amenable to…