中文
相关论文

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

200 篇论文

In this paper, we introduce the notion of "extension" of a toric variety and study its fundamental properties. This gives rise to infinitely many toric varieties with a special property, such as being set theoretic complete intersection or…

交换代数 · 数学 2011-07-08 Mesut Sahin

A relationship between continued fractions and Weyl groupoids of Cartan schemes of rank two is found. This allows to decide easily if a given Cartan scheme of rank two admits a finite root system. We obtain obstructions and sharp bounds for…

群论 · 数学 2008-07-02 M. Cuntz , I. Heckenberger

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…

几何拓扑 · 数学 2018-09-28 J. Blackman

Consider a tree $T=(V,E)$ with root $\circ$ and edge length function $\ell:E\to\mathbb{R}_+$. The phylogenetic covariance matrix of $T$ is the matrix $C$ with rows and columns indexed by $L$, the leaf set of $T$, with entries…

种群与进化 · 定量生物学 2025-09-22 Sean P. Svihla , Manuel E. Lladser

For two types of moderate growth representations of $(\mathbb{R}^d,+)$ on sequentially complete locally convex Hausdorff spaces (including F-representations [J. Funct. Anal. 262 (2012), 667-681], we introduce Denjoy-Carleman classes of…

泛函分析 · 数学 2021-08-19 Andreas Debrouwere , Bojan Prangoski , Jasson Vindas

Phylogenetic networks are a type of directed acyclic graph that represent how a set $X$ of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution,…

组合数学 · 数学 2017-08-11 Andrew Francis , Charles Semple , Mike Steel

It is possible to define a continued fraction expansion of elements in a function field of a curve by expanding as a Laurent series in a local parameter. Considering the square root of a polynomial $\sqrt{D(t)}$ leads to an interesting…

数论 · 数学 2021-08-17 Francesco Ballini , Francesco Veneziano

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

数论 · 数学 2019-09-23 Hamed Mousavi , Maxie D. Schmidt

Rooted triples, rooted binary phylogenetic trees on three leaves, are sufficient to encode rooted binary phylogenetic trees. That is, if $\mathcal T$ and $\mathcal T'$ are rooted binary phylogenetic $X$-trees that infers the same set of…

组合数学 · 数学 2020-12-07 Charles Semple , Gerry Toft

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…

概率论 · 数学 2023-06-05 Ryuya Namba

We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…

概率论 · 数学 2009-06-24 Pierre Del Moral , Frédéric Patras , Sylvain Rubenthaler

A generalization of the Gr\"{u}nwald difference approximation for fractional derivatives in terms of a real sequence and its generating function is presented. Properties of the generating function are derived for consistency and order of…

数值分析 · 数学 2018-03-06 H. M. Nasir , K. Nafa

In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…

组合数学 · 数学 2020-03-31 Arvind Ayyer , Ilse Fischer

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

经典分析与常微分方程 · 数学 2021-09-07 Richard J. Mathar

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

组合数学 · 数学 2010-06-29 Noga Alon , Simi Haber , Michael Krivelevich

Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…

组合数学 · 数学 2026-03-16 Pablo Blanco , Doron Zeilberger

We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…

交换代数 · 数学 2022-09-28 Daniel Erman

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

组合数学 · 数学 2019-12-10 Bo Lin , Ngoc Mai Tran

We continue study of some algebraic varieties (called resultantal varieties) started in a paper of A. Grishkov, D. Logachev "Resultantal varieties related to zeroes of L-functions of Carlitz modules". These varieties are related with the…

代数几何 · 数学 2021-12-14 Aleksandr Grishkov , Dmitry Logachev , Aleksey Zobnin

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

组合数学 · 数学 2017-11-21 Rafael S. González D'León