Related papers: Generalizing the Multiple Exchange Property for Ma…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
In this note, we provide two characterizations of the set of integer points in an integral bisubmodular polyhedron. Our characterizations do not require the assumption that a given set satisfies the hole-freeness, i.e., the set of integer…
A Galois unitary is a generalization of the notion of anti-unitary operators. They act only on those vectors in Hilbert space whose entries belong to some chosen number field. For Mutually Unbiased Bases the relevant number field is a…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
The distance reducing property for Markov bases is an important property that provides a bound on the mixing time of the associated Markov chain. The goal of this project is to understand properties of distance-reducing Markov bases. We…
We study the connection between multimatroids and moduli spaces of rational curves with cyclic action. Multimatroids are generalizations of matroids and delta-matroids introduced by Bouchet, which naturally arise in topological graph…
In Bayesian multilevel models, the data are structured in interconnected groups, and their posteriors borrow information from one another due to prior dependence between latent parameters. However, little is known about the behaviour of the…
For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…
It was proved by Maksimova in 1977 that exactly eight varieties of Heyting algebras have the amalgamation property, and hence exactly eight axiomatic extensions of intuitionistic propositional logic have the deductive interpolation…
We present a model for exact recursive Bayesian filtering based on lifted multiset states. Combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to…
We study the matroid secretary problems with submodular valuation functions. In these problems, the elements arrive in random order. When one element arrives, we have to make an immediate and irrevocable decision on whether to accept it or…
We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident edges. There are…
Let $R$ be a commutative ring with identity. For an $R$-module $M$, the notion of strongly prime submodule of $M$ is defined. It is shown that this notion of prime submodule inherits most of the essential properties of the usual notion of…
The main result is Theorem MAT 11 which states that every finite closure operator is the ground set of a matroid. Its base sets consist of nonredundant covers of of the closure. These are minimal subsets that determine the closure operator…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
Let b(M) denote the maximal number of disjoint bases in a matroid M. It is shown that if M is a matroid of rank d+1, then for any continuous map f from the matroidal complex M into the d-dimensional Euclidean space there exist t \geq…
Let $M$ be a matroid on a finite ground set $E$, and suppose that the automorphism group of $M$ acts transitively on $E$. We show the following: if $X_1,\ldots,X_K$ are sampled independently from a distribution $p$ on $E$, then the…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…