Related papers: Matroids, hereditary collections and simplicial co…
Given a proper morphism X -> S, we show that a large class of objects in the derived category of X naturally form an Artin stack locally of finite presentation over S. This class includes S-flat coherent sheaves and, more generally,…
Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
In this paper we consider representations of certain combinatorial categories, including the poset $\D$ of positive integers and division, the Young lattice $\mathscr{Y}$ of partitions of finite sets, the opposite category of the orbit…
The focus of this article is on metric completions of triangulated categories arising in the representation theory of hereditary finite dimensional algebras and commutative rings. We explicitly describe all completions of bounded derived…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
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.…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…
Here we briefly discuss lattices in Euclidean spaces and spaces of lattices, which are basic objects that can be described in terms of matrices and are important settings in classical analysis.
We develop the theory of residuated lattices by introducing and studying several new types of filters and related concepts, including semi-simple filters, essential filters, the socle of a filter, and independent families of filters. Our…
Left-modularity is a concept that generalizes modularity in lattice theory. In this paper, we give a characterization of left-modular elements and derive two formulae for the characteristic polynomial of a lattice with such an element, one…
We introduce the notion of distributivity for implicative-orthomodular lattices, proving an analogue result of the Foulis-Holland theorem. Based on this result, we characterize the distributive implicative-orthomodular lattices. Moreover,…
We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of…
In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
Bayesian inference provides a rigorous framework to encapsulate our knowledge and uncertainty regarding various physical quantities in a well-defined and self-contained manner. Utilising modern tools, such Bayesian models can be constructed…