Related papers: Length Function Compatibility for Group Actions on…

The generalized Fitting height $h^*(G)$ of a finite group $G$ is the least number $h$ such that $\mathrm{F}_h^* (G) = G$, where $\mathrm{F}_{(0)}^* (G) = 1$, and $\mathrm{F}_{(i+1)}^*(G)$ is the inverse image of the generalized Fitting…

Consider distributional fixed point equations of the form R =d f(C_i, R_i, 1 <= i <= N), where f(.) is a possibly random real valued function, N in {0, 1, 2, 3,...} U {infty}, {C_i}_{i=1}^N are real valued random weights and {R_i}_{i >= 1}…

Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…

Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…

A unital $\ell$-group is an abelian group equipped with a translation invariant lattice-order and with a distinguished strong unit, i.e. an element whose positive integer multiples eventually dominate every element of $G$.If $X$ is a…

Let $T$ be an $\mathbb{R}$-tree, equipped with a very small action of the rank $n$ free group $F_n$, and let $H \leq F_n$ be finitely generated. We consider the case where the action $F_n \curvearrowright T$ is indecomposable--this is a…

We use actions on trees to determine uniform exponential growth for subgroups of $GL_2$.

In this paper, we propose an algebraic approach to determine whether two non-isomorphic caterpillar trees can have the same symmetric function generalization of the chromatic polynomial. On the set of all composition on integers, we…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

Search trees are fundamental data structures in computer science. We study functionals on random search trees that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Background. The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set $L$ is known to be solvable in linear time.…

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

Tree ensembles, including boosting methods, are highly effective and widely used for tabular data. However, large ensembles lack interpretability and require longer inference times. We introduce a method to prune a tree ensemble into a…

Bass-Serre theory provides a powerful framework for studying group actions on trees. While extremely effective for structural questions in group theory, it is less suited to the systematic construction of group actions with prescribed local…

The functional flow equations for the Legendre effective action, with respect to changes in a smooth cutoff, are approximated by a derivative expansion; no other approximation is made. This results in a set of coupled non-linear…

Ren et al. recently introduced a method for aggregating multiple decision trees into a strong predictor by interpreting a path taken by a sample down each tree as a binary vector and performing linear regression on top of these vectors…

Let $\lambda$ be an uncountable cardinal such that $2^{< \lambda } = \lambda$. Working in the setup of generalized descriptive set theory, we study the structure of $\lambda^+$-Borel measurable functions with respect to various kinds of…