Related papers: Length Function Compatibility for Group Actions on…

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…

Let $G$ be a connected real algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G=G_0>G_1>...>G_t=1$ where each $G_i$ is a maximal connected real subgroup of $G_{i-1}$. The maximal (respectively, minimal) length of such an…

Given a finite set of real numbers $A$, the generalised golden ratio is the unique real number $\mathcal{G}(A) > 1$ for which we only have trivial unique expansions in smaller bases, and have non-trivial unique expansions in larger bases.…

For finitely generated groups $H$ and $G$, we observe that $H$ admits a translation-like action on $G$ implies there is a regular map, which was introduced in Benjamini, Schramm and Tim\'{a}r's joint paper, from $H$ to $G$. Combining with…

We establish a polynomial ergodic theorem for actions of the affine group of a countable field $K$. As an application, we deduce--via a variant of Furstenberg's correspondence principle--that for fields of characteristic zero, any "large"…

Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…

The Weisfeiler-Lehman graph kernels are among the most prevalent graph kernels due to their remarkable time complexity and predictive performance. Their key concept is based on an implicit comparison of neighborhood representing trees with…

We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the input tree), we can enumerate answers with linear delay (in…

Value function approximation has demonstrated phenomenal empirical success in reinforcement learning (RL). Nevertheless, despite a handful of recent progress on developing theory for RL with linear function approximation, the understanding…

We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…

Let $G$ be the fundamental group of a compact nonpositively curved cube complex $Y$. With respect to a basepoint $x$, one obtains an integer-valued length function on $G$ by counting the number of edges in a minimal length edge-path…

We extend A.B. Mingarelli's method for constructing generalized factorials. Our extension uses a pair of arithmetic functions $(x, y)$, where $x$ is superadditive. When $x$ is the identity function, our generalized factorial reduces to…

Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…

Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…

For every countable abelian group $G$ we find the set of all its subgroups $H$ ($H\leq G$) such that a typical measure-preserving $H$-action on a standard atomless probability space $(X,\mathcal{F}, \mu)$ can be extended to a free…

While Large Language Models (LLMs) excel at code generation by learning from vast code corpora, a fundamental semantic gap remains between their training on textual patterns and the goal of functional correctness, which is governed by…

We study equivalence relations $\mathcal R(\Gamma\curvearrowright G)$ that arise from left translation actions of countable groups on their profinite completions. Under the assumption that the action $\Gamma\curvearrowright G$ is free and…

A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…

We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this…