Related papers: A note on Rees algebras and the MFMC property
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
Given a finite-dimensional real inner product space V and a finite subgroup G of linear isometries, max filtering affords a bilipschitz Euclidean embedding of the orbit space V/G. We identify the max filtering maps of minimum distortion in…
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…
Let $\mathcal{C}$ be a clutter with a perfect matching $e_1,...,e_g$ of K\"onig type and let $\Delta_\mathcal{C}$ be the Stanley-Reisner complex of the edge ideal of $\mathcal{C}$. If all c-minors of $\mathcal{C}$ have a free vertex and…
The convex hull property is the natural generalization of maximum principles from scalar to vector valued functions. Maximum principles for finite element approximations are often crucial for the preservation of qualitative properties of…
We introduce and investigate reroutable flows, a robust version of network flows in which link failures can be mitigated by rerouting the affected flow. Given a capacitated network, a path flow is reroutable if after failure of an arbitrary…
We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
We describe a minimal set of generators of the defining ideal of the Rees Algebra associated to a proper parametrization of any monoid hypersurface. In the case of plane curves, we recover a known description for rational parametrizations…
Let R=K[M] be a normal affine monoid algbera over a field K.Up to isomorphism the conic ideals are exactly the direct summands ofthe extension R^{1/n} of R. We show that the classes of the conic divisorial ideals can be identified with the…
Let $\cF$ be a set of $M$ classification procedures with values in $[-1,1]$. Given a loss function, we want to construct a procedure which mimics at the best possible rate the best procedure in $\cF$. This fastest rate is called optimal…
The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently…
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…
The robust minimum cost flow problem under consistent flow constraints (RobMCF$\equiv$) is a new extension of the minimum cost flow (MCF) problem. In the RobMCF$\equiv$ problem, we consider demand and supply that are subject to uncertainty.…
In this paper we explore certain properties of the Rees algebra of $I_t(C_n)$, the $t$-path ideal of an $n$-cycle. Our main focus is on the cases when such ideals are of fiber type.
Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their…
We give a deterministic algorithm for finding the minimum (weight) cut of an undirected graph on $n$ vertices and $m$ edges using $\text{polylog}(n)$ calls to any maximum flow subroutine. Using the current best deterministic maximum flow…
Combinatorial Ricci flow on a cusped $3$-manifold is an analogue of Chow-Luo's combinatorial Ricci flow on surfaces and Luo's combinatorial Ricci flow on compact $3$-manifolds with boundary for finding complete hyperbolic metrics on cusped…
We study C*-irreducibility of inclusions of reduced twisted group C*-algebras and of reduced group C*-algebras. We characterize C*-irreducibility in the case of an inclusion arising from a normal subgroup, and exhibit many new examples of…