On discrete idempotent paths

DOI10.1007/978-3-030-28796-2_25MaRDI QIDQ2333051zbMATH OpenOpenAlexFDO

Authors Luigi Santocanale

Publication date 6 November 2019

Full work available at URL https://arxiv.org/abs/1906.05590

zbMATH Keywords

discrete pathidempotentjoin-continuous map

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structure theory of lattices (06B05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Semigroups of transformations, relations, partitions, etc. (20M20)

Abstract: The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps from the chain { 0, 1,. .. , n } to itself. We explicitly describe this monoid structure and, relying on a general characterization of idempotent join-continuous maps from a complete lattice to itself, we characterize idempotent paths as upper zigzag paths. We argue that these paths are counted by the odd Fibonacci numbers. Our method yields a geometric/combinatorial proof of counting results, due to Howie and to Laradji and Umar, for idempotents in monoids of monotone endomaps on finite chains.

Recommendations

• Lattice paths and submonoids of \(\mathbb{Z}^2\)
• Enumeration of idempotents in planar diagram monoids
• The cardinal and the idempotent number of various monoids of transformations on a finite chain.
• Enumeration of idempotents in diagram semigroups and algebras
• The monoid of orientation-preserving mappings on a chain

Cited in

(3)

• Skew metrics valued in Sugihara semigroups
• Counting and Computing Join-Endomorphisms in Lattices
• The Involutive Quantaloid of Completely Distributive Lattices

This page was built for publication: On discrete idempotent paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333051)