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 - http://www.scopus.com/inward/record.url?scp=33645051965&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645051965&partnerID=8YFLogxK
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 -