ダウンロード数: 159

このアイテムのファイル:
ファイル 記述 サイズフォーマット 
10556788.2020.1740219.pdf142.29 kBAdobe PDF見る/開く
完全メタデータレコード
DCフィールド言語
dc.contributor.authorAndo, Kazutoshien
dc.contributor.authorFujishige, Satoruen
dc.contributor.alternative安藤, 和敏ja
dc.contributor.alternative藤重, 悟ja
dc.date.accessioned2021-05-12T03:34:31Z-
dc.date.available2021-05-12T03:34:31Z-
dc.date.issued2021-
dc.identifier.urihttp://hdl.handle.net/2433/262767-
dc.description.abstractThe one-to-one correspondence between finite distributive lattices and finite partially ordered sets (posets) is a well-known theorem of G. Birkhoff. This implies a nice representation of any distributive lattice by its corresponding poset, where the size of the former (distributive lattice) is often exponential in the size of the underlying set of the latter (poset). A lot of engineering and economic applications bring us distributive lattices as a ring family of sets which is closed with respect to the set union and intersection. When it comes to a ring family of sets, the underlying set is partitioned into subsets (or components) and we have a poset structure on the partition. This is a set-theoretical variant of the Birkhoff theorem revealing the correspondence between finite ring families and finite posets on partitions of the underlying sets, which was pursued by Masao Iri around 1978, especially concerned with what is called the principal partition of discrete systems such as graphs, matroids, and polymatroids. In the present paper we investigate a signed-set version of the Birkhoff-Iri decomposition in terms of signed ring family, which corresponds to Reiner's result on signed posets, a signed counterpart of the Birkhoff theorem. We show that given a signed ring family, we have a signed partition of the underlying set together with a signed poset on the signed partition which represents the given signed ring family. This representation is unique up to certain reflections.en
dc.language.isoeng-
dc.publisherTaylor & Francis Groupen
dc.rightsThis is an Accepted Manuscript of an article published by Taylor & Francis in 'Optimization Methods and Software' on 23 Mar 2020 (published online), available online: https://www.tandfonline.com/10.1080/10556788.2020.1740219en
dc.rightsThe full-text file will be made open to the public on 23 Mar 2021 in accordance with publisher's 'Terms and Conditions for Self-Archiving'en
dc.rightsThis is not the published version. Please cite only the published version. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用くださいen
dc.subjectSigned ring familiesen
dc.subjectsigned posetsen
dc.subjectbidirected graphsen
dc.subjectdecompositionen
dc.subjectbisubmodular functionsen
dc.titleSigned ring families and signed posetsen
dc.typejournal article-
dc.type.niitypeJournal Article-
dc.identifier.jtitleOptimization Methods and Softwareen
dc.identifier.volume36-
dc.identifier.issue2-3-
dc.identifier.spage262-
dc.identifier.epage278-
dc.relation.doi10.1080/10556788.2020.1740219-
dc.textversionauthor-
dc.addressFaculty of Engineering, Shizuoka Universityen
dc.addressResearch Institute for Mathematical Sciences, Kyoto Universityen
dcterms.accessRightsopen access-
datacite.date.available2021-03-23-
datacite.awardNumber18K11180-
datacite.awardNumber19K11839-
datacite.awardNumber.urihttps://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-18K11180/-
datacite.awardNumber.urihttps://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-19K11839/-
dc.identifier.pissn1055-6788-
dc.identifier.eissn1029-4937-
jpcoar.funderNameJapan Society for the Promotion of Science (JSPS)en
jpcoar.funderNameJapan Society for the Promotion of Science (JSPS)en
jpcoar.awardTitle相違写像の超距離及びその一般化による近似理論とアルゴリズムの開発ja
jpcoar.awardTitle劣モジュラ構造とその一般化で切り開く最適化の数理とアルゴリズムja
出現コレクション:学術雑誌掲載論文等

アイテムの簡略レコードを表示する

Export to RefWorks


出力フォーマット 


このリポジトリに保管されているアイテムはすべて著作権により保護されています。