Related papers: Weighted growth functions of automatic groups
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
Causal loop and stock and flow diagrams are broadly used in System Dynamics because they help organize relationships and convey meaning. Using the analytical work of Schoenberg (2019) to select what to include in a compressed model, this…
Weighted graphs are ubiquitous throughout biology, chemistry, and the social sciences, motivating the development of generative models for abstract weighted graph data using deep neural networks. However, most current deep generative models…
Skew morphisms, which generalise automorphisms for groups, provide a fundamental tool for the study of regular Cayley maps and, more generally, for finite groups with a complementary factorisation $X = GY$, where $Y$ is cyclic and core-free…
Let $G$ be a free group of rank $n$ and $H\subset G$ its subgroup of finite index. Then $H$ is also a free group and the rank $m$ of $H$ is determined by Schreier's formula $m-1=(n-1)\cdot|G:H|.$ Any subalgebra of a free Lie algebra is also…
We show that each Weyl group which enters in the generalized Springer correspondence carries a natural weight function.
We extend the Chomsky/Sch\"utzenberger method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.
Two-sort species yield differential equations for functional digraphs of Cayley permutations. From these we obtain an explicit formula for fixed-point-free Cayley permutations and prove that their proportion tends to $1/e$, as for…
Fixing a subgroup $\Gamma$ in a group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] = n$. For pairs…
Let $L(G)$ denote the space of integer-valued length functions on a countable group $G$ endowed with the topology of pointwise convergence. Assuming that $G$ does not satisfy any non-trivial mixed identity, we prove that a generic (in the…
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
In geometry group theory, one of the milestones is M. Gromov's polynomial growth theorem: Finitely generated groups have polynomial growth if and only if they are virtually nilpotent. Inspired by M. Gromov's work, we introduce the growth…
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
The paper aims at proving global height estimates for Killing graphs defined over a complete manifold with nonempty boundary. To this end, we first point out how the geometric analysis on a Killing graph is naturally related to a weighted…
We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our experimentations in the case of three and four strands and…
In this paper, we consider an extended Kazakov-Migdal model defined on an arbitrary graph. The partition function of the model, which is expressed as the summation of all Wilson loops on the graph, turns out to be represented by the…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
Mathematical methods of analysis of data and of predicting growth are discussed. The starting point is the analysis of the growth rates, which can be expressed as a function of time or as a function of the size of the growing entity.…