English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $P$ be a finite poset with an element $s$ such that (1) for all $x\in P$,either $s\vee x$ or $s\wedge x$ exists; and (2) for all $x,y\in P$ such that$x<y$, if $s\wedge x$ does not exist but $s\wedge y$ does exist, then $(s\wedgey)\vee x$ exists. Kozlov, the winner of the 2005 European Prize inCombinatorics ("for deep combinatorial results obtained by algebraic topologyand particularly for the solution of a conjecture of Lov\'asz"), conjectured inthe 1998 Proceedings of the American Mathematical Society that the ordercomplex of $P$ is non-evasive. We prove this conjecture.

A Conjecture of Kozlov from the 1998 Proceedings of the American  Mathematical Society: Non-Evasive Order Complexes and Generalizations of  Non-Complemented Lattices