相关论文: A note on Rees algebras and the MFMC property

Let $A$ be a commutative noetherian ring and $I$ an ideal in $A$. We characterize algebraically when all the minimal primes of the associated graded ring $G_I A$ contract to minimal primes of $A/I$. This, applied to intersection theory,…

The Max-Flow Min-Cut theorem is the classical duality result for the Max-Flow problem, which considers flow of a single commodity. We study a multiple commodity generalization of Max-Flow in which flows are composed of real-valued k-vectors…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets (containing both numerical and categorical attributes), with or without missing values. The proposal is an…

We introduce an FFT-based solver for the combinatorial continuous maximum flow discretization applied to computing the minimum cut through heterogeneous microstructures. Recently, computational methods were introduced for computing the…

We consider the following conjecture proposed by Cornu\'ejols, Guenin and Margot: every ideal minimally non-packing clutter has a transversal of size 2. For a clutter C, the tilde clutter is the set of hyperedges of C which intersect any…

We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one…

We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth-$r$ graph, there exists a (fractional) multicommodity flow of value $f$, and a multicut of…

We define a Riesz type interpolation property for the Cuntz semigroup of a $C^*$-algebra and prove it is satisfied by the Cuntz semigroup of every $C^*$-algebra with the ideal property. Related to this, we obtain two characterizations of…

The continuous min flow-max cut principle is used to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the…

We are given a graph $G$, an independant set $\mathcal{S} \subset V(G)$ of \emph{terminals}, and a function $w:V(G) \to \mathbb{N}$. We want to know if the maximum $w$-packing of vertex-disjoint paths with extremities in $\mathcal{S}$ is…

Consider routing traffic on the N x N torus, simultaneously between all source-destination pairs, to minimize the cost $\sum_ec(e)f^2(e)$, where f(e) is the volume of flow across edge e and the c(e) form an i.i.d. random environment. We…

The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system:…

A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…

A strongly polynomial algorithm is developed for finding an integer-valued feasible $st$-flow of given flow-amount which is decreasingly minimal on a specified subset $F$ of edges in the sense that the largest flow-value on $F$ is as small…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

Let $J\subset I$ be ideals in a formally equidimensional local ring with $\lambda(I/J)<\infty.$ Rees proved that for all $n\gg0$, $\lambda(I^n/J^n)$ is a polynomial $P(I/J)(X)$ in $n$ of degree at most dim $R$ and $J$ is a reduction of $I$…

This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times for this problem by reducing it to a…

We introduce the concept of edgewise domination in clutters, and use it to provide an upper bound for the projective dimension of any squarefree monomial ideal. We then use a simple recursion to recover a formula for the projective…

A tame ideal is an ideal $I$ such that the blowup of the affine space $\mathbb{A}_k^n$ along $I$ is regular. In this paper, we give a combinatorial characterization of tame squarefree monomial ideals. More precisely, we show that a square…