English
Related papers

Related papers: The close relation between border and Pommaret mar…

200 papers

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

Algebraic Geometry · Mathematics 2024-11-19 Anyu Zhang , Brandilyn Stigler

Let $\mathbb{K}$ be a field and $A$ a Noetherian $\mathbb{K}$-algebra. In a paper of 2020, M. Albert, C. Bertone, M. Roggero and W. M. Seiler proved that, given a quasi-stable module $U \subset R^m$ with $R=\mathbb{K}[x_0,\dots,x_n]$, any…

Commutative Algebra · Mathematics 2025-10-31 Cristina Bertone , Francesca Cioffi , Paolo Lella

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

Symbolic Computation · Computer Science 2024-03-05 Momonari Kudo , Kazuhiro Yokoyama

We study two classes of operator algebras associated with a unital subsemigroup $P$ of a discrete group $G$: one related to universal structures, and one related to co-universal structures. First we provide connections between universal…

Operator Algebras · Mathematics 2022-03-09 Evgenios T. A. Kakariadis , Elias G. Katsoulis , Marcelo Laca , Xin Li

We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining "toric" roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more…

Algebraic Geometry · Mathematics 2014-06-05 Bernard Mourrain , Philippe Trebuchet

A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A po-semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of…

Rings and Algebras · Mathematics 2014-02-20 Tongsuo Wu , Dancheng Lu , Yuanlin Li

Motivated by the Matrix Spencer conjecture, we study the problem of finding signed sums of matrices with a small matrix norm. A well-known strategy to obtain these signs is to prove, given matrices $A_1, \dots, A_n \in \mathbb{R}^{m \times…

Data Structures and Algorithms · Computer Science 2021-11-08 Daniel Dadush , Haotian Jiang , Victor Reis

In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…

Symbolic Computation · Computer Science 2016-04-05 Maria Francis , Ambedkar Dukkipati

Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common…

Discrete Mathematics · Computer Science 2024-02-27 Florian Hörsch , András Imolay , Ryuhei Mizutani , Taihei Oki , Tamás Schwarcz

In this paper, we study how the degrees of the elements in a minimal $\mu$-basis of a parametrized surface behave. For an arbitrary rational surface parametrization $P(s,t)=(a_1(s,t),a_2(s,t),a_3(s,t),a_4(s,t)) \in \mathbb{F}[s,t]^4$ over…

Commutative Algebra · Mathematics 2018-10-29 Yairon Cid-Ruiz

The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal I(M) generated by the boundaries of the circuits of the matroid. There is an isomorphism between the Orlik-Solomon algebra of a…

Algebraic Topology · Mathematics 2007-05-23 Raul Cordovil , David Forge

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…

Symbolic Computation · Computer Science 2021-11-19 Jérémy Berthomieu , Mohab Safey El Din

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

Rings and Algebras · Mathematics 2007-05-23 Anne Heyworth

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

Commutative Algebra · Mathematics 2015-08-06 Dereje Kifle Boku , Claus Fieker , Wolfram Decker , Andreas Steenpass

Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p\in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…

Commutative Algebra · Mathematics 2007-05-23 Stefan Fumasoli

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Algebraic Geometry · Mathematics 2021-10-19 Marc Maliar

In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…

Algebraic Geometry · Mathematics 2020-01-09 Emilio Carvalho , Marcelo Escudeiro Hernandes

The main aim of this work is to apply the study of the asymptotic behaviour of generalized eigenvalues between infinite Hermitian definite positive matrices in an important question regarding the location of zeros of Sobolev orthogonal…

Functional Analysis · Mathematics 2023-05-26 C. Escribano , R. Gonzalo

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

Commutative Algebra · Mathematics 2007-05-23 Klaus Altmann , Bernd Sturmfels

Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable…

Combinatorics · Mathematics 2019-01-08 V. Álvarez , J. A. Armario , R. M. Falcón , M. D. Frau , F. Gudiel