相关论文: A Note on Planar and Dismantlable Lattices

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…

In this article we give several examples of line bundles on certain non-compact surfaces that cannot be equipped with a flat connection.

In this note we study the finite groups whose subgroup lattices are dismantlable.

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…

A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

Let $L$ be a distributive lattice and $R[L]$ the associated Hibi ring. We show that if $L$ is planar, then any bounded Hibi subring of $R[L]$ has a quadratic Gr\"obner basis. We characterize all planar distributive lattices $L$ for which…

We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear…

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…

We prove the equivalence of EL-shellability and the existence of recursive atom ordering independent of roots. We show that a comodernistic lattice, as defined by Schweig and Woodroofe, admits a recursive atom ordering independent of roots,…

Martingale-like sequences in vector lattice and Banach lattice frameworks are defined in the same way as martingales are defined in [Positivity 9 (2005), 437--456]. In these frameworks, a collection of bounded $X$-martingales is shown to be…

We construct a metrizable Lawson semitopological semilattice $X$ whose partial order $\le_X=\{(x,y)\in X\times X:xy=x\}$ is not closed in $X\times X$. This resolves a problem posed earlier by the authors.

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite Boolean algebra, or contains an antichain of size…

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

Let $H$ be a simple undirected graph and $G=\mathrm{L}(H)$ be its line graph. Assume that $\Delta(G)$ denotes the clique complex of $G$. We show that $\Delta(G)$ is sequentially Cohen-Macaulay if and only if it is shellable if and only if…

We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of…

According to a 2002 theorem by Cardaliaguet and Tahraoui, an isotropic, compact and connected subset of the group $\operatorname{GL}^+(2)$ of invertible $2\times2-\,$matrices is rank-one convex if and only if it is polyconvex. In a 2005…

This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…