Related papers: Mix $\star$-autonomous quantales and the continuou…
In this series of articles we describe a systematic approach to studying QCD vacuum structure using the methods of lattice gauge theory. Our framework incorporates four major components. (i) The recently established existence of space-time…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
In this paper we construct a subclass of the composite access structure introduced by Mart\'inez et al. based on schemes realizing the structure given by the set of codewords of minimal support of linear codes. This class enlarges the…
A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
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…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
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 article we study combinatorial non-positive curvature aspects of various simplicial complexes with natural $\widetilde A_n$ shaped simplicies, including Euclidean buildings of type $\widetilde A_n$ and Cayley graphs of Garside…
In this paper, a construction of constant weight codes based on the unique decomposition of elements in lattices is presented. The conditions for unique primary decomposition and unique irreducible decomposition in lattices are discussed…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
In this paper, we extend the lattice Constructions $D$, $D'$ and $\overline{D}$ $($this latter is also known as Forney's code formula$)$ from codes over $\mathbb{F}_p$ to linear codes over $\mathbb{Z}_q$, where $q \in \mathbb{N}$. We define…
The chemical ordering transition in a binary alloy is examined using classical density functional theory for a binary mixture. The ordered lattice is assumed to be obtained from the disordered lattice by a volume change only, as in L1_2…
We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join…
We study improper mixtures from a quantum logical and geometrical point of view. Taking into account the fact that improper mixtures do not admit an ignorance interpretation and must be considered as states in their own right, we do not…
The combinatorics of reduced words and commutation classes plays an important role in geometric representation theory. A string polytope is a lattice polytope associated to each reduced word of the longest element $w_0$ in the symmetric…
A mixed lattice vector space is a partially ordered vector space with two partial orderings and certain lattice-type properties. In this paper we first give some fundamental results in mixed lattice groups, and then we investigate the…
Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions…