Related papers: Lattice structure of Grid-Tamari orders
The Baumslag-Solitar groups: BS(m,n)=<x,y| x y^{m} x^{-1} = y^{n}> are some of the simplest interesting infinite groups which are not lattices in Lie groups. They have been studied in depth from the point of view of combinatorial group…
We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…
The structure of anticyclic operad on the Dendriform operad defines in particular a matrix of finite order acting on the vector space spanned by planar binary trees. We compute its characteristic polynomial and propose a (compatible)…
In \cite{CGH15} we introduced TiRS graphs and TiRS frames to create a new natural setting for duals of canonical extensions of lattices. In this continuation of \cite{CGH15} we answer Problem 2 from there by characterising the perfect…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
Let $v$ be a grid path made of north and east steps. The lattice $\rm{T{\scriptsize AM}}(v)$, based on all grid paths weakly above $v$ and sharing the same endpoints as $v$, was introduced by Pr\'eville-Ratelle and Viennot (2014) and…
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…
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}$…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
For positive integers $m$ and $k$, we introduce a family of lattices $\mathcal{C}_{k}^{(m)}$ associated to the Cambrian lattice $\mathcal{C}_{k}$ of the dihedral group $I_{2}(k)$. We show that $\mathcal{C}_{k}^{(m)}$ satisfies some basic…
Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite…
Collective versions of order convergences and corresponding types of collectively qualified sets of operators in vector lattices are investigated. It is proved that collectively order to norm bounded sets are bounded in the operator norm…
We define algebras of quasi-quaternion type, which are symmetric algebras of tame representation type whose stable module category has certain structure similar to that of the algebras of quaternion type introduced by Erdmann. We observe…
In the present paper we introduce and study a canonical ${\cal E}$-lattice structure on the set of element orders of some finite groups. We show that a finite abelian group is uniquely determined by this canonical ${\cal E}$-lattice.
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
Each quiver corresponds to a path semigroup, and such a path semigroup also corresponds to an associative K-algebra over an algebraically closed field K. Let Q be a quiver and S_Q, KQ be its path semigroup, path algebra, respectively. In…
We give a necessary and sufficient condition for a locally compact group to be isomorphic to a closed cocompact subgroup in the isometry group of a Diestel-Leader graph. As a consequence of this condition, we see that every cocompact…