Related papers: A note on Rees algebras and the MFMC property

The leitmotiv of this paper is linking algebraic properties of an evolution algebra with combinatorial properties of the (possibly several) graphs that one can associate to the algebra. We link nondegeneracy, zero annihilator, absorption…

This note provides another proof for the {\em convexity} ({\em strict convexity}) of $\log \det ( I + KX^{-1} )$ over the positive definite cone for any given positive semidefinite matrix $K \succeq 0$ (positive definite matrix $K \succ 0$)…

We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…

We study the ridge method for min-max problems, and investigate its convergence without any convexity, differentiability or qualification assumption. The central issue is to determine whether the ''parametric optimality formula'' provides a…

For any smooth Riemannian metric on an $(n+1)$-dimensional compact manifold with boundary $(M,\partial M)$ where $3\leq (n+1)\leq 7$, we establish general upper bounds for the Morse index of free boundary minimal hypersurfaces produced by…

Toward a partial classification of monomial ideals with $d$-linear resolution, in this paper, some classes of $d$-uniform clutters which do not have linear resolution, but every proper subclutter of them has a $d$-linear resolution, are…

Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…

Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…

We study streaming algorithms for proportionally fair clustering, a notion originally suggested by Chierichetti et. al. (2017), in the sliding window model. We show that although there exist efficient streaming algorithms in the…

In this paper we study the local regularity of closed surfaces immersed in a Riemannian 3-manifold flowing by Willmore flow. We establish a pair of concentration-compactness alternatives for the flow, giving a lower bound on the maximal…

We study the combinatorial, algebraic and geometric properties of the free product operation on matroids. After giving cryptomorphic definitions of free product in terms of independent sets, bases, circuits, closure, flats and rank…

In this paper, we study a number of well-known combinatorial optimization problems that fit in the following paradigm: the input is a collection of (potentially inconsistent) local relationships between the elements of a ground set (e.g.,…

Selecting an optimal subset of features or instances under an information theoretic criterion has become an effective preprocessing strategy for reducing data complexity while preserving essential information. This study investigates two…

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

In this paper, we prove a combinatorial property of flows on a cycle. $C(V,E)$ is an undirected cycle with two commodities: $\{s_{1},t_{1}\}, \{s_{2},t_{2}\}$;$r_1>0,r_2>0, \mathbf r=(r_i)_{i=1,2}$ and $f,f'$ are both feasible flows for…

We consider the nonparametric estimation of an S-shaped regression function. The least squares estimator provides a very natural, tuning-free approach, but results in a non-convex optimisation problem, since the inflection point is unknown.…

We give a characterization of geometric property (T) for a coarse disjoint union of finite graphs with bounded degree using the idea of noncommutative real algebraic geometry. In the proof, we define a $*$-subalgebra $I_u[X]$ of real…

We consider a dissipative flow network that obeys the standard linear nodal flow conservation, and where flows on edges are driven by potential difference between adjacent nodes. We show that in the case when the flow is a monotonically…

Conservation laws are usually studied in the context of sufficient regularity conditions imposed on the flux function, usually $C^{2}$ and uniform convexity. Some results are proven with the aid of variational methods and a unique minimizer…

Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…