相关论文: Rooted trees and an exponential-like series
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t. The coefficients which appear in these formulas can be…
We study a natural Lie algebra structure on the free vector space generated by all rooted planar trees as the associated Lie algebra of the nonsymmetric operad (non-$\Sigma$ operad, preoperad) of rooted planar trees. We determine whether…
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…
The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of…
This work is a sequel of a previous work of one of the authors (Y.\^O), which treated certain congruence relation between an elliptic Gauss sum and a coefficient of power series expansion at the origin of the lemniscate sine function. We…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
We develop general results on centroids of Lie algebras and apply them to determine the centroid of extended affine Lie algebras, loop-like and Kac-Moody Lie algebras, and Lie algebras graded by finite root systems.
We consider a general class of preferential attachment schemes evolving by a reinforcement rule with respect to certain sublinear weights. In these schemes, which grow a random network, the sequence of degree distributions is an object of…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
This work delves into the {\it quotient of an affine semigroup by a positive integer}, exploring its intricate properties and broader implications. We unveil an {\it associated tree} that serves as a valuable tool for further analysis.…
We give a detailed description of the torsors that correspond to multiloop algebras. These algebras are twisted forms of simple Lie algebras extended over Laurent polynomial rings. They play a crucial role in the construction of Extended…
For a complex quasi-projective manifold with a finite group action, we define higher order generalized Euler characteristics with values in the Grothendieck ring of complex quasi-projective varieties extended by the rational powers of the…
We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
The affine general linear group acting on a vector space over a prime field is a well-understood mathematical object. Its elementary abelian regular subgroups have recently drawn attention in applied mathematics thanks to their use in…
We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
This note presents an encoding and a decoding algorithms for a forest of (labelled) rooted uniform hypertrees and hypercycles in linear time, by using as few as $n - 2$ integers in the range $[1,n]$. It is a simple extension of the…