Related papers: Fair Integral Submodular Flows
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…
We introduce a flow of maps from a compact surface of arbitrary genus to an arbitrary Riemannian manifold which has elements in common with both the harmonic map flow and the mean curvature flow, but is more effective at finding minimal…
The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
The notion of $p$-modulus of a family of objects on a graph is a measure of the richness of such families. We develop the notion of minimal subfamilies using the method of Lagrangian duality for $p$-modulus. We show that minimal subfamilies…
Given a natural number $k\ge 2$, we consider the $k$-submodular cover problem ($k$-SC). The objective is to find a minimum cost subset of a ground set $\mathcal{X}$ subject to the value of a $k$-submodular utility function being at least a…
We consider the Hamiltonian flow on complex complete intersection surfaces with isolated singularities, equipped with the Jacobian Poisson structure. More generally we consider complete intersections of arbitrary dimension equipped with…
In this paper we study the problem of minimizing a submodular function $f : 2^V \rightarrow \mathbb{R}$ that is guaranteed to have a $k$-sparse minimizer. We give a deterministic algorithm that computes an additive $\epsilon$-approximate…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
Let $I=(\mathbb{Z}^3,26,6,B)$ be a 3D digital image, let $Q(I)$ be the associated cubical complex and let $\partial Q(I)$ be the subcomplex of $Q(I)$ whose maximal cells are the quadrangles of $Q(I)$ shared by a voxel of $B$ in the…
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…
A proof of convergence is given for semi- and full discretizations of mean curvature flow of closed two-dimensional surfaces. The numerical method proposed and studied here combines evolving finite elements, whose nodes determine the…
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted $s$-$t$ paths in an $s$-$t$ DAG $G$ whose weighted sum is equal to a given flow $f$ on $G$. Despite its many practical…
Given any pair of countable groups $G$ and $H$ with $G$ infinite, we construct a minimal, free, Cantor $G$-flow $X$ so that $H$ embeds into the group of automorphisms of $X$.
Center-based clustering techniques are fundamental in some areas of machine learning such as data summarization. Generic $k$-center algorithms can produce biased cluster representatives so there has been a recent interest in fair $k$-center…
We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
The solutions to many problems in the mathematical, computational, and physical sciences often involve multidimensional integrals. A direct numerical evaluation of the integral incurs a computational cost that is exponential in the number…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in…