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

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…

This paper proposes a connection method \`a la Bibel for an exception-tolerant family of description logics (DLs). As for the language, we assume the DL $\mathcal{ALCH}$ extended with two typicality operators: one on (complex) concepts and…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

We prove that an irreducible lattice in a semisimple algebraic group is virtually isomorphic to an arithmetic lattice if and only if it admits a faithful self-similar action on a rooted tree of finite valency.

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…

We prove a number of results concerning the embedding of a Banach lattice $X$ into an r.i. space $Y$. For example we show that if $Y$ is an r.i. space on $[0,\infty)$ which is $p$-convex for some $p>2$ and has nontrivial concavity then any…

When $\mathcal{C}$ is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable. When $\mathcal{C}$ is indeed a finite simple graph, we study various characterizations of…

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that…

We present an example of a 6-web W (6, 3, 2) of codimension two and of maximum rank on a six-dimensional manifold which is not almost Grassmannizable.

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…

We show that the class of Contact join-semilattices, as introduced by T. Ivanova, is not finitely axiomatizable. On the other hand, a simple finite axiomatization exists for the class of those join semilattices with a weak contact relation…

Let k be an algebraically closed field of characteristic 0, and let f be a morphism of smooth projective varieties from X to Y over the ring k((t)) of formal Laurent series. We prove that if a general geometric fiber of f is rationally…

A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…

For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…

If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…

A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.