Related papers: Weighted growth functions of automatic groups
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In the present work we describe the category $\mathsf{WC}_2$ of weighted 2-complexes and its subcategory $\mathsf{WC}_1$ of weighted graphs. Since a Coxeter group is defined by its Coxeter graph, the construction of Coxeter groups defines a…
From genomes and ecosystems to bureaucracies and cities, the growth of complex systems occurs by adding new types of functions and expanding existing ones. We present a simple generative model that generalizes the Yule-Simon process by…
In this note we revisit the problem of explicitly computing tree-level scattering amplitudes in various theories in any dimension from worldsheet formulas. The latter are known to produce cubic-tree expansion of tree amplitudes with…
We use Margulis' construction together with lattice counting arguments to build Cayley graphs on $\mathrm{SL}_{2}\left(\mathbb{F}_{p}\right),\;p\to\infty$ which are d-regular graphs with girth…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
Statistical techniques are needed to analyse data structures with complex dependencies such that clinically useful information can be extracted. Individual-specific networks, which capture dependencies in complex biological systems, are…
An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…
This is the third paper of the CayleyPy project applying artificial intelligence to problems in group theory. We announce the first public release of CayleyPy, an open source Python library for computations with Cayley and Schreier graphs.…
There exist a number of well known multiplicative generating functions for series of Schur functions. Amongst these are some related to the dual Cauchy identity whose expansion coefficients are rather simple, and in some cases periodic in…
Multiset automata are a class of automata for which the symbols can be read in any order and obtain the same result. We investigate weighted multiset automata and show how to construct them from weighted regular expressions. We present…
We determine the twisted conjugacy growth function for automorphisms on generalised Heisenberg groups. In particular we demonstrate for these groups that up to a natural equivalence this function is either given by $n^k$ or $n^k\ln(n)$ for…
Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…
In this article, we deeply reveal the relationship between functions $\theta$ and $\vartheta$ in an overlap function additively generated by an additive generator pair ($\theta$,$\vartheta$). Then we characterize the conditions for an…
Scene graph generation is a structured prediction task aiming to explicitly model objects and their relationships via constructing a visually-grounded scene graph for an input image. Currently, the message passing neural network based mean…
We develop a formal group--theoretic framework for the Riemann zeta function by treating its Euler product as an element of the multiplicative formal group $\widehat{\mathbb{G}}_m$ and its logarithm as the associated formal group logarithm.…
We study growth and complexity of \'etale groupoids in relation to growth of their convolution algebras. As an application, we construct simple finitely generated algebras of arbitrary Gelfand-Kirillov dimension $\ge 2$ and simple finitely…
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial…