Related papers: Pruned cellular free resolutions of monomial ideal…
We present an algorithm to compute all $n$ nondominated points of a multicriteria discrete optimization problem with $d$ objectives using at most $\mathcal{O}(n^{\lfloor d/2 \rfloor})$ scalarizations. The method is similar to algorithms by…
Large Language Models (LLMs) have demonstrated exceptional performance across a wide range of tasks, yet their significant computational and memory requirements present major challenges for deployment. A common approach uses Taylor…
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in \cite{vu} for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators…
Let $S = k[x_{11}, \cdots, x_{1b_1}, \cdots, x_{n1}, \cdots, x_{nb_n}]$ be a polynomial ring in $m = b_1 + \cdots + b_n$ variables over a field $k$. For all $j$, $1\le j \le n$, let $P_j$ be the prime ideal generated by variables $\{x_{j1},…
We consider resolvent splitting algorithms for finding a zero of the sum of finitely many maximally monotone operators. The standard approach to solving this type of problem involves reformulating as a two-operator problem in the…
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…
Using the Newton polytope and polyhedron, we study analytic spread and ideal reductions of monomial ideals. We determine a bound for analytic spread based on halfspaces and hyperplanes of the Newton polytope, and we classify basic monomial…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
We present a filter pruning approach for deep model compression, using a multitask network. Our approach is based on learning a a pruner network to prune a pre-trained target network. The pruner is essentially a multitask deep neural…
We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal…
We introduce the notion of a \emph{resolution supported on a poset}. When the poset is a CW-poset, i.e. the face poset of a regular CW-complex, we recover the notion of cellular resolution as introduced by Bayer and Sturmfels. Work of…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…
We exploit the intrinsic difference between disordered and crystalline solids to create systems with unusual and exquisitely tuned mechanical properties. To demonstrate the power of this approach, we design materials that are either…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
Reducing the size of a neural network (pruning) by removing weights without impacting its performance is an important problem for resource-constrained devices. In the past, pruning was typically accomplished by ranking or penalizing weights…
$k$-core decomposition is widely used to identify the center of a large network, it is a pruning process in which the nodes with degrees less than $k$ are recursively removed. Although the simplicity and effectiveness of this method…
Correspondence selection aims to correctly select the consistent matches (inliers) from an initial set of putative correspondences. The selection is challenging since putative matches are typically extremely unbalanced, largely dominated by…
Proofs of two results about a monomial ideal -- describing membership in auxiliary ideals associated to the monomial ideal -- are given which do not invoke resolution of singularities. The AM--GM inequality is used as a substitute for…
We explore connections between the approach of solving the rational interpolation problem via resolutions of ideals and syzygies with the standard method provided by the Extended Euclidean Algorithm. As a consequence, we obtain explicit…