相关论文: Phylogenetic trees, augmented perfect matchings, a…

Reported is a factorization theorem for large-s behavior of total cross sections obtained in a straightforward fashion from ordinary perturbation theory. The theorem extends the standard factorization results for the Bjorken and Drell-Yan…

We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…

Phylogenetic networks provide a more general description of evolutionary relationships than rooted phylogenetic trees. One way to produce a phylogenetic network is to randomly place $k$ arcs between the edges of a rooted binary phylogenetic…

The article studies a class of generalized factorial functions and symbolic product sequences through Jacobi type continued fractions (J-fractions) that formally enumerate the divergent ordinary generating functions of these sequences. The…

Phylogenetic networks generalize phylogenetic trees in order to model reticulation events. Although the comparison of phylogenetic trees is well studied, and there are multiple ways to do it in an efficient way, the situation is much…

In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…

We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…

A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…

We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern.…

A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…

This paper provides some preliminary results on the dynamics of certain complex continued fractions. After establishing some general number theoretic results, we explore the dynamics of the natural extension map associated to a specific…

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…

Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…