Related papers: Mockingbird lattices
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…
Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…
Returning to one of the original generalizations of the AKLT state, we extend prior analysis on the Bethe lattice (or Cayley tree) to a variant with a series of $n$ spin-1 decorations placed on each edge. The recurrence relations derived…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
Partial compositeness is a mechanism for the generation of fermion masses which replaces a direct Higgs coupling to the fermions by a linear mixing with heavy composite partners. We present the first calculation of the relevant matrix…
We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday's realization of the associahedron, and J.-L. Loday and M. Ronco's Hopf algebra on binary trees. We show that these constructions extend in the world of…
A central question in arrangement theory is to determine whether the characteristic polynomial $\Delta_q$ of the algebraic monodromy acting on the homology group $H_q(F(\mathcal{A}),\mathbb{C})$ of the Milnor fiber of a complex hyperplane…
We show how to perform a resummation, to all orders in perturbation theory, of a certain class of gauge invariant tadpole-like diagrams in Lattice QCD. These diagrams are often largely responsible for lattice artifacts. Our resummation…
In the present paper we introduce a lattice-ordered partial monoid structure on a suitable set of multilayer networks. We first study a kind of mappings that preserve the partial order and describe the order structure. After that we define…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
Slim semimodular lattices (for short, SPS lattices) and slim rectangular lattices (for short, SR lattices) were introduced by G. Gr\"atzer and E. Knapp in 2007 and 2009. These lattices are necessarily finite and planar, and they have been…
C. Greene introduced the shuffle lattice as an idealized model for DNA mutation and discovered remarkable combinatorial and enumerative properties of this structure. We attempt an explanation of these properties from a lattice-theoretic…
We introduce the extra slow Tamari lattices, a new family of lattices defined on faithfully balanced tableaux. These tableaux arise naturally from the representation theory of type \( A \) quivers, and our construction extends the classical…
The coordination sequence of a lattice $\L$ encodes the word-length function with respect to $M$, a set that generates $\L$ as a monoid. We investigate the coordination sequence of the cyclotomic lattice $\L = \Z[\zeta_m]$, where $\zeta_m$…
We develop a simple formalism of biased tracers that we dub $\mathit{Monkey\ bias}$. In this formalism, a biased tracer field is constructed directly in terms of the linear matter fluctuation field and the set of derivative operators acting…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. Motivated by a question of Dobrinen, we initiate…
I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…