English
Related papers

Related papers: Gr\"obner bases and cocyclic Hadamard matrices

200 papers

A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…

Commutative Algebra · Mathematics 2024-04-23 Anna Maria Bigatti , Elisa Palezzato , Michele Torielli

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

Commutative Algebra · Mathematics 2007-05-23 Vladimir P. Gerdt

The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for…

Quantum Physics · Physics 2021-04-28 Bujiao Wu , Maharshi Ray , Liming Zhao , Xiaoming Sun , Patrick Rebentrost

We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…

Commutative Algebra · Mathematics 2014-04-11 Jürgen Herzog , Ayesha Asloob Qureshi , Akihiro Shikama

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

Combinatorics · Mathematics 2021-05-05 Ruslan Sharipov

Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…

Commutative Algebra · Mathematics 2026-02-18 Zvi Rosen , Jessica Sidman , Louis Theran

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

Symbolic Computation · Computer Science 2008-12-02 Bernard Mourrain , Philippe Trébuchet

Let $\mathbb{K}$ be a field, $\mathcal{X}$ be an infinite set (of indeterminates), and $\mathcal{G}$ be a group acting on $\mathcal{X}$. An ideal in the polynomial ring $\mathbb{K}[\mathcal{X}]$ is called equivariant if it is invariant…

Logic in Computer Science · Computer Science 2025-07-15 Arka Ghosh , Aliaume Lopez

Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…

Symbolic Computation · Computer Science 2015-09-28 Tristan Vaccon

Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…

Mathematical Physics · Physics 2013-06-12 Bengt R. Karlsson

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

Symbolic Computation · Computer Science 2016-07-22 Rui-Juan Jing , Chun-Ming Yuan , Xiao-Shan Gao

In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…

Algebraic Geometry · Mathematics 2018-10-01 Bentolhoda Binaei , Amir Hashemi , Werner M. Seiler

In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…

Rings and Algebras · Mathematics 2011-10-26 Viktor Levandovskyy , Kristina Schindelar

Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…

Commutative Algebra · Mathematics 2007-05-23 Antonio Montes

A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…

Combinatorics · Mathematics 2023-02-03 Jonathan Jedwab , Shuxing Li , Samuel Simon

Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to…

Algebraic Topology · Mathematics 2013-05-20 Zoran Z. Petrović , Branislav I. Prvulović , Marko Radovanović

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

K-Theory and Homology · Mathematics 2011-05-12 Vladimir Dotsenko , Anton Khoroshkin

We classify all the cocyclic Butson Hadamard matrices $\mathrm{BH}(n,p)$ of order $n$ over the $p$th roots of unity for an odd prime $p$ and $np\leq 100$. That is, we compile a list of matrices such that any cocyclic $\mathrm{BH}(n,p)$ for…

Combinatorics · Mathematics 2015-02-11 Ronan Egan , Dane Flannery , Padraig Ó Catháin

Motivated by the question of whether Chow polynomials of matroids have only real roots, this article revisits the known relationship between Eulerian polynomials and the Hilbert series of Chow rings of permutohedral varieties. This is done…

Combinatorics · Mathematics 2024-10-21 Basile Coron

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

Computational Complexity · Computer Science 2009-07-24 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan