Related papers: Complexity of Villamayor's algorithm in the non ex…
We call a real algebraic hypersurface in $(\mathbb{C}^*)^n$ simplicial if it is given by a real Laurent polynomial in $n$-variables that has exactly $n+1$ monomials with non-zero coefficients and such that the convex hull in $\mathbb{R}^n$…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…
For a polynomial ring S in n variables, we consider the natural action of the symmetric group S_n on S by permuting the variables. For an S_n-invariant monomial ideal I in S and j >= 0, we give an explicit recipe for computing the modules…
There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…
The number of equations needed to cut out a variety given by an ideal is called the arithmetic rank (of the ideal). It was shown in [8] that the notion of arithmetic rank is strongly related to the concept of regular sequences on the Matlis…
$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…
Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\ldots,v_m \in \mathbb{R}^d$ and a constraint family ${\cal B}\subseteq 2^{[m]}$, find a set $S \in \cal{B}$ that…
In this work, we consider the singular set in the thin obstacle problem with weight $|x_{n+1}|^a$ for $a\in (-1, 1)$, which arises as the local extension of the obstacle problem for the fractional Laplacian (a non-local problem). We develop…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
Let $\mathfrak{S}_n$ be the set of all permutations of $[n]=\{1,\ldots,n\}$ and let $W$ be the subset consisting of permutations $\sigma \in \mathfrak{S}_n$ avoiding 132 and 312-patterns. The monomial ideal $I_W = \left\langle…
Let $(A, \mathfrak m)$ be a normal two-dimensional local ring and $I$ an $\mathfrak m$-primary integrally closed ideal with a minimal reduction $Q$. Then we calculate the numbers: $\mathrm{nr}(I) = \min\{n \;|\; \overline{I^{n+1}} =…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erd\H{o}s-R\'enyi-type model for random monomial ideals…
A positroid is the matroid of a matrix whose maximal minors are all nonnegative. Given a permutation $w$ in $S_n$, the matroid of a generic $n \times n$ matrix whose non-zero entries in row $i$ lie in columns $w(i)$ through $n+i$ is an…