Related papers: Relationship between the second type of covering-b…
Approximate simulation, an extension of simulation relations from formal methods to continuous systems, is a powerful tool for hierarchical control of complex systems. Finding an approximate simulation relation between the full "concrete"…
In a previous work, we gave a construction of (not necessarily realizable) oriented matroids from a triangulation of a product of two simplices. In this follow-up paper, we use a variant of Viro's patchworking to derive a topological…
In this paper, we consider dynamic matroids, where elements can be inserted to or deleted from the ground set over time. The independent sets change to reflect the current ground set. As matroids are central to the study of many…
For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…
For a positive trace-class operator $C$ and a bounded operator $A$, we provide an explicit description of the closure of the orbit-closed $C$-numerical range of $A$ in terms of those operators submajorized by $C$ and the essential numerical…
We establish the existence and uniqueness of finite free resolutions - and their attendant Betti numbers - for graded commuting d-tuples of Hilbert space operators. Our approach is based on the notion of free cover of a (perhaps…
This paper presents a fast and simple new 2-approximation algorithm for minimum weighted vertex cover. The unweighted version of this algorithm is equivalent to a well-known greedy maximal independent set algorithm. We prove that this…
To a generalized tight continuous frame in a Hilbert space $\H$ indexed by a locally compact space $\Si$ endowed with a Radon measure, one associates a coorbit theory converting spaces of functions on $\Si$ in spaces of vectors comparable…
Using the framework of operator or Calder\'on preconditioning, uniform preconditioners are constructed for elliptic operators discretized with continuous finite (or boundary) elements. The preconditioners are constructed as the composition…
We define and study the notions of closure $\text{\rsfs{C}}$ operators and interior $\mathbf{I}$ operators of the category $\mathbf{CCov}$ of convergent covers which appears in positive topologies. The main motivation of this paper is to…
The concepts of paracontracting, pseudocontracting and nonexpanding operators have been shown to be useful in proving convergence of asynchronous or parallel iteration algorithms. The purpose of this paper is to give characterizations of…
We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the…
We study a submodular maximization problem motivated by applications in online retail. A platform displays a list of products to a user in response to a search query. The user inspects the first $k$ items in the list for a $k$ chosen at…
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…
We study the realization spaces of matroids and hyperplane arrangements. First, we define the notion of naive dimension for the realization space of matroids and compare it with the expected dimension and the algebraic dimension, exploring…
Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixed packing and covering constraints. We present a tight…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…
The closure $\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this…