English
Related papers

Related papers: Short Rational Functions for Toric Algebra and App…

200 papers

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…

Commutative Algebra · Mathematics 2025-12-19 Gert-Martin Greuel , Gerhard Pfister , Hans Schönemann

In this paper, we provide details on the proofs of the quantum polynomial time algorithm of Biasse and Song (SODA 16) for computing the $S$-unit group of a number field. This algorithm directly implies polynomial time methods to calculate…

Cryptography and Security · Computer Science 2025-11-25 Jean-Francois Biasse , Fang Song

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

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…

Commutative Algebra · Mathematics 2011-08-25 Christopher J. Hillar , Seth Sullivant

Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…

Commutative Algebra · Mathematics 2019-09-24 Susan M. Cooper , Alexandra Seceleanu , Stefan O. Tohaneanu , Maria Vaz Pinto , Rafael H. Villarreal

Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present…

Commutative Algebra · Mathematics 2018-08-22 Hidefumi Ohsugi , Takayuki Hibi

We study a class of double determinantal ideals denoted $I_{mn}^r$, which are generated by minors of size 2, and show that they are equal to the Hibi rings of certain finite distributive lattices. We compute the number of minimal generators…

Commutative Algebra · Mathematics 2025-07-01 Jennifer Biermann , Emanuela De Negri , Oleksandra Gasanova , Aslı Musapaşaoğlu , Sudeshna Roy

Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…

Complex Variables · Mathematics 2025-12-29 Yun Gao

In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a…

Commutative Algebra · Mathematics 2025-10-20 Vladimir P. Gerdt , Yuri A. Blinkov

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Commutative Algebra · Mathematics 2021-05-28 Keller VandeBogert

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

Consider a height two ideal, $I$, which is minimally generated by $m$ homogeneous forms of degree $d$ in the polynomial ring $R=k[x,y]$. Suppose that one column in the homogeneous presenting matrix $\f$ of $I$ has entries of degree $n$ and…

Commutative Algebra · Mathematics 2008-12-31 Andrew R. Kustin , Claudia Polini , Bernd Ulrich

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

Representation Theory · Mathematics 2008-08-23 Stephen Griffeth

The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…

Computational Complexity · Computer Science 2022-11-17 Manon Blanc , Olivier Bournez

This paper studies rational functions $\mathfrak{J}_\alpha(q)$, which depend on a positive element $\alpha$ of the root lattice of a root system. These functions arise as Shapovalov pairings of Whittaker vectors in Verma modules of highest…

Representation Theory · Mathematics 2025-05-07 Antoine Labelle

Let $I_A \subset K[x_1,\ldots,x_n]$ be a toric ideal. In this paper, we provide a necessary and sufficient condition for the toric variety $V(I_A)$, over an algebraically closed field, to be expressed as the set-theoretic intersection of…

Commutative Algebra · Mathematics 2026-02-10 Anargyros Katsabekis , Apostolos Thoma

Let g be the complex semisimple Lie algebra associated to a complex semisimple algebraic group G, b a Borel subalgebra of g, h the Cartan sublagebra contained in b and N the unipotent subgroup of G corresponding to the nilradical n of b. We…

Representation Theory · Mathematics 2013-08-19 Alexey Sevostyanov

We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…

Combinatorics · Mathematics 2016-09-06 Daniel E. Loeb

$ \newcommand{\ie}{i.\,e.} $We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-degree univariate rational functions at abscissas associated with the variables. We establish an equivalence up to…

Computational Complexity · Computer Science 2025-01-06 Ivan Hu , Dieter van Melkebeek , Andrew Morgan

This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…

Symbolic Computation · Computer Science 2023-07-28 Jérémy Berthomieu , Christian Eder , Mohab Safey El Din
‹ Prev 1 8 9 10 Next ›