Related papers: Computing mixed multiplicities, mixed volumes, and…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
In this paper, we describe a new hybrid algorithm for computing all singular triplets above a given threshold and provide its implementation in MATLAB/Octave and R. The high performance of our codes and ease at which they can be used,…
The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and…
We develop a class of mixed virtual volume methods for elliptic problems on polygonal/polyhedral grids. Unlike the mixed virtual element methods introduced in \cite{brezzi2014basic,da2016mixed}, our methods are reduced to symmetric,…
We associate convex regions in R^n to m-primary graded sequences of subspaces, in particular m-primary graded sequences of ideals, in a large class of local algebras (including analytically irreducible local domains). These convex regions…
We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…
We use the theory of resolutions for a given Hilbert function to investigate the multiplicity conjectures of Huneke and Srinivasan and Herzog and Srinivasan. To prove the conjectures for all modules with a particular Hilbert function, we…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
The motivation for this paper are computer calculations of complete lists of weight systems of quasihomogeneous polynomials with isolated singularity at 0 up to rather large Milnor numbers. We review combinatorial characterizations of such…
This is a review article on the combinatorial aspects of the mixed Hodge structure of a Milnor fibre of the isolated hypersurface singularity. We give a purely combinatorial method to compute spectral pairs of the singularity under the…
We review the literature on algorithms for estimating the index space in a multi-index model. The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is…
We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
The present paper is devoted to an algebraic treatment of the joint spectral theory within the framework of Noetherian modules over an algebra finite extension of an algebraically closed field. We prove the spectral mapping theorem and…
Multidimensional systems are becoming increasingly important as they provide a promising tool for estimation, simulation and control, while going beyond the traditional setting of one-dimensional systems. The analysis of multidimensional…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
We introduce and study higher order Jacobian ideals, higher order and mixed Hessians, higher order polar maps, and higher order Milnor algebras associated to a reduced projective hypersurface. We relate these higher order objects to some…