Related papers: Polymatroids, closure operators and lattices
We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…
We define and study semilattices and lattices for $E$-closed families of theories. Properties of these semilattices and lattices are investigated. It is shown that lattices for families of theories with least generating sets are…
A laminar family is a collection $\mathscr{A}$ of subsets of a set $E$ such that, for any two intersecting sets, one is contained in the other. For a capacity function $c$ on $\mathscr{A}$, let $\mathscr{I}$ be $\{I:|I\cap A| \leq…
As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We explore the relationship between lattice field theory and graph theory, placing special emphasis on the interplay between Dirac and scalar lattice operators and matrices within the realm of spectral graph theory. Beyond delving into…
Given a poset $P$ and a standard closure operator $\Gamma:\wp(P)\to\wp(P)$ we give a necessary and sufficient condition for the lattice of $\Gamma$-closed sets of $\wp(P)$ to be a frame in terms of the recursive construction of the…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
Dirac operators in non-trivial topology backgrounds in a finite box are reviewed. We analyze how the formalism translates to the lattice, with special emphasis on uniform field backgrounds.
In this paper, we study the properties of closure operators obtained as initial lifts along a reflector, and compactness with respect to them in particular. Applications in the areas of topology, topological groups and topological…
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…
If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…
In the present paper, we introduce and investigate the multiplicative order compact operators from vector lattices to $l$-algebras. A linear operator $T$ from a vector lattice $X$ to an $l$-algebra $E$ is said to be $\mathbb{omo}$-compact…
The classes of bicircular matroids and lattice path matroids are closed under minors. The complete list of excluded minors for the class of lattice path matroids is known, and it has been recently shown that the analogous list for the class…