Related papers: Foulis-Holland theorem for implicative-orthomodula…
We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
An integrable model possessing inhomogeneous ground states is proposed as an effective model of non-uniform quantum condensates such as supersolids and Fulde--Ferrell--Larkin--Ovchinnikov superfluids. The model is a higher-order analog of…
In a paper published in 2012, the second author extended the well-known fact that Boolean algebras can be defined using only implication and a constant, to De Morgan algebras-this result led him to introduce, and investigate (in the same…
In this paper we define, inspired by ring theory, the class of maximal residuated lattices with lifting Boolean center and prove a structure theorem for them: any maximal residuated lattice with lifting Boolean center is isomorphic to a…
In this paper, we provide an alternative description of the duality result for distributive lattices and coherent locales using ultraposet. In particular, we show that there are fully faithful embeddings from the opposite of the category of…
This note gives a unifying characterization and exposition of strongly irreducible elements and their duals in lattices. The interest in the study of strong irreducibility stems from commutative ring theory, while the dual concept of strong…
We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…
We investigate a notion of inverse for neutrices inspired by Van den Berg and Koudjeti's decomposition of a neutrix as the product of a real number and an idempotent neutrix. We end up with an algebraic structure that can be characterized…
We develop a theory of parametrized geometric cobordism by introducing smooth Thom stacks. This requires identifying and constructing a smooth representative of the Thom functor acting on vector bundles equipped with extra geometric data,…
The notion of cosilting module was recently introduced as a generalization of the notion of cotilting module. In this paper, we give a characterization of (partial) cosilting modules in terms of two-term cosilting complexes. Moreover, we…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
We provide an explicit characterization of the covariant isotropy group of any Grothendieck topos, i.e. the group of (extended) inner automorphisms of any sheaf over a small site. As a consequence, we obtain an explicit characterization of…
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…
The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
By homotopy linear algebra we mean the study of linear functors between slices of the $\infty$-category of $\infty$-groupoids, subject to certain finiteness conditions. After some standard definitions and results, we assemble said slices…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
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…