相关论文: A Note on Boolean Lattices and Farey Sequences
We apply a categorical lens to the study of betweenness relations by capturing them within a topological category, fibred in lattices, and study several subcategories of it. In particular, we show that its full subcategory of finite objects…
We explore a three-dimensional counterpart of the Farey tessellation and its relations to Penner's lambda lengths and $SL_2$-tilings. In particular, we prove a three-dimensional version of Ptolemy relation, and generalise results of Ian…
By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…
We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with…
We define the modulo-$m$ Toeplitz fixed point generated by Toeplitz substitution and study the lattice subsequence of such fixed point. Moreover, we provide a method to check whether one modulo-$m$ Toeplitz fixed point is a lattice…
We introduce a notion of variable quasi-Bregman monotone sequence which unifies the notion of variable metric quasi-Fej\'er monotone sequences and that of Bregman monotone sequences. The results are applied to analyze the asymptotic…
We use a recently introduced combinatorial object, the interval-poset, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results. The first one is an inner…
This work studies the relationship between the chains of an algebraic lattice and the order structure of the join-semilattice of its compact elements. The results are presented into four chapters, each corresponding to a paper written in…
The sequence pairs of length $2^{m}$ projected from complementary array pairs of Type-II of size $\mathbf{2}^{(m)}$ and mixed Type-II/III and of size $\mathbf{2}^{(m-1)}\times2$ are complementary sequence pairs Type-II and Type-III…
A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…
For every integer $n$ with $n \geq 6$, we prove that the Boolean dimension of a poset consisting of all the subsets of $\{1,\dots,n\}$ equipped with the inclusion relation is strictly less than $n$.
In this article we discuss the operations of partitions (sequence of disjoint finite subsets) which are quotient, insertion, composition and Lie bracket. Moreover, we discuss applications of those operations for Feymman diagrams and…
Fermions on the lattice have bosonic excitations generated from the underlying periodic background. These, the lattice bosons, arise near the empty band or when the bands are nearly full. They do not depend on the nature of the interactions…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
In this talk I summarize the recent lattice determinations of the decay constants and of the bag parameters of the heavy-light and heavy-strange neutral mesons.
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…