Related papers: Length Function Compatibility for Group Actions on…

This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint…

If $f,g:\mathbb{R}^n\longrightarrow\mathbb{R}_{\geq0}$ are non-negative measurable functions, then the Pr\'ekopa-Leindler inequality asserts that the integral of the Asplund sum (provided that it is measurable) is greater or equal than the…

We study the actions of a Lie group $G$ by birationally extendible automorphisms on a domain $D\subset C^n$. For a large class of such domains defined by polynomial inequalities, all automorphisms are of this type. In the cases 1) $G$ has…

Morgan and Culler proved that a minimal action of a free group on a tree is determined by its translation length function. We prove an analogue of this theorem for 2-dimensional right-angled Artin groups acting on CAT(0) rectangle…

The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…

Several years ago, O. Bratelli and P. Jorgensen developed the concept of m-systems of filters for dilation by a positive integer N>1 on L^2(R). They constructed a loop group action on m-systems. By work of Mallat and Meyer, these m-systems…

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ vertices that can be deleted, so that $H(G - S)$ is at…

Using suitable deformations of simplicial trees and the duality theory for median sets, we show that every free action on a median set can be extended to a free and transitive one. We also prove that the category of median groups is a…

We introduce a class of spaces, called real cubings, and study the stucture of groups acting nicely on these spaces. Just as cubings are a natural generalisation of simplicial trees, real cubings can be regarded as a natural generalisation…

Growth curve models are popular tools for studying the development of a response variable within subjects over time. Heterogeneity between subjects is common in such models, and researchers are typically interested in explaining or…

Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary…

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…

For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function…

For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…

We address the following natural extension problem for group actions: Given a group $G$, a subgroup $H\le G$, and an action of $H$ on a metric space, when is it possible to extend it to an action of the whole group $G$ on a (possibly…

We study the relative growth of finitely generated subgroups in finitely generated groups, and the corresponding distortion function of the embeddings. We explore which functions are equivalent to the relative growth functions and…

With the aim of treating the local behaviour of additive functions, we develop analogues of the Matom\"{a}ki-Radziwill theorem that allow us to approximate the average of a general additive function over a typical short interval in terms of…

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

Recently F\'eray, Goulden and Lascoux gave a proof of a new hook summation formula for unordered increasing trees by means of a generalization of the Pr\"ufer code for labelled trees and posed the problem of finding a bijection between…