相关论文: A Note on Robust Subsets of Transversal Matroids
We give a criterion for modular extension of rank-4 hypermodular matroids, and prove a weakening of Kantor's conjecture for rank-4 realizable matroids. This proves the sticky matroid conjecture and Kantor's conjecture for realizable…
We establish new upper bounds for the numerical radius of bounded linear operators on a complex Hilbert space by introducing weighted geometric means of the modulus of an operator and its adjoint. This approach yields a family of…
Almost four decades ago, Bergman and Milton independently showed that the isotropic effective electric permittivity of a two-phase composite material with a given volume fraction is constrained to lie within lens-shaped regions in the…
We present an effective framework for improving the breakdown point of robust regression algorithms. Robust regression has attracted widespread attention due to the ubiquity of outliers, which significantly affect the estimation results.…
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of $2$ for the \emph{unweighted} matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted…
We show that all hyperbolic surfaces admit an ideal triangulation with bounded shear parameters. This upper bound depends logarithmically on the topology of the surface.
We derive new bounds for the condition number of kernel matrices, which we then use to enhance existing non-asymptotic test error bounds for kernel ridgeless regression (KRR) in the over-parameterized regime for a fixed input dimension. For…
The best subset selection (or "best subsets") estimator is a classic tool for sparse regression, and developments in mathematical optimization over the past decade have made it more computationally tractable than ever. Notwithstanding its…
Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s. A central technique in this field is to approximately optimize the…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
Let $X$ be an irreducible smooth projective algebraic curve of genus $g \geq 2$ over the ground field $\bc$ and let $G$ be a semisimple simply connected algebraic group. The aim of this paper is to introduce the notion of semistable and…
The problem of matroid-reachability-based packing of arborescences was solved by Kir\'aly. Here we solve the corresponding decomposition problem that turns out to be more complicated. The result is obtained from the solution of the more…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…
Robust optimization is becoming increasingly important in machine learning applications. In this paper, we study a unified framework of robust submodular optimization. We study this problem both from a minimization and maximization…
Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
We study the problem of estimating the mean of a distribution in high dimensions when either the samples are adversarially corrupted or the distribution is heavy-tailed. Recent developments in robust statistics have established efficient…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
In this paper, we prove a transversality theorem for the moduli space of perturbed special Lagrangian submanifolds in a 6-dimensional manifold equipped with a generalization of a Calabi-Yau structure. These perturbed special Lagrangian…