共查询到20条相似文献,搜索用时 546 毫秒
1.
2.
3.
4.
5.
6.
A coloring (partition) of the collection of all -subsets of a set is -regular if the number of times each element of appears in each color class (all sets of the same color) is the same number . We are interested in finding the conditions under which a given -regular coloring of is extendible to an -regular coloring of for and . The case was solved by Cruse, and due to its connection to completing partial symmetric latin squares, many related problems are extensively studied in the literature, but very little is known for . The case was solved by Häggkvist and Hellgren, settling a conjecture of Brouwer and Baranyai. The cases and were solved by Rodger and Wantland, and Bahmanian and Newman, respectively. In this paper, we completely settle the cases and . 相似文献
7.
8.
9.
Let be an integer with and be a connected -uniform hypergraph with edges. By refining the broken cycle theorem for hypergraphs, we show that if , then the -list assignment of admitting the fewest colorings is the constant list assignment. This extends the previous results of Donner, Thomassen, and the current authors for graphs. 相似文献
10.
11.
12.
Dong Zhang Zhenwei Guo Gang Wang Tongsong Jiang 《Mathematical Methods in the Applied Sciences》2020,43(6):3513-3523
Due to the rise of commutative quaternion in Hopfield neural networks, digital signal, and image processing, one encounters the approximate solution problems of the commutative quaternion linear equations and . This paper, by means of real representation and complex representation of commutative quaternion matrices, introduces concepts of norms of commutative quaternion matrices and derives two algebraic techniques for finding solutions of least squares problems in commutative quaternionic theory. 相似文献
13.
14.
15.
16.
17.
18.
19.