Related papers: Gr\"obner bases and cocyclic Hadamard matrices
In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a…
Based on the recent progress in the irregular Riemann-Hilbert correspondence for holonomic D-modules, we show that the characteristic cycles of some standard irregular holonomic D-modules can be expressed as in the classical theorem of…
For $n$ a power of two, we give a complete description of the cohomology algebra $H^*(\widetilde G_{n,3};\mathbb Z_2)$ of the Grassmann manifold $\widetilde G_{n,3}$ of oriented $3$-planes in $\mathbb R^n$. We do this by finding a reduced…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
We study the partial Hadamard matrices $H\in M_{M\times N}(\mathbb C)$ which are regular, in the sense that the scalar products between pairs of distinct rows decompose as sums of cycles (rotated sums of roots of unity). The simplest…
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…
This paper investigates a class of non-autonomous highly oscillatory ordinary differential equations characterized by a linear component inversely proportional to a small parameter $\varepsilon$, with purely imaginary eigenvalues, and an…
What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on…
The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…
Hadamard matrices in $\{0,1\}$ presentation are square $m\times m$ matrices whose entries are zeros and ones and whose rows considered as vectors in $\Bbb R^m$ produce the Gram matrix of a special form with respect to the standard scalar…
Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
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…
In this paper we provide an analytical procedure which leads to a system of $(n-2)^2$ polynomial equations whose solutions give the parameterisation of the complex $n\times n$ Hadamard matrices. It is shown that in general the Hadamard…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…