Related papers: Length Function Compatibility for Group Actions on…
Ordered sequences of data, specified with a join operation to combine sequences, serve as a foundation for the implementation of parallel functional algorithms. This abstract data type can be elegantly and efficiently implemented using…
Motivated by the work of Leininger on hyperbolic equivalence of homotopy classes of closed curves on surfaces, we investigate a similar phenomenon for free groups. Namely, we study the situation when two elements $g,h$ in a free group $F$…
We present a framework for the simultaneous symbolic recovery of a function and its antiderivative from data. The framework rests on three ideas. First, a derivative algebra: the observation that the product rule $\frac{d}{dx}[f \cdot g] =…
We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…
The main purpose of this paper is to give characterization theorems on derivations as well as on linear functions. Among others the following problem will be investigated: Let $n\in\mathbb{Z}$, $f, g\colon\mathbb{R}\to\mathbb{R}$ be…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
Erickson defined the fusible numbers as a set $\mathcal F$ of reals generated by repeated application of the function $\frac{x+y+1}{2}$. Erickson, Nivasch, and Xu showed that $\mathcal F$ is well ordered, with order type $\varepsilon_0$.…
For a given l-adic sheaf F on a commutative algebraic group over a finite field k and an integer r we define the r-th local norm L-function of F at a point t in G(k) and prove its rationality. This function gives information on the sum of…
We generalize Exel's notion of partial group action to monoids. For partial monoid actions that can be defined by means of suitably well-behaved systems of generators and relations, we employ classical rewriting theory in order to describe…
In this paper we survey recent developments in the theory of groups acting on $\Lambda$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of…
We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:…
For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…
In this work we define a metric structure to compare functions defined on different merge trees. The metric introduced possesses some stability properties, which we illustrate within a standard topological data analysis (TDA) framework, and…
Recently Han obtained a general formula for the weight function corresponding to the expansion of a generating function in terms of hook lengths of binary trees. In this paper, we present formulas for k-ary trees, plane trees, plane…
We study the interaction between the group law on an abelian variety and the additive structure induced on its image under a morphism to projective space. Let $A/F$ be a simple abelian variety, $f:A \rightarrow \mathbb{P}^n$ be a morphism…
In 1999, Long and Reid proposed a proper action of a surface group on a product of trees. In this note, we show that the action is not proper.
In verified generic programming, one cannot exploit the structure of concrete data types but has to rely on well chosen sets of specifications or abstract data types (ADTs). Functors and monads are at the core of many applications of…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
While tree methods have been popular in practice, researchers and practitioners are also looking for simple algorithms which can reach similar accuracy of trees. In 2010, (Ping Li UAI'10) developed the method of "abc-robust-logitboost" and…
Let $H$ be a transfer Krull monoid over a finite ablian group $G$ (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit $a \in H$ can be written…