Related papers: Computing mixed multiplicities, mixed volumes, and…
In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
The purpose of this paper is to show how Rees algebras can be applied in the study of singularities embedded in smooth schemes over perfect fields. In particular, we will study situations in which the multiplicity of a hypersurface is a…
A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…
Addressing large-scale indefinite least squares (ILS) problem poses notable computational bottlenecks in the field of numerical linear algebra. State-of-the-art iterative schemes for such problems are predominantly constructed upon the…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
In this note we prove certain inequalities for mixed discriminants of positive semi-definite matrices, and mixed volumes of compact convex sets in n-dimensions. Moreover, we discuss how the latter are related to the monotonicity of an…
In this article we study Cohen-Macaulay modules over one-dimensional hypersurface singularities and the relationship with the representation theory of associative algebras using methods of cluster tilting theory. We give a criterion for…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
Let $S$ be a finitely generated standard multigraded algebra over an Artinian local ring $A$; $M$ a finitely generated multigraded $S$-module. This paper answers to the question when mixed multiplicities of $M$ are positive and…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
We review three different approaches to polynomial symmetry algebras underlying superintegrable systems in Darboux spaces. The first method consists of using deformed oscillator algebra to obtain finite-dimensional representations of…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations…