相关论文: Fast algorithm for border bases of Artinian Gorens…

The Jordan type of an Artinian algebra is the Jordan block partition associated to multiplication by a generic element of the maximal ideal. We study the Jordan type for Artinian Gorenstein (AG) local algebras A, and the interaction of…

We describe the graded characters and Hilbert functions of certain graded artinian Gorenstein quotients of the polynomial ring which are also representations of the symmetric group. Specifically, we look at those algebras whose socles are…

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric…

We analyze and present an effective solution to the minimal Gorenstein cover problem: given a local Artin k-algebra $A = k[[x 1 ,. .. x n ]]/I$, compute an Artin Gorenstein $k$-algebra $G = k[[x 1 ,. .. x n ]]/J$ such that…

We describe the ring structure of the cohomology of the Hilbert scheme of points for a smooth surface X. When the canonical class K_X = 0, this was done by Lehn and Sorger, extending earlier work when X = C^2. Their approach does not…

Border basis schemes are open subschemes of the Hilbert scheme of $\mu$ points in an affine space $\mathbb{A}^n$. They have easily describable systems of generators of their vanishing ideals for a natural embedding into a large affine space…

The common fixed points problem requires finding a point in the intersection of fixed points sets of a finite collection of operators. Quickly solving problems of this sort is of great practical importance for engineering and scientific…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…

Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…

Algebraic multigrid (AMG) is one of the most efficient iterative methods for solving large sparse system of equations. However, how to build/check restriction and prolongation operators in practical of AMG methods for nonsymmetric {\em…

This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

We study a variety of questions centered around the computation of cohomology of line bundles on the incidence correspondence (the partial flag variety parametrizing pairs consisting of a point in projective space and a hyperplane…

Inspired by Karr's algorithm, we consider the summations involving a sequence satisfying a recurrence of order two. The structure of such summations provides an algebraic framework for solving the difference equations of form…

To every Gorenstein algebra $A$ of finite vector space dimension greater than 1 over a field $\FF$ of characteristic zero, and a linear projection $\pi$ on its maximal ideal ${\mathfrak m}$ with range equal to the annihilator…

We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Pad\'e approximation problem in [Van Barel and…

We prove upper bounds for the Hilbert-Samuel multiplicity of standard graded Gorenstein algebras. The main tool that we use is Boij-S\"oderberg theory to obtain a decomposition of the Betti table of a Gorenstein algebra as the sum of…

We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…

Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial…