Related papers: Gammoids, Pseudomodularity and Flatness Degree

Models which allow an explicit application to structurally modulated substances are reviewed within the frame of a symmetry-based approach starting from discrete lattice theory. Focus is set on models formulated in terms of local variables…

A class of matroids is introduced which is very large as it strictly contains all paving matroids as special cases. As their key feature these split matroids can be studied via techniques from polyhedral geometry. It turns out that the…

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most…

A magma (or groupoid) is a set with a binary operation $(A,f)$. Roughly speaking, a magma is said to be lazy if compositions such as $f(x,f(f(y,z),u))$ depend on at most two variables. Recently, Kaprinai, Machida and Waldhauser described…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…

We survey the Mumford construction of degenerating abelian varieties, with a focus on the analytic version of the construction, and its relation to toric geometry. Moreover, we study the geometry and Hodge theory of multivariable…

Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…

We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a…

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

We consider a perturbation $f$ of a hyperbolic toral automorphism $L$. We study rigidity related to exceptional properties of the strong and weak stable foliations for $f$. If the strong foliation is mapped to the linear one by the…

Suppose $\Gamma$ is a submonoid of a lattice, not containing a line. In this note, we use the natural $\Gamma$-grading on the monoid algebra $R[\Gamma]$ to prove structural results about the relative $K$-theory $K(R[\Gamma], R)$. When $R$…

In this note, we extend the theory of Chern-Cheeger-Simons to construct canonical invariants for a one-parameter family of flat connections on a smooth manifold. These invariants lie in degrees $(2p-2)$-cohomology with $\C/\Z$-cohomology,…

Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…

Submodular maximization over a matroid constraint is a fundamental problem with various applications in machine learning. Some of these applications involve decision-making over datapoints with sensitive attributes such as gender or race.…

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,…

All rings are commutative, and all modules are unital. The purpose of this paper is to investigate the characterizations of weakly pseudo primary 2-absorbing sub-module in terms of some types of modules. We provide characterizations for the…