其它的计数问题引导我们去研究置换群的轨道。
Other enumeration problems lead us to the study of orbits of permutation groups.
相关的原理和方法对解决某些组合计数问题有所帮助。
The relevant principle and method are helpful to solve some counting problems in combination problems.
图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
本文研究组合几何中的一个典型计数问题-整边多边形的计数问题。
Combinatorial geometry is concerned with counting objects that arise in geometric Settings.
有些只是简单的计数问题，如计算出有多少请求它的服务，每天有多少搜索服务等等。
Some are just simple counting problems, such as figuring out how many requests it serves a day, how many searches it serves a day, what the average time it takes to process those transactions is, etc.
本文研究特征为2的有限域上正交几何中的计数问题，给出了一个计数定理。
In this paper, enumeration problems in the orthogonal geometry over a finite field with characteristic 2 are studied, and an enumeration theorem is proved.
本文给出了强魔性对偶矩阵和矩阵平移积的新概念；研究了这类矩阵的计数问题。
Some new concepts on strong magic dual matrix and matrix translation product are given and counting problem of these matrices are then studied.
通过讨论，解决了标定一致二部竞赛图的计数问题，并获得了一个简明计算公式。
An enumeration problem is solved for labeled consistent bipartite tournaments, and a sharp formula is obtained.
导出了无向无标号超图和标号超目的计数级数，解决了无向超图的同构和计数问题。
Then the counting series are derived for undirected unlabeled and labeled hypergraphs, thus the isomorphism and counting problems of undirected hypergraphs are solved.
在最后一章，我们通过配对函数考虑了特定配对情况下的RNA的二级结构计数问题。
In the last chapter, we consider the enumeration problem of RNA secondary structures only for the fixed pairs using the pairing function.
利用组合理论和图的计数理论，讨论了只含有一个非平凡块的连通图的计数问题，给出了新的结论。
The enumeration problem for connective graphs with one nontrivial block was discussed by the theory of combinatorics, and the new conclusion is also given.
通过对n皇后问题棋盘矩阵的旋转，改进了回溯算法，并通过计算机集群并行实现了N皇后的计数问题。
Traditional backtracking algorithm has been improved by rotating the chessboard matrix and put into solving N-queens counting problem in computer cluster.
文章讨论了整数分拆中的一个计数问题，从中得到了一些小结论，从而为一些整数分拆的计数提供了方便。
In this paper, we solve the question of combination number in portion of an integer number and get some conclusion, so it offers convenience to some question of combinatorial number.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
基于S-P网络中P置换的重要性和加解密的一致性，本文提出了对合型列混合变换的概念，并对其代数结构、枝数和计数问题进行了深入地研究和分析。
Based on the importance of P transform and coherence in encryption-decryption in the S-P networks, we put forward the definition of involution-typed mixcolumn transform.
竞赛矩阵和竞赛图由于具有固定行和向量及列和向量的非负矩阵类的计数，是组合数学的一个非常困难的问题，因此对具有固定得分向量的竞赛矩阵的计数问题也比较困难。
But it is very difficult to compute the number of non-negative matrix with fixed score row or column vectors, so to compute the number of tournament matrix with fixed score vector is also difficult.
竞赛矩阵和竞赛图由于具有固定行和向量及列和向量的非负矩阵类的计数，是组合数学的一个非常困难的问题，因此对具有固定得分向量的竞赛矩阵的计数问题也比较困难。
But it is very difficult to compute the number of non-negative matrix with fixed score row or column vectors, so to compute the number of tournament matrix with fixed score vector is also difficult.
应用推荐