相关论文: The $m$-colored composition poset
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…
We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…
In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…
In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…
A celebrated but non-effective theorem of Tibor Gallai states that for any finite set $A$ of $\Z^n$ and for any finite number of colors $c$ there is a minimal $m$ such that no coloring of the finite $m^n$-grid can avoid that a homothetic…
We prove a homological stability theorem for certain complements of symmetric spaces. This is a variant of a conjecture by Vakil and Matchett Wood for subspaces of $\mathrm{Sym}^n(X)$ where $X$ is an open manifold admitting a boundary. To…
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
This paper analyzes the representation theoretic stability, in the sense of Thomas Church and Benson Farb, of the rank-selected homology of the Boolean lattice and the partition lattice, proving sharp uniform representation stability bounds…
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…
We prove that partially ordered set has finite number of finite-dimensional indecomposable nonequivalent Hilbert representations with orthoscalarity condition if and anly if it has finite number of indecomposable linear representations. We…
This paper deals with the so-called Stanley conjecture, which asks whether they are non-isomorphic trees with the same symmetric function generalization of the chromatic polynomial. By establishing a correspondence between caterpillars…
The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters $m, k \in \mathbb{Z}_{>0}$, which has simultaneously and independently generated interest from other researchers as…
We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…
Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…