Related papers: Matroids, hereditary collections and simplicial co…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
In this paper, we introduce the notion of a pseudo-irreducible filter in a residuated lattice and compare this concept with related notions such as prime and maximal filters. Then, we recall the Boolean lifting property for filters and…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.
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…
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…
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…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
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…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
In order to better understand and to compare interleavings between persistence modules, we elaborate on the algebraic structure of interleavings in general settings. In particular, we provide a representation-theoretic framework for…
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
Differential-difference integrable exponential type systems are studied corresponding to the Cartan matrices of semi-simple or affine Lie algebras. For the systems corresponding to the algebras $A_2$, $B_2$, $C_2$, $G_2$ the complete sets…
Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
Holonomy R-matrices parametrized by finite-dimensional representations are constructed for quantized universal enveloping algebras of simple Lie algebras at roots of 1.
The Tate conjecture has two parts: i) Tate classes are linear combination of algebraic classes, ii) semisimplicity of Galois representations (for smooth projective varieties). B. Moonen proved that i) implies ii) in characteristic 0, using…