Michael Hawrylycz, Victor Reiner
In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense of Edelman and Jamison). We also characterize the modular elements of this lattice and compute its characteristic polynomial.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Order-generation in posets and convolution of closure operators
受Hofmann–Lawson定理启发，引入闭包算子卷积乘积，证明Krein–Milman性质可通过卷积转移，得到三个推广现有结论的偏序集表示定理，含kit点相关性质。
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated by partially ordered sets within four easy varieties.
Motivated by the theory of correspondence functors, we introduce the notion of {\em germ} in a finite poset, and the notion of {\em germ extension} of a poset. We show that any finite poset admits a largest germ extension called its {\em germ closure}. We say that a subset $U$ of a finite lattice $T$ is {\em germ extensible} in $T$ if the germ closure of $U$ naturally embeds in $T$. We show that any for any subset $S$ of a finite lattice $T$, there is a unique germ extensible subset $U$ of $T$ such that $U\subseteq S\subseteq \overline{G}(U)$, where $\overline{G}(U)\subseteq T$ is the embeddin…
We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the largest binomial coefficient. Moreover, the constant has the form $\frac{1}{c(P)}$, where $c(P)$ is the size of the smallest convex closure over all embeddings of $P$ into the Boolean lattice.
Anders Bjorner characterized which finite graded partially ordered sets arise as the posets of closure relations on cells of a finite, regular CW complex. His characterization of these "CW posets" required each open interval $(\hat{0},u)$ to have order complex homeomorphic to a sphere of dimension $rk(u)-2$. Work of Danaraj and Klee showed that sufficient conditions were for the poset to be thin and shellable. The proof of the Poincare Conjecture enables the requirement of shellability to be replaced by the homotopy Cohen-Macaulay property. This expands the range of tools that may be used to p…
This article is the second part of an essay dedicated to lattices freely generated by posets within a variety. The first part dealt with four easy varieties while this part is concerned with finitely generated varieties. Here we present a method of constructing a subdirect product L of a finite family F of finite lattices, exploiting a set of special elements of L deducted from F. This method is applied to free lattices generated by posets within finitely generated varieties, where in the case of the variety of modular lattices, we elaborate an efficient algorithm to compute the modular lattic…
We count the number of linear intervals in the Tamari and the Dyck lattices according to their height, using generating series and Lagrange inversion. Surprisingly, these numbers are the same in both lattices. We define a new family of posets on Dyck paths, which we call alt-Tamari posets. Each alt-Tamari poset depends on the choice of an increment function delta in {0,1}^n. We recover the Tamari and the Dyck lattices as extreme cases with delta = 1 and delta = 0, respectively. We prove that all the alt-Tamari posets have the same number of linear intervals of any given height.
Lattice Minors and Eulerian Posets
本文定义图与多拟阵的子式偏序集，证明其同构于正则 CW 球面的面偏序集，因而为 Euler 偏序集，并给出强映射诱导的 cd-指标不等式及紧上下界。
Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.
One-skeleton posets of Bruhat interval polytopes
该研究针对Bruhat区间多面体的1-骨架偏序集展开，证明其为格，完成该多面体为简单多面体的情形分类，解决了相关公开问题与猜想，还分类了Schubert簇中一般环面轨道闭包光滑的情形。
The poset of maximal tubings of the cycle graph is a lattice
本文证明了循环图的最大管道偏序集是格，且具有半分配性和同余一致性，通过刻画序关系并引入到路径图的映射完成证明。
Birational maps to Grassmannians, representations and poset polytopes
本文研究射影空间到 Grassmann 簇的双有理映射的图闭包，给出其显式描述、纤维计算及到退化李代数循环表示射影化的嵌入，并利用新偏序集多胞体推广 FFLV 基，得到平坦环状退化。
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic to the poset of strongly connected orientations of subgraphs of $G$. This confirms a conjecture of Caporaso and Viviani {Torelli Theorem For Graphs and Tropical Curves, Duke Math. J. 153(1) (2010), 129-171}.
We consider the problem of fast zeta and Möbius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and Möbius transforms can be computed in $O(e)$ elementary arithmetic operations, where $e$ denotes the size of the covering relation. We show that this family is exactly that of geometric lattices. We also extend the algorithms so that they work in $e$ operations for all semimodular lattices, including chains and divisor lattices. Finally, for both transforms, we provide a more general algorithm that works in $e$ operat…
Birational maps, PBW degenerate flags and poset polytopes
本研究将射影空间与格拉斯曼流形间双有理映射的图闭包结果推广至PBW退化旗簇，分析其组合、代数与几何性质，验证了环面退化的普适性，并通过箭图表示刻画旗簇图闭包。
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order posets of three different sets of involutions in the symmetric group, namely, the set of all involutions, the set of all fixed point free involutions, and the set of all involutions with signed fixed points (or "clans"). These distinguished sets of involutions parameterize Borel orbits in the classical symmetric spaces associated to the general linear group. I…
Posets of Hyper $(b,t)$-ary Partitions are Distributive Lattices
该研究推广了超二进制分拆偏序集为分配格的结果，证明超 $(b,t)$ 元分拆（部分为 $b$ 的幂，重数至多 $t\ge b$）的偏序集也是分配格，其并不可约元素同构于栅栏偏序集。
Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets $P$ as $\frac{n \choose \lfloor n/2\rfloor}{M(P)}$, where $M(P)$ denotes the minimal size of the convex hull of a copy of $P$. We discuss both weak and strong (induced) embeddings.
Given partially ordered sets (posets) $(P, \leq_P)$ and $(P', \leq_{P'})$, we say that $P'$ contains a copy of $P$ if for some injective function $f: P\rightarrow P'$ and for any $X, Y\in P$, $X\leq _P Y$ if and only of $f(X)\leq_{P'} f(Y)$. For any posets $P$ and $Q$, the poset Ramsey number $R(P,Q)$ is the least positive integer $N$ such that no matter how the elements of an $N$-dimensional Boolean lattice are colored in blue and red, there is either a copy of $P$ with all blue elements or a copy of $Q$ with all red elements. We focus on a poset Ramsey number $R(P, Q_n)$ for a fixed poset $P…
A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $ϕ$ of $\cal S$ such that $ϕ\circ j=f$. In this paper, we characterise the quasi-projective posets and lattices of arbitrary cardinalities, finite permutations, graphs and digraphs of arbitrary cardinalities with loops and without loops, finite hypergraphs, and finite point-line geometries.
For every finite Coxeter group W , we prove that the number of chains in the shard intersection lattice introduced by Reading on the one hand and in the BHZ poset introduced by Bergeron, Zabrocki and the third author on the other hand, are the same. We also show that these two partial orders are related by an equality between generating series for their M{ö}bius numbers, and provide a dimension-preserving bijection between the order complex on the BHZ poset and the pulling triangulation of the permutahedron arising from the right weak order, analogous to the bijection defined by Reading betwee…
The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in the two linear extensions. We prove a formula for the linear extension diameter of the Boolean Lattice and characterize the diametral pairs of linear extensions. For the more general case of a downset lattice D_P of a 2-dimensional poset P, we characterize the diametral pairs of linear extensions of D_P and show how to compute the linear extension diameter of …
The abstract induced subgraph poset of a graph is the isomorphism class of the induced subgraph poset of the graph, suitably weighted by subgraph counting numbers. The abstract bond lattice and the abstract edge-subgraph poset are defined similarly by considering the lattice of subgraphs induced by connected partitions and the poset of edge-subgraphs, respectively. Continuing our development of graph reconstruction theory on these structures, we show that if a graph has no isolated vertices, then its abstract bond lattice and the abstract induced subgraph poset can be constructed from the abst…
Three families of posets depending on a nonnegative integer parameter $m$ are introduced. The underlying sets of these posets are enumerated by the $m$-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and another one is a generalization of Tamari lattices. The three families of posets are related: they fit into a chain for the order extension relation and they share some properties. Two associative algebras are constructed as quotients of generalizations of the Malvenuto-Reutenauer algebra. Their products describe intervals of our analogues of Stanley lattices and…
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting to the partitions whose blocks induce connected subgraphs of $G$. In this article, we introduce a natural noncrossing analogue of the bond lattice, the noncrossing bond poset, $NC_G$, obtained by restricting to the noncrossing partitions of $L_G$. Both the noncrossing partition lattice and the bond lattice have many nice combinatorial properties. We show that…
Source characterization of the hypergraphic posets
本文将 Bergeron 和 Pilaud 对区间超图偏序集的源刻画推广到任意超图，建立了超图偏序集与无环定向源之间的对应关系。
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we get such a characterization for semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected hypergraphs having finite edges.
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We give two formulas for the rank function of this poset.
Generalized snake posets, order polytopes, and lattice-point enumeration
本文研究了广义蛇偏序集的顺序聚类的Ehrhart理论，推导了其$h^*$-多项式的显式公式和递推关系，并证明了其$h^*$-向量的界性。
In this note, we determine the maximum size of a $\{V_{k}, Λ_{l}\}$-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters $k$ and $l$. These results generalize earlier work by Shahriari and Yu. We also prove a general LYM-type lemma for the linear lattice which resolves a conjecture of Shahriari and Yu.
In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any linear extension of $Q_L$ generates a distinguishing 2-coloring of $L$. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2.
Recent work of Hopkins establishes that the lattice of order ideals of a minuscule poset satisfies the coincidental down-degree expectations property of Reiner, Tenner, and Yong. His approach appeals to the classification of minuscule posets. A uniform proof is presented herein. The blueprint follows that of Rush and Wang in their uniform proof that various cardinality statistics are homomesic on orbits of order ideals of minuscule posets under the Fon-Der-Flaass action. The underpinning remains the original insight of Rush and Shi into the structure of the isomorphism between the weight latti…
In this article we introduce the $m$-cover poset of an arbitrary bounded poset $\mathcal{P}$, which is a certain subposet of the $m$-fold direct product of $\mathcal{P}$ with itself. Its ground set consists of multichains of $\mathcal{P}$ that contain at most three different elements, one of which has to be the least element of $\mathcal{P}$, and the other two elements have to form a cover relation in $\mathcal{P}$. We study the $m$-cover poset from a structural and topological point of view. In particular, we characterize the posets whose $m$-cover poset is a lattice for all $m>0$, and we cha…
Inverse limits of various posets
本文研究了各种偏序集的逆极限，探讨了它们的树和格结构，并扩展到带符号的限制增长函数及多种格结构。
Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
Induced orthogonality in semilattices with 0 and in pseudocomplemented lattices and posets
本文在带0的半格、伪补格及偏序集上定义正交关系，证明其闭包子集格在原子或完全条件下构成完全布尔代数。
The diamond product is the poset operation that when applied to the face lattices of two polytopes results in the face lattice of the Cartesian product of the polytopes. Application of the diamond product to two Eulerian posets is a bilinear operation on the cd-indices of the two posets, yielding a product on cd-polynomials. A lattice path interpretation is provided for this product of two cd-monomials.
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$: $\mathcal{P}$ might not cover the minimum and maximum of $2^{[n]}$, and at most $|P|-1$ additional points due to divisibility. In particular, if $|P|$ divides $2^{n}-2$, then the truncated Boolean lattice $2^{[n]}-\{\emptyset,[n]\}$ can be partitioned into copies of $P$. This confirms a conjecture of Lonc from 1991.
In this article we use the theory of interval-posets recently introduced by Ch{â}tel and Pons in order to describe some interesting families of intervals in the Tamari lattices. These families are defined as interval-posets avoiding specific configurations. At first, we consider what we call exceptional interval-posets and show that they correspond to the intervals which are obtained as images of noncrossing trees in the Dendriform operad. We also show that the exceptional intervals are exactly the intervals of the Tamari lattice induced by intervals in the poset of noncrossing partitions. In …
Lattice of Integer Flows and the Poset of Strongly Connected Orientations for Regular Matroids
本文将Amini关于整数流格的Voronoi多面体面偏序集与子图强连通定向偏序集同构的结果推广至正则拟阵，并证明整数割定理可作为整数流定理在拟阵对偶性下的直接推论。
We analyze the poset of moves in chip-firing, as defined by Klivans and Liscio. Answering a question of Propp, we show that the move poset forms the join-irreducibles of the poset of configurations. The proof involves a graph augmentation and an analysis of configurations in which only one firing move is available. We then use this framework to analyze the problem of chip-firing on a line, where the move poset is relevant to the problem of labeled chip-firing.
A characterization of permutability of 2-uniform tolerances on posets
本文将格上2-一致相容性的可置换性研究推广至偏序集，通过修改友好性概念，证明了在不含无穷链的偏序集上两个相容性可置换当且仅当它们在新意义下友好。
We investigate connections between the free lattice generated by a poset while preserving certain bounds and the canonical extension of a poset. Explicitly, we describe how the free lattice generated by a poset while preserving certain bounds can be constructed as a colimit of `intermediate structures' as they occur in the construction of a canonical extension of a poset.
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex geometry, then Reg(P,f) is pseudocomplemented. The Dedekind-MacNeille completion of the poset of regions of any central hyperplane arrangement can be obtained in this way, hence it is pseudocomplemented. The lattice Reg(P,f) carries a particularly interesting structure for special types of convex geometries, that we call closure spaces of semilattice type. For …
A subposet $Q'$ of a poset $Q$ is a copy of a poset $P$ if there is a bijection $f$ between elements of $P$ and $Q'$ such that $x\leq y$ in $P$ iff $f(x)\leq f(y)$ in $Q'$. For posets $P, P'$, let the poset Ramsey number $R(P,P')$ be the smallest $N$ such that no matter how the elements of the Boolean lattice $Q_N$ are colored red and blue, there is a copy of $P$ with all red elements or a copy of $P'$ with all blue elements. We provide some general bounds on $R(P,P')$ and focus on the situation when $P$ and $P'$ are both Boolean lattices. In addition, we give asymptotically tight bounds for t…
An extension of Birkhoff's representation theorem to locally-finite distributive lattices
本文扩展了布劳尔表示定理，针对局部有限分配格，提出新的表示定理，通过素滤子的对称差与特定理想的关系来定义偏序。
Posets which are retract of products of chains are characterized by means of two properties: \emph{the chain-gap property} and \emph{the selection property} (Rival and Wille, 1981 \cite {R-W}). Examples of posets with the selection property and not the chain-gap property are easy to find. To date, the Boolean lattice $\Power (ω_1)/Fin$ was the sole example of lattice without the selection property \cite {R-W}. We prove that it does not have the chain-gap property. We provide an example of a lattice which has the chain-gap property but not the selection property. This answer questions raised in…
Let $F(n,k)$ ($f(n,k)$) denote the maximum possible size of the smallest color class in a (partial) $k$-coloring of the Boolean lattice $B_n$ that does not admit a rainbow antichain of size $k$. The value of $F(n,3)$ and $f(n,2)$ has been recently determined exactly. We prove that for any fixed $k$ if $n$ is large enough, then $F(n,k),f(n,k)=2^{(1/2+o(1))n}$ holds. We also introduce the general functions for any poset $P$ and integer $c\ge |P|$: let $F(n,c,P)$ ($f(n,c,P)$) denote the the maximum possible size of the smallest color class in a (partial) $c$-coloring of the Boolean lattice $B_n$ …
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion formula. We introduce an involution on several of the interrelated combinatorial objects and constructions associated to type $A$ surface cluster algebras, including certain classes of arcs, triangulations, and distributive lattices. We use these involutions to formulate a dual version of skein relations for arcs, and dual versions of three existing expansion pos…
We introduce the notion of a \emph{Whitney dual} of a graded poset. Two posets are Whitney duals to each other if (the absolute value of) their Whitney numbers of the first and second kind are interchanged between the two posets. We define new types of edge and chain-edge labelings which we call \emph{Whitney labelings}. We prove that every graded poset with a Whitney labeling has a Whitney dual. Moreover, we show how to explicitly construct a Whitney dual using a technique involving quotient posets. As applications of our main theorem, we show that geometric lattices, the lattice of noncrossi…
Residuated mappings and homomorphisms in posets
将弱正则剩余映射概念从格推广到偏序集，定义算子剩余映射并研究其性质，同时修改偏序集同态概念并探讨与剩余映射的关系。
The Scarf complex for lattices is well understood and utilized. In 2014, the author expanded the use of the term Scarf complex to encompass an infinite set in $\mathbb{Z}^n$ that was generated via an action of a lattice $Λ\in\mathbb{Z}^n$ upon a finite subset $A\subset\mathbb{N}^n$. This paper aims to further generalize the use of Scarf complex by removing the integer lattice completely while maintaining the essence of the Scarf complex.
Reiner, Tenner, and Yong recently introduced the coincidental down-degree expectations (CDE) property for finite posets and showed that many nice posets are CDE. In this paper we further explore the CDE property, resolving a number of conjectures about CDE posets put forth by Reiner-Tenner-Yong. A consequence of our work is the completion of a case-by-case proof that any minuscule lattice is CDE. We also explain two major applications of the study of CDE posets: formulas for certain classes of set-valued tableaux; and homomesy results for rowmotion and gyration acting on sets of order ideals.
Chute Move Posets are Lattices
本文通过证明约化管道梦境集合与 Lehmer tableaux 构成的偏序集同构，解决了 Rubey 2012 年的猜想，证明其是半分配多边形格且多边形仅为菱形或五边形。
Rowmotion and generalized toggle groups
本文将切换群从序理想推广到任意子集族，证明广义切换群的结构定理，并将 rowmotion 推广为覆盖闭包映射，证明其双射性等价于闭集族同构于序理想集。
For any finite path $v$ on the square grid consisting of north and east unit steps, starting at (0,0), we construct a poset Tam$(v)$ that consists of all the paths weakly above $v$ with the same number of north and east steps as $v$. For particular choices of $v$, we recover the traditional Tamari lattice and the $m$-Tamari lattice. Let $\overleftarrow{v}$ be the path obtained from $v$ by reading the unit steps of $v$ in reverse order, replacing the east steps by north steps and vice versa. We show that the poset Tam$(v)$ is isomorphic to the dual of the poset Tam$(\overleftarrow{v})$. We do s…
We introduce $δ$-cliffs, a generalization of permutations and increasing trees depending on a range map $δ$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we describe sufficient conditions to have EL-shellable posets, lattices with algorithms to compute the meet and the join of two elements, and lattices constructible by interval doubling. Some of these subposets admit natural geometric realizations. Then, we introduce three families of subposets which, for some maps $δ$, have underlying sets enumerated by the Fuss-Catala…
The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventieth of the twentieth century by B. Zelinka and the first author. Since tolerances need not be transitive, their blocks may overlap and hence in general the set of all blocks of a tolerance cannot be converted into a quotient algebra in the same way as in the case of congruences. However, G. Czédli showed that lattices can be factorized by means of tolerances in a natural way, and J. Grygiel and S. Radelecki proved some variant of an Isomorphism Theorem for tolerances on lattices. The…
We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial order on the symmetric group studied by Edelman.
Given posets $\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k$, let the {\em Boolean Ramsey number} $R(\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k)$ be the minimum number $n$ such that no matter how we color the elements in the Boolean lattice $\mathbf{B}_n$ with $k$ colors, there always exists a poset $\mathbf{P}_i$ contained in $\mathbf{B}_n$ whose elements are all colored with $i$. This function was first introduced by Axenovich and Walzer~\cite{AW}. Recently, many results on determining $R(\mathbf{B}_m,\mathbf{B}_n)$ have been published. In this paper, we will study the function $R(\mathbf…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。