TY - JOUR
AU1 - MARENICH, E. E.
AB - -- Let HR(n, r) be equal to the number of matrices with non-negative integer elements such that all row sums and all column sums are equal to r and all elements with indices from a set A are equal to zero. We investigate the properties of the function HR(H, r) and give a combinatorial interpretation of the obtained results. 1. INTRODUCTION In [1] Kenji Mano investigated the number H(n,r) of different ways to allocate rar objects of ra types with r objects of each type among ra persons such that each person receives r objects. The number #(n,r) may be interpreted as the number of ra ra matrices (a tj ) with non-negative integer elements which satisfy the conditions In all subsequent papers H(n,r) is the number of such matrices. In [2] the following hypothesis (ADG hypothesis) was proposed: for any ra and r where = \ \ and ct depend onraand i only. Representation (1.2) was proved by Stanley [3, 4] and Ehrhart [6]. The literature on the ADG hypothesis and its generalizations is quite extensive, we note only the papers [1-12, 14-18]. In [12] a combinatorial approach to evaluation of H(n,r) was suggested. Let R be
TI - Combinatorial approach to enumeration of doubly stochastic non-negative integer square matrices
JF - Discrete Mathematics and Applications
DO - 10.1515/dma.1993.3.6.649
DA - 1993-01-01
UR - https://www.deepdyve.com/lp/de-gruyter/combinatorial-approach-to-enumeration-of-doubly-stochastic-non-sHx0mH3k2B
SP - 649
EP - 662
VL - 3
IS - 6
DP - DeepDyve