English
Related papers

Related papers: Janet Bases of Toric Ideals

200 papers

With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to…

Commutative Algebra · Mathematics 2008-03-05 Eduardo Saenz-de-Cabezon

This paper proposes and develops new Newton-type methods to solve structured nonconvex and nonsmooth optimization problems with justifying their fast local and global convergence by means of advanced tools of variational analysis and…

Optimization and Control · Mathematics 2026-03-03 Pham Duy Khanh , Boris S. Mordukhovich , Vo Thanh Phat

We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…

Algebraic Geometry · Mathematics 2023-08-23 Barbara Betti , Marta Panizzut , Simon Telen

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

Numerical Analysis · Mathematics 2017-12-04 Nicholas Hale , Sheehan Olver

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…

Mathematical Software · Computer Science 2019-09-17 Paul Tarau

The aim of these notes is to present an accessible overview of some topics in classical algebraic geometry which have applications to aspects of discrete integrable systems. Precisely, we focus on surface theory on the algebraic geometry…

Algebraic Geometry · Mathematics 2025-10-15 Gessica Alecci , Michele Graffeo , Alexander Stokes

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Commutative Algebra · Mathematics 2021-09-30 Xavier Dahan

In this paper, we consider a monomial ideal J in P := A[x1,...,xn], over a commutative ring A, and we face the problem of the characterization for the family Mf(J) of all homogeneous ideals I in P such that the A-module P/I is free with…

Commutative Algebra · Mathematics 2013-10-04 Michela Ceria , Teo Mora , Margherita Roggero

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

Commutative Algebra · Mathematics 2026-03-10 Nikola Bogdanovic , Laura Cossu , Azeem Khadam

We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.

Commutative Algebra · Mathematics 2015-01-27 Christian Valqui , Marco Solorzano

For an arbitrary field K, let I be an ideal in the ring K[[x,y]] expressible as a polynomial in either the pair of ideals (x, y^4) and (x,y) or the pair (x,y^3) and (x^2, y). Let G be the group of automorphisms of K[[x,y]] sending the ideal…

Algebraic Geometry · Mathematics 2007-05-23 Heather Russell

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

Symbolic Computation · Computer Science 2015-06-09 Sajjad Rahmany , Abdolali Basiri , Benyamin M. -Alizadeh

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

Dynamical Systems · Mathematics 2016-10-11 Dierk Schleicher

The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…

Commutative Algebra · Mathematics 2013-03-05 Oleg Golubitsky , Marina Kondratieva , Alexey Ovchinnikov

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

Numerical Analysis · Mathematics 2024-07-02 Simon Telen , Nick Vannieuwenhoven

Inferences in directed acyclic graphs associated with probability sets and probability intervals are NP-hard, even for polytrees. In this paper we focus on such inferences, and propose: 1) a substantial improvement on Tessems A / R…

Artificial Intelligence · Computer Science 2012-12-21 Jose Carlos Ferreira da Rocha , Fabio Gagliardi Cozman , Cassio Polpo de Campos

A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…

Numerical Analysis · Mathematics 2024-02-13 Juan A. Acebron , Angel Rodriguez-Rozas

In this paper, the tropical differential Gr\"obner basis is studied, which is a natural generalization of the tropical Gr\"obner basis to the recently introduced tropical differential algebra. Like the differential Gr\"obner basis, the…

Symbolic Computation · Computer Science 2019-04-05 Youren Hu , Xiao-Shan Gao

Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…

Commutative Algebra · Mathematics 2022-08-24 Aldo Conca , Manolis C. Tsakiris

We briefly describe a new general algorithm for carrying out QCD calculations to next-to-leading order in perturbation theory. The algorithm can be used for computing arbitrary jet cross sections in arbitrary processes and can be…

High Energy Physics - Phenomenology · Physics 2007-05-23 Stefano Catani , Michael H. Seymour