Christian HerrmannTechnische Universität Darmstadt, Dale R. Worley
{"title":"网格的 S 胶和","authors":"Christian HerrmannTechnische Universität Darmstadt, Dale R. Worley","doi":"arxiv-2409.10738","DOIUrl":null,"url":null,"abstract":"For many equation-theoretical questions about modular lattices, Hall and\nDilworth give a useful construction: Let $L_0$ be a lattice with largest\nelement $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element\n$v_1$, and $a \\in L_0$, $b \\in L_1$ such that the intervals $[a, u_0]$ and\n$[v_1, b]$ are isomorphic. Then, after identifying those intervals you obtain\n$L_0 \\cup L_1$, a lattice structure whose partial order is the transitive\nrelation generated by the partial orders of $L_0$ and $L_1$. It is modular if\n$L_0$ and $L_1$ are modular. Since in this construction the index set $\\{0,\n1\\}$ is essentially a chain, this work presents a method -- termed S-glued --\nwhereby a general family $L_x\\ (x \\in S)$ of lattices can specify a lattice\nwith the small-scale lattice structure determined by the $L_x$ and the\nlarge-scale structure determined by $S$. A crucial application is representing\nfinite-length modular lattices using projective geometries.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"29 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"S-Glued sums of lattices\",\"authors\":\"Christian HerrmannTechnische Universität Darmstadt, Dale R. Worley\",\"doi\":\"arxiv-2409.10738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For many equation-theoretical questions about modular lattices, Hall and\\nDilworth give a useful construction: Let $L_0$ be a lattice with largest\\nelement $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element\\n$v_1$, and $a \\\\in L_0$, $b \\\\in L_1$ such that the intervals $[a, u_0]$ and\\n$[v_1, b]$ are isomorphic. Then, after identifying those intervals you obtain\\n$L_0 \\\\cup L_1$, a lattice structure whose partial order is the transitive\\nrelation generated by the partial orders of $L_0$ and $L_1$. It is modular if\\n$L_0$ and $L_1$ are modular. Since in this construction the index set $\\\\{0,\\n1\\\\}$ is essentially a chain, this work presents a method -- termed S-glued --\\nwhereby a general family $L_x\\\\ (x \\\\in S)$ of lattices can specify a lattice\\nwith the small-scale lattice structure determined by the $L_x$ and the\\nlarge-scale structure determined by $S$. A crucial application is representing\\nfinite-length modular lattices using projective geometries.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.10738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
For many equation-theoretical questions about modular lattices, Hall and
Dilworth give a useful construction: Let $L_0$ be a lattice with largest
element $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element
$v_1$, and $a \in L_0$, $b \in L_1$ such that the intervals $[a, u_0]$ and
$[v_1, b]$ are isomorphic. Then, after identifying those intervals you obtain
$L_0 \cup L_1$, a lattice structure whose partial order is the transitive
relation generated by the partial orders of $L_0$ and $L_1$. It is modular if
$L_0$ and $L_1$ are modular. Since in this construction the index set $\{0,
1\}$ is essentially a chain, this work presents a method -- termed S-glued --
whereby a general family $L_x\ (x \in S)$ of lattices can specify a lattice
with the small-scale lattice structure determined by the $L_x$ and the
large-scale structure determined by $S$. A crucial application is representing
finite-length modular lattices using projective geometries.