【24h】

Some (0,1)-Matrices Enumerative Problems

机译:一些(0,1)-Matrices枚举问题

获取原文

摘要

Let f(m,n,s,t) be the number of (0,1) - matrices of size m × n such that each row has exactly s ones and each column has exactly t ones (sm = nt). The determination of f(m,n,s,t) is an unsolved problem, except for very small s, t. Let f_s(n) be the number of (0,1) - matrices of size n×n such that each row has exactly s 1's and each column has exactly s 1's and with the restriction that no 1 stands on the main diagonal. The determination of f_s(n) is also an unsolved problem. We will present some formulas for f(m,n,s,t) and f_s(n).
机译:让F(m,n,s,t)是大小m×n的(0,1)的数量,使得每行具有恰好s的矩阵,并且每列具有完全tα(sm = nt)。除了非常小的S,T之外,F(m,n,s,t)的确定是未解决的问题。让F_S(n)是(0,1)的数量 - 尺寸n×n的矩阵,使得每一行恰好S 1,并且每列具有恰好S 1,并且限制没有1位于主对角线上。 F_S(n)的确定也是未解决的问题。我们将为f(m,n,s,t)和f_s(n)提供一些公式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号