Related papers: Relative Rips Machine
Let $G$ be a Lie group acting properly on a smooth manifold $M$. If $M/G$ is connected, then we exhibit some simple and basic constructions for proper actions. In particular, we prove that the reduction principle in compact transformation…
In this paper we introduce the notion of right waist and right comparizer ideals for semigroups. In particular, we study the ideal theory of semigroups containing right waists and right comparizer ideals. We also study those properties of…
We show a surgery formula for the relative Yamabe invariant and give applications to the study of concordance classes of metrics.
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms…
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
The primary tool for analysing groups acting on trees is Bass--Serre Theory. It is comprised of two parts: a decomposition result, in which an action is decomposed via a graph of groups, and a construction result, in which graphs of groups…
In this paper we develop the theory of train track maps on graphs of groups. Expanding a definition of Bass, we define a notion of a map of a graph of groups, and of a homotopy equivalence. We prove that under one of two technical…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
We study representations of groups by "affine" automorphisms of compact, convex spaces, with special focus on "irreducible" representations: equivalently "minimal" actions. When the group in question is PSL(2,R), we exhibit a one-one…
This paper proposes a new algorithm for learning accurate tree-based models while ensuring the existence of recourse actions. Algorithmic Recourse (AR) aims to provide a recourse action for altering the undesired prediction result given by…
We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings…
We establish three independent results on groups acting on trees. The first implies that a compactly generated locally compact group which acts continuously on a locally finite tree with nilpotent local action and no global fixed point is…
The aim of this paper is to provide upper bounds for the entropy numbers of summation operators on trees in a critical case. In a recent paper [10] we elaborated a framework of weighted summation operators on general trees where we related…
Diagrammatic reducibility DR and its generalization vertex asphericity VA are combinatorial tools developed for detecting asphericity of a 2-complex. Here we present tests for a relative version of VA that apply to pairs of 2-complexes…
We study the effectiveness of subagging, or subsample aggregating, on regression trees, a popular non-parametric method in machine learning. First, we give sufficient conditions for pointwise consistency of trees. We formalize that (i) the…