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

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

In his seminal work \cite{Ri96}, Rivin characterized finite ideal polyhedra in three-dimensional hyperbolic space. However, the characterization of infinite ideal polyhedra, as proposed by Rivin, has remained a long-standing open problem.…

In this paper, we provide a combinatorial characterization of those collections of cells whose inner $2$-minor ideals are complete intersections. More precisely, given a collection of cells $\mathcal C$ and its associated inner $2$-minor…

In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…

This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\it minimum normalized cuts}/{\it isoperimteric…

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

In this exposition-type note we present detailed proofs of certain assertions concerning several algebraic properties of the cone and cylinder algebras. These include a determination of the maximal ideals, the solution of the B\'ezout…

The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of…

In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…

We develop mean dimension theory for $\mathbb{R}$-flows. We obtain fundamental properties and examples and prove an embedding theorem: Any real flow $(X,\mathbb{R})$ of mean dimension strictly less than $r$ admits an extension…

We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Z^d lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a…

Many large-scale optimization problems decompose into a master problem and scenario subproblems, a structure that can be exploited by Benders decomposition. In Benders decomposition, each iteration may generate many cuts from scenario…

A novel method to identify salient computational paths within randomly wired neural networks before training is proposed. The computational graph is pruned based on a node mass probability function defined by local graph measures and…

The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…

Consider the subring $\mathcal{R}_cL$ of continuous real-valued functions defined on a frame $L$, comprising functions with a countable pointfree image. We present some useful properties of $\mathcal{R}_cL$. We establish that both…

Energy minimization has been an intensely studied core problem in computer vision. With growing image sizes (2D and 3D), it is now highly desirable to run energy minimization algorithms in parallel. But many existing algorithms, in…

Rate-distortion theory-based outlier detection builds upon the rationale that a good data compression will encode outliers with unique symbols. Based on this rationale, we propose Cluster Purging, which is an extension of clustering-based…

Integrating renewable energy into the power grid requires intelligent risk-aware dispatch accounting for the stochastic availability of renewables. Toward achieving this goal, a robust DC optimal flow problem is developed in the present…

We give the first deterministic algorithm that makes sub-quadratic queries to find the global min-cut of a simple graph in the cut query model. Given an $n$-vertex graph $G$, our algorithm makes $\widetilde{O}(n^{5/3})$ queries to compute…

Let $(A, \frak m)$ be a noetherian local ring with maximal ideal $\frak{m}$ and infinite residue field $k = A/\frak{m}.$ Let $J$ be an $\frak m$-primary ideal, $I_1,...,I_s$ ideals of $A$, and $M$ a finitely generated $A$-module. In this…