Related papers: Assigned rational functions of a rooted tree
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic…
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…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
We introduce a class of rational functions $A:\,\mathbb C\mathbb P^1\rightarrow \mathbb C\mathbb P^1$ which can be considered as a natural extension of the class of Latt\`es maps and establish basic properties of functions from this class.
We define two versions of compositions of matrix-valued rational functions of appropriate sizes and whenever analytic at infinity, offer a set of formulas for the corresponding state-space realization, in terms of the realizations of the…
Many PDEs involving fractional Laplacian are naturally set in unbounded domains with underlying solutions decay very slowly, subject to certain power laws. Their numerical solutions are under-explored. This paper aims at developing accurate…
Matrix functions extend scalar function concepts to linear operators, offering a unified framework with broad applications in mathematics, science, and engineering. Classical definitions--via power series, spectral calculus, or Jordan…
Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…
Using Roelcke formula for the Green function, we explicitly construct a basis in the kernel of the adjoint Laplacian on a compact polyhedral surface $X$ and compute the $S$-matrix of $X$ at the zero value of the spectral parameter. We apply…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.
This paper is devoted to the study of the second-order variational analysis of spectral functions. It is well-known that spectral functions can be expressed as a composite function of symmetric functions and eigenvalue functions. We…
We obtain new partial results supporting the spectral set conjecture in dimension 1.
We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…