On the congruences of some combinatorial numbers

Sen Peng Eu; Shu Chung Liu; Yeong Nan Yeh

doi:10.1111/j.1467-9590.2006.00337.x

On the congruences of some combinatorial numbers

Sen Peng Eu
, Shu Chung Liu^*
, Yeong Nan Yeh

^*此作品的通信作者

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

6 引文斯高帕斯（Scopus）

摘要

In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Apéry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.

原文	英語
頁（從 - 到）	135-144
頁數	10
期刊	Studies in Applied Mathematics
卷	116
發行號	2
DOIs	https://doi.org/10.1111/j.1467-9590.2006.00337.x
出版狀態	已發佈 - 2006 2月
對外發佈	是

ASJC Scopus subject areas

應用數學

存取文件

10.1111/j.1467-9590.2006.00337.x

其它文件與鏈接

引用此

@article{4f21558c03ad49c9aeb0b23af03a6d71,

title = "On the congruences of some combinatorial numbers",

abstract = "In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Ap{\'e}ry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.",

author = "Eu, \{Sen Peng\} and Liu, \{Shu Chung\} and Yeh, \{Yeong Nan\}",

year = "2006",

month = feb,

doi = "10.1111/j.1467-9590.2006.00337.x",

language = "English",

volume = "116",

pages = "135--144",

journal = "Studies in Applied Mathematics",

issn = "0022-2526",

publisher = "John Wiley \& Sons Inc.",

number = "2",

}

TY - JOUR

T1 - On the congruences of some combinatorial numbers

AU - Eu, Sen Peng

AU - Liu, Shu Chung

AU - Yeh, Yeong Nan

PY - 2006/2

Y1 - 2006/2

N2 - In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Apéry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.

AB - In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Apéry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.

UR - https://www.scopus.com/pages/publications/33645051965

UR - https://www.scopus.com/pages/publications/33645051965#tab=citedBy

U2 - 10.1111/j.1467-9590.2006.00337.x

DO - 10.1111/j.1467-9590.2006.00337.x

M3 - Article

AN - SCOPUS:33645051965

SN - 0022-2526

VL - 116

SP - 135

EP - 144

JO - Studies in Applied Mathematics

JF - Studies in Applied Mathematics

IS - 2

ER -

On the congruences of some combinatorial numbers

摘要

ASJC Scopus subject areas

存取文件

其它文件與鏈接

指紋

引用此