基数(数据建模)
上下界
组合数学
建设性的
推定证明
数学
集合(抽象数据类型)
基数(语言学)
离散数学
计算机科学
数据挖掘
数学分析
语言学
哲学
过程(计算)
程序设计语言
操作系统
摘要
The extremal problem we consider is to study the maximum cardinality of a minimal suitable set of permutations. We give a lower bound of this maximum cardinality. Proof for the lower bound is constructive and produces corresponding sets of permutations. Some exact values are also determined.
科研通智能强力驱动
Strongly Powered by AbleSci AI