Related papers: Combinatorial Excess Intersection
We study monomial ideals, always locally given by a monomial, like a reasonable first step to estimate in general the number of monoidal transformations of Villamayor's algorithm of resolution of singularities. The resolution of a monomial…
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…
We utilize ideal bipyramids to obtain new upper bounds on volume for hyperbolic link complements in terms of the combinatorics of their projections.
We provide a novel proof of the homological excess intersection formula for local complete intersections. The novelty is that the proof makes use of global morphisms comparing the intersections to a self intersection.
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
We introduce the concept of monodromy coordinates for representing solutions to large polynomial systems. Representing solutions this way provides a time-memory trade-off in a monodromy solving algorithm. We describe an algorithm, which…
We present a class of homogeneous ideals which are generated by monomials and binomials of degree two and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the…
We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most…
Let $I_n$ be the ideal of all algebraic relations on the slopes of the $\binom{n}{2}$ lines formed by placing $n$ points in a plane and connecting each pair of points with a line. Under each of two natural term orders, the initial ideal of…
A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…
We compute the reverse lexicographic generic initial ideals of the powers of a 2-complete intersection ideal I. In particular, we give six algorithms to compute these generic initial ideals, the choice of which depends on the power and on…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…
The reduction number of monomial ideals in the polynomial $K[x,y]$ is studied. We focus on ideals $I$ for which $J=(x^a,y^b)$ is a reduction ideal. The computation of the reduction number amounts to solve linear inequalities. In some…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…