Related papers: A Note on Robust Subsets of Transversal Matroids
We show that under a lower Ricci curvature bound and an upper diameter bound, a torus admits a finite-sheeted covering space with volume bounded from below and diameter bounded from above. This partially recovers a result of Kloeckner and…
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress…
Kernel methods give powerful, flexible, and theoretically grounded approaches to solving many problems in machine learning. The standard approach, however, requires pairwise evaluations of a kernel function, which can lead to scalability…
We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…
We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…
The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
Kir\'{a}ly in [On maximal independent arborescence packing, SIAM J. Discrete. Math. 30 (4) (2016), 2107-2114] solved the following packing problem: Given a digraph $D = (V, A)$, a matroid $M$ on a set $S = \{s_{1}, \ldots,s_{k} \}$ along…
Radiotherapy treatment planning is a challenging large-scale optimization problem plagued by uncertainty. Following the robust optimization methodology, we propose a novel, spatially based uncertainty set for robust modeling of radiotherapy…
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…
Describing the combinatorial structure of the tropical complex $C$ of a tropical matroid polytope, we obtain a formula for the coarse types of the maximal cells of $C$. Due to the connection between tropical complexes and resolutions of…
In this paper, we consider the problem of building a conformal boundary, embedding a pseudo-Riamnnian manifold as an open subset of a bigger one. We get first results about conformal maximality. We also show that in dimension $\geq 3$,…
This article provides a comprehensive exploration of submodular maximization problems, focusing on those subject to uniform and partition matroids. Crucial for a wide array of applications in fields ranging from computer science to systems…
We consider the celebrated bound introduced by Conforti and Cornu\'ejols (1984) for greedy schemes in submodular optimization. The bound assumes a submodular function defined on a collection of sets forming a matroid and is based on greedy…
We introduce a unified theory of Cartan subgroups and maximal toroids - defined as connected multiplicative type subgroups that are maximal amongst all such subgroups - which holds for all affine algebraic groups over a field, regardless of…
In this short article, we establish a rigidity theorem for pairs of hyperquadrics in a weaker sense, i.e., we impose a condition that minimal rational curves are preserved, which is stronger than inheriting a sub-VMRT structure, a notion…
Explanation methods shed light on the decision process of black-box classifiers such as deep neural networks. But their usefulness can be compromised because they are susceptible to manipulations. With this work, we aim to enhance the…
The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…