English
Related papers

Related papers: Bilinear systems with two supports: Koszul resulta…

200 papers

This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…

Let T be a torus. We show that Koszul duality can be used to compute the equivariant cohomology of topological T-spaces as well as the cohomology of pull backs of the universal T-bundle. The new features are that no further assumptions…

Algebraic Topology · Mathematics 2007-10-22 Matthias Franz

The multiresolution analysis of Alpert is considered. Explicit formulas for the entries in the matrix coefficients of the refinement equation are given in terms of hypergeometric functions. These entries are shown to solve generalized…

Classical Analysis and ODEs · Mathematics 2013-09-27 Jeffrey S. Geronimo , Francisco Marcellan

Studies on time and memory costs of products in geometric algebra have been limited to cases where multivectors with multiple grades have only non-zero elements. This allows to design efficient algorithms for a generic purpose; however, it…

Data Structures and Algorithms · Computer Science 2020-02-27 Stephane Breuils , Vincent Nozick , Akihiro Sugimoto

We make some observations on binomial edge ideals, with the characterization of their Koszulness as motivation. Inspired by results of Ene, Herzog and Hibi, we discuss building Koszul graphs from smaller pieces in a controlled manner. We…

Commutative Algebra · Mathematics 2014-12-12 Oscar Kivinen

We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…

Combinatorics · Mathematics 2020-10-20 Adam W. Marcus

We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jeffrey S. Geronimo , Hugo Woerdeman

A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…

Numerical Analysis · Mathematics 2015-09-29 Christopher A. Wong

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

Numerical Analysis · Mathematics 2023-09-18 Anita Buckley , Bor Plestenjak

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Symbolic Computation · Computer Science 2018-03-01 Jonathan D. Hauenstein , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Symbolic Computation · Computer Science 2014-09-22 Wei Zhou , George Labahn

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…

Rings and Algebras · Mathematics 2023-09-27 Emanuel Malvetti

Subresultant of two univariate polynomials is a fundamental object in computational algebra and geometry with many applications (for instance, parametric GCD and parametric multiplicity of roots). In this paper, we generalize the theory of…

Symbolic Computation · Computer Science 2023-04-28 Hoon Hong , Jing Yang

A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…

Numerical Analysis · Mathematics 2019-08-30 A. A. Alikhanov , A. M. Apekov , Z. A. Kokov , A. O. Belyaev , L. A. Khamukova

We develop a Koszul-theoretic framework for comparing classical Alexander-type invariants with infinitesimal invariants arising from finite-type commutative differential graded algebra models. The central mechanism is Koszul linearization,…

Algebraic Topology · Mathematics 2026-04-29 Alexander I. Suciu

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

Commutative Algebra · Mathematics 2014-09-16 Maral Mostafazadehfard , Aron Simis

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

Mathematical Physics · Physics 2018-08-03 Oksana Bihun

In this article we study higher preprojective algebras, showing that various known results for ordinary preprojective algebras generalize to the higher setting. We first show that the quiver of the higher preprojective algebra is obtained…

Representation Theory · Mathematics 2021-02-03 Joseph Grant , Osamu Iyama

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

Algebraic Geometry · Mathematics 2023-02-07 Alicia Dickenstein , Sandra di Rocco , Ralph Morrison