Related papers: Decomposition theorem on matchable distributive la…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
A lattice diagram is a finite set $L=\{(p_1,q_1),... ,(p_n,q_n)\}$ of lattice cells in the positive quadrant. The corresponding lattice diagram determinant is $\Delta_L(\X;\Y)=\det \| x_i^{p_j}y_i^{q_j} \|$. The space $M_L$ is the space…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…
We provide an analogue of the Dulmage-Mendelsohn decomposition for a class of grafts known as comb-bipartite grafts. The Dulmage-Mendelsohn decomposition in matching theory is a classical canonical structure theorem for bipartite graphs.…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
In this work, we exhibit several subclasses of weakly dicomplemented lattices (WDLs) based on their skeletons and dual skeletons. We investigate normal filters (resp. ideals) and show that the set of normal filters (resp. ideals) forms a…
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
In a finite distributive lattice $\L$ we define two functions $s(\alpha)=|\{\delta \in \mathcal{L} | \delta \leq \alpha \}|$ and $l(\alpha)=|\{\delta \in \mathcal{L} | \delta \geq \alpha \}|$. In this present article we prove that the sum…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…