Related papers: Ordered trees and the Geode
A finite group $G$, its group algebra $R[G]$ over the field of real numbers, any power series $p(t)= a_0+a_1t+ a_{2}t^{2}+ ...$, where $ a_i \geq 0$, and $a_0+a_1+ a_{2}+...= 1$, and simplex $$ S= \{x=\sum_{g\in G}x_gg\in R[G]: \sum_{g\in…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set…
In this note, we give examples of formal power series satisfying certain conditions that cannot be realized as Hilbert series of finitely generated modules. This answers to the negative a question raised in a recent article by the second…
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…
If G is a GGS-group defined over a p-adic tree, where p is an odd prime, we calculate the order of the congruence quotients $G_n=G/\Stab_G(n)$ for every n. If G is defined by the vector $e=(e_1,...,e_{p-1})\in\F_p^{p-1}$, the determination…
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
Let $(a_n)_{n \geq 0}$ be a sequence of integers such that its generating series satisfies $\sum_{n \geq 0} a_nt^n = \frac{h(t)}{(1-t)^d}$ for some polynomial $h(t)$. For any $r \geq 1$ we study the coefficient sequence of the numerator…
We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
We study nonnegative and sums of squares symmetric (and even symmetric) functions of fixed degree. We can think of these as limit cones of symmetric nonnegative polynomials and symmetric sums of squares of fixed degree as the number of…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
The hyper-Catalan number $C[m_2,m_3,m_4,\ldots]$ counts the number of subdivisions of a roofed polygon into $m_2$ triangles, $m_3$ quadrilaterals, $m_4$ pentagons, etc. Its closed form has been known since Erd\'elyi and Etherington, 1940.…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…
We consider the ordered field which is the completion of the Puiseux series field over \bR equipped with a ring of analytic functions on [-1,1]^n which contains the standard subanalytic functions as well as functions given by t-adically…
This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…
The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…