Related papers: Length Function Compatibility for Group Actions on…
Leighton's Graph Covering Theorem states that if two finite graphs have the same universal covering tree, then they also have a common finite degree cover. Bass and Kulkarni gave an alternative proof of this fact using tree lattices. We…
The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
A new method is proposed to perform joint analysis of longitudinal and cross-sectional growth data. Clustering is first performed to group similar subjects in cross-sectional data to form a pseudo longitudinal data set, then the pseudo…
Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…
Iterative methods for computing matrix functions have been extensively studied and their convergence speed can be significantly improved with the right tuning of parameters and by mixing different iteration types. Handtuning the design…
A previously established correspondence between definite-parity real functions and inner analytic functions is generalized to real functions without definite parity properties. The set of inner analytic functions that corresponds to the set…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We study the double-coset zeta functions for groups acting on trees, focusing mainly on weakly locally $\infty$-transitive or (P)-closed actions. After giving a geometric characterisation of convergence for the defining series, we provide…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…
The additive structure of $\mathbb{F}_1$-modules (in the sense of Segal's $\Gamma$-sets) differs fundamentally from that of abelian groups: addition is encoded through a family of $n$-ary hyper-operations that are multivalued and do not…
In the Tree Augmentation problem we are given a tree $T=(V,F)$ and a set $E \subseteq V \times V$ of edges with positive integer costs $\{c_e:e \in E\}$. The goal is to augment $T$ by a minimum cost edge set $J \subseteq E$ such that $T…
In his work on the Farrell-Jones Conjecture, Arthur Bartels introduced the concept of a "finitely $\mathcal{F}$-amenable" group action, where $\mathcal{F}$ is a family of subgroups. We show how a finitely $\mathcal{F}$-amenable action of a…
We present a generalized version of classical geometric invariant theory \`a la Mumford where we consider an affine algebraic group $G$ acting on a specific affine algebraic variety $X$. We define the notions of linearly reductive and of…
Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…
We introduce 'project-connex' tree-width as a measure of tractability for counting and aggregate conjunctive queries over semirings with 'group-by' projection (also known as 'AJAR' or 'FAQ' queries). This elementary measure allows to obtain…
The main aim of this note is to provide characterization theorems concerning real derivations. Among others the following implication will be verified: Assume that $\xi\colon \mathbb{R}\to \mathbb{R}$ is a given differentiable function and…