Related papers: Amalgamating poset extensions and generating free …
The Kahn--Saks inequality is a classical result on the number of linear extensions of finite posets. We give a new proof of this inequality for posets of width two using explicit injections of lattice paths. As a consequence we obtain a…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
We investigate the poset structure on the alternating group that arises when the latter is generated by 3-cycles. We study intervals in this poset and give several enumerative results, as well as a complete description of the orbits of the…
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and tests makes its proof-theory rather difficult. We develop a…
We develop a simple method of constructing topological spaces from countable posets with finite levels, one which applies to all second countable T_1 compacta. This results in a duality amenable to building such spaces from finite building…
We construct free monoids in a monoidal category with finite limits and countable colimits, in which tensoring on either side preserves reflexive coequalizers and colimits of countable chains.
A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
We study the classes of free and plus-one generated hyperplane arrangements. Specifically, we describe how to compute the associated prime ideals of the Jacobian ideal of such an arrangement from its lattice of intersection. Moreover, we…
We study a specific class of CFTs that involve coupled free fermions, arising from parafermion CFTs and lattice constructions. We analyse their representation spaces and the underlying exclusion statistics of coupled free fermions using…
We develop the idea that a natural link between Boltzmann schemes and finite volumes exists naturally: the conserved mass and momentum during the collision phase of the Boltzmann scheme induces general expressions for mass and momentum…
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…
We discuss fermions in a spontaneously generated holographic lattice background. The lattice structure at the boundary is generated by introducing a higher-derivative interaction term between a U(1) gauge field and a scalar field. We solve…
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
In this paper we investigate the properties of quasipotency and $g$-potency for free products with amalgamation.
We provide a simple proof of the Lieb-Robinson bound and use it to prove the existence of the dynamics for interactions with polynomial decay. We then use our results to demonstrate that there is an upper bound on the rate at which…
A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…