Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1312.2520

The $m$-Cover Posets and Their Applications

Myrto Kallipoliti·Henri Mühle
View original source ↗Read source document ↗Export metadata ↓

Abstract

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}$ that contain at most three different elements, one of which has to be the least element of $\mathcal{P}$, and the other two elements have to form a cover relation in $\mathcal{P}$. We study the $m$-cover poset from a structural and topological point of view. In particular, we characterize the posets whose $m$-cover poset is a lattice for all $m>0$, and we characterize the special cases, where these lattices are EL-shellable, left-modular, or trim. Subsequently, we investigate the $m$-cover poset of the Tamari lattice $\mathcal{T}_{n}$, and we show that the smallest lattice that contains the $m$-cover poset of $\mathcal{T}_{n}$ is isomorphic to the $m$-Tamari lattice $\mathcal{T}_{n}^{(m)}$ introduced by Bergeron and Préville-Ratelle. We conclude this article with a conjectural desription of an explicit realization of $\mathcal{T}_{n}^{(m)}$ in terms of $m$-tuples of Dyck paths.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Myrto Kallipoliti, Henri Mühle. 2015-06-11. The $m$-Cover Posets and Their Applications. https://doi.org/10.1016/j.aam.2015.06.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗