{"title":"停止变量问题的代数方法:表示理论与应用","authors":"Melvin Tainiter","doi":"10.1016/S0021-9800(70)80022-9","DOIUrl":null,"url":null,"abstract":"<div><p>We develop the relationship between distributive lattices and stopping variable problems by showing that the class of stopping variables has this structure. Using representation theory for distributive lattices we reduce the “secretary problem” and the <em>S<sub>n</sub>/n</em>, problem for Bernoulli trials to linear programming problems.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 2","pages":"Pages 148-161"},"PeriodicalIF":0.0000,"publicationDate":"1970-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80022-9","citationCount":"0","resultStr":"{\"title\":\"Algebraic approach to stopping variable problems: Representation theory and applications\",\"authors\":\"Melvin Tainiter\",\"doi\":\"10.1016/S0021-9800(70)80022-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We develop the relationship between distributive lattices and stopping variable problems by showing that the class of stopping variables has this structure. Using representation theory for distributive lattices we reduce the “secretary problem” and the <em>S<sub>n</sub>/n</em>, problem for Bernoulli trials to linear programming problems.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 2\",\"pages\":\"Pages 148-161\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80022-9\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algebraic approach to stopping variable problems: Representation theory and applications
We develop the relationship between distributive lattices and stopping variable problems by showing that the class of stopping variables has this structure. Using representation theory for distributive lattices we reduce the “secretary problem” and the Sn/n, problem for Bernoulli trials to linear programming problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
