Related papers: Obstructions and dualities for matroid depth param…
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the simplex method. We are interested in the diameters of…
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 considers completions of COMs (complexes oriented matroids) to ample partial cubes of the same VC-dimension. We show that these exist for OMs (oriented matroids) and CUOMs (complexes of uniform oriented matroids). This implies…
Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G…
The purpose of this paper is to make a further contribution to the Mackey bijection for a complex reductive group G, between the tempered dual of G and the unitary dual of the associated Cartan motion group. We shall construct an embedding…
We present a formula which relates the Kazhdan-Lusztig polynomial of a matroid $M$, as defined by Elias, Proudfoot and Wakefield, to the Kazhdan--Lusztig polynomials of the matroid obtained by deleting an element, and various contractions…
We enrich Baker and Bowler's theory of matroids over tracts with notions of vectors and covectors. In the case of oriented matroids, these $F$-vectors and $F$-covectors coincide with the usual signed vectors and signed covectors. In the…
A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…
We characterize the monotone bounded depth formula complexity for graph homomorphism and colored isomorphism polynomials using a graph parameter called the cost of bounded product depth baggy elimination tree. Using this characterization,…
Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…
In the matroid secretary problem we are given a stream of elements and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
We study the interplay between the lattice of F_{q^m}-subspaces and the lattice of F_{q^m}-subspaces of an F_{q^m}-vector space. Introducing notions of weight and defect relative to an F_q-subspace, we analyze the sequence of maximum…
Building on our previous work "Cartier modules: finiteness results" we start in this manuscript an in depth study of the derived category of Cartier modules and the cohomological operations which are defined on them. After localizing at the…
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…
The purpose of this paper is to prove dimension formulas for $T^1$ and $T^2$ for rational surface singularities. These modules play an important role in the deformation theory of isolated singularities in analytic and algebraic geometry.…
One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give…
Graphs are a fundamental abstraction in computer science and discrete mathematics, where information is encoded in their combinatorial structure. Graph-reduction techniques aim at simplifying graphs while preserving selected structural…