中文
相关论文

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

200 篇论文

The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…

组合数学 · 数学 2026-05-01 Jean Liendo

For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…

数论 · 数学 2015-09-16 Clemens Heuberger , Daniel Krenn , Stephan Wagner

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

符号计算 · 计算机科学 2015-07-16 Sébastien Maulat , Bruno Salvy

The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…

交换代数 · 数学 2008-05-28 Timur R. Seifullin

We study actions by filtered automorphisms on classical generalized Weyl algebras (GWAs). In the case of a defining polynomial of degree two, we prove that the fixed ring under the action of a finite cyclic group of filtered automorphisms…

环与代数 · 数学 2019-08-29 Jason Gaddis , Robert Won

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by…

离散数学 · 计算机科学 2015-03-17 Michel Habib , Thu-Hien To

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…

组合数学 · 数学 2020-07-27 Bao-Xuan Zhu

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. Congruences for $d_k(n)$ modulo certain powers of primes have been proven via elementary…

数论 · 数学 2025-08-19 Dandan Chen , Tianjian Xu , Siyu Yin

We determine the generating function for the $\mathbb{S}_n$-equivariant Chow polynomials of the braid matroid $B_n$. The Chow polynomial of $B_n$ is the Poincar\'e polynomial of the wonderful compactification of the complement of the braid…

代数几何 · 数学 2026-03-31 Siddarth Kannan , Lukas Kühne

Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem of deciding if two phylogenetic networks embed the same sets of phylogenetic trees is computationally hard, \blue{in…

组合数学 · 数学 2021-04-13 Janosch Doecker , Simone Linz , Charles Semple

Phylogenetics uses alignments of molecular sequence data to learn about evolutionary trees relating species. Along branches, sequence evolution is modelled using a continuous-time Markov process characterised by an instantaneous rate…

In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling…

组合数学 · 数学 2014-08-11 William Y. C. Chen , Amy M. Fu

Following van der Poorten, we consider a family of nonlinear maps which are generated from the continued fraction expansion of a function on a hyperelliptic curve of genus $\mathrm{g}$. Using the connection with the classical theory of…

数论 · 数学 2020-01-01 Andrew N. W. Hone

Let $A$ be a $W$-algebra over a field $F$ of characteristic zero, where $W$ is any $F$-algebra. We first develop a comprehensive theory of generalized identities independent of the algebraic structure of $W$, using the multiplier algebra of…

环与代数 · 数学 2026-05-01 Fabrizio Martino , Carla Rizzo

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

历史与综述 · 数学 2007-05-23 Leonhard Euler

In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…

组合数学 · 数学 2015-12-15 Ricky X. F. Chen , Christian M. Reidys

In \cite{BaDeFePi96} the concept of nondecreasing Dyck paths was introduced. We continue this research by looking at it from the point of view of words, rational languages, planted plane trees, and continued fractions. We construct a…

组合数学 · 数学 2019-10-28 Helmut Prodinger

We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…

数论 · 数学 2015-09-16 S. G. Dani

The inference of phylogenetic networks, which model complex evolutionary processes including hybridization and gene flow, remains a central challenge in evolutionary biology. Until now, statistically consistent inference methods have been…

We provide a direct connection between Springer theory, via Green polynomials, the irreducible representations of the pin cover $\wti W$, a certain double cover of the Weyl group $W$, and an extended Dirac operator for graded Hecke…

表示论 · 数学 2013-05-08 Dan Ciubotaru , Xuhua He
‹ 上一页 1 8 9 10 下一页 ›