Fretful
发表于 2025-3-28 17:39:48
http://reply.papertrans.cn/16/1530/152915/152915_41.png
切割
发表于 2025-3-28 19:22:39
Dependable Computing - EDCC 2021 Workshopszkin paths and non-crossing trees, and T-Motzkin paths and ordered pairs of ternary trees. Symbolic equations for both paths, and thus generating functions for the paths, are provided. Using these, various parameters involving the two paths are analyzed.
BUDGE
发表于 2025-3-29 02:18:40
Dependable Computing - EDCC 2021 Workshopsbefore us, the simple, “cheating” solution to a hard problem is the best. So before you spend days (and possibly years) trying to answer a mathematical question by analyzing and trying to ‘understand’ its structure, let your computer generate enough data, and then let it guess the answer. Often its
GREG
发表于 2025-3-29 06:58:46
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra978-3-030-44559-1Series ISSN 0943-853X Series E-ISSN 2197-8409
打击
发表于 2025-3-29 08:41:22
http://reply.papertrans.cn/16/1530/152915/152915_45.png
surrogate
发表于 2025-3-29 11:58:53
João Soares,João Lourenço,Nuno Preguiçaal identities using transformation properties of the refined .-trinomials in an iterative fashion in the spirit of Bailey chains. One of these two hierarchies contains an identity which is equivalent to Capparelli’s first Partition Theorem.
猜忌
发表于 2025-3-29 16:51:26
http://reply.papertrans.cn/16/1530/152915/152915_47.png
合群
发表于 2025-3-29 22:37:51
http://reply.papertrans.cn/16/1530/152915/152915_48.png
人充满活力
发表于 2025-3-30 02:09:15
Dependable Computing - EDCC 2020 Workshopscoefficients that are rational in .. We provide two different proofs: one is algorithmic and uses the second author’s computer algebra package .; the second is based on complex contour integrals. In many instances, these results are extended to double sums of the above form where . is replaced by . with independent parameter ..
马赛克
发表于 2025-3-30 05:22:45
http://reply.papertrans.cn/16/1530/152915/152915_50.png