| 乘积构形的超可解性 |
| |
| 引用本文： | 许建敏,牛兴文. 乘积构形的超可解性[J]. 北京化工大学学报(自然科学版), 2007, 34(3): 326-328 |
| |
| 作者姓名： | 许建敏 牛兴文 |
| |
| 作者单位： | 北京化工大学理学院， 北京 100029 |
| |
| 摘 要： | 本文给出了乘积构形格的几个运算性质。证明了乘积构形格L中元素是模元的充要条件，并利用该结论证明了乘积构形(a1×…×ak，V1+…+Vk)是超可解构形的充要条件是每个因子构形(a1，Vi)，1≤i≤k都是超可解构形。最后证明了若因子构形(ak,Vi)，1≤i≤k均是良分划构形，则乘积构形(a1×…×ak，V1+…+Vk)也是良分划构形。
|
| 关 键 词： | 乘积构形 超可解构形 模元 良分划 乘积构形 超可解构形 模元 良分划 |
| 收稿时间： | 2006-09-27 |
| 修稿时间： | 2006-09-27 |
Reducibility of centered hyperplane arrangement |
| |
| XU JianMin,NIU XingWen. Reducibility of centered hyperplane arrangement[J]. Journal of Beijing University of Chemical Technology, 2007, 34(3): 326-328 |
| |
| Authors: | XU JianMin NIU XingWen |
| |
| Affiliation: | School of Science, Beijing University of Chemical Technology, Beijing 100029, China |
| |
| Abstract: | Sevaral operation characters in the lattice L of a product arrangement have been educed. It is proven that a product arrangement (a1×…×ak,V1+…+Vk) is a supersolvable arrangement if, and only if, each arrangement (a1,Vi),1≤i≤k is also a supersolvable arrangement. It is also proven that if each arrangement (ak,Vi), 1≤i≤k is a nice patition, then the product arrangement (a1×…×ak, V1+…+Vk) is also a nice patition. |
| |
| Keywords: | product arrangement supersolvable arrangement modular nice partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京化工大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《北京化工大学学报(自然科学版)》下载全文 |
