Related papers: The combinator ${\bf M}$ and the Mockingbird latti…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
We study two-component fermions in optical lattices with spatially alternating on-site interactions using dynamical mean-field theory. Calculating the quasi-particle weight, double occupancy, and order parameters for each sublattice, we…
The Lagrangian geometry of matroids was introduced in [ADH20] through the construction of the conormal fan of a matroid M. We used the conormal fan to give a Lagrangian-geometric interpretation of the h-vector of the broken circuit complex…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli…
A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for…
In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…
Johnstone demonstrated that Heyting semilattices form a semi-abelian category via a specific triple of terms. Inspired by this work, we introduce \emph{Johnstone algebras} or J-algebras. The algebraic $(*,\to,e)$-theory $J$ of arities…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
A natural first step in the classification of all `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ lies in understanding the commutant of the modular matrices $S$ and $T$. We begin this paper extending the work of…
I present a pedagogical survey of a variety of quantum phases of the Hubbard model. The honeycomb lattice model has a conformal field theory connecting the semi-metal to the insulator with Neel order. States with fractionalized excitations…
Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…
We study fermions in a lattice, with on-site and nearest neighbor attractive interactions between two spin species. We consider two geometries: both spins in a triangular lattice, and a mixed geometry with up-spins in honeycomb and…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
In this paper we investigate the general combinatorical structure of the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication, an m-implication.
This thesis proposes a framework based on a notion of combinatorial cell complex (cc) whose cells are defined simply as finite sets of vertices. The cells of a cc are subject to four axioms involving a rank function that assigns a rank (or…
We consider the following question: How much of the combinatorial structure determining properties of $\overline{\mathcal{M}_{0, n}}$ is ``intrinsic'' and how much new information do we obtain from using properties specific to this space?…
We rewrite various lattice Hamiltonian in condensed matter physics in terms of U(2/2) operators that we introduce. In this representation the symmetry structure of the models becomes clear. Especially, the Heisenberg, the supersymmetric t-J…