Related papers: Short Rational Functions for Toric Algebra and App…
The Todd polynomials, denoted as $td_k(b_1,b_2,\ldots,b_m)$, are characterised by their generating functions: $$\sum_{k\ge 0} td_k s^k = \prod_{i=1}^m \frac{b_i s}{e^{b_i s}-1}.$$ These polynomials serve as fundamental components in the…
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…
We describe the graded characters and Hilbert functions of certain graded artinian Gorenstein quotients of the polynomial ring which are also representations of the symmetric group. Specifically, we look at those algebras whose socles are…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
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…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of…
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…
Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…
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…
Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…
For any toric ideal $I$ in a polynomial ring $S$, we provide a combinatorial description of a free resolution of the integral closure of the $S$-module $S/I$. These new complexes arise from an extension of Bayer--Sturmfels' theory of…
We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
Let $(A,\mathfrak{m})$ be a regular local ring of dimension $d \geq 1$, $I$ an $\mathfrak{m}$-primary ideal. Let $N$ be a non-zero finitely generated $A$-module. Consider the functions \[ t^I(N, n) = \sum_{i = 0}^{ d}\ell(\text{Tor}^A_i(N,…
We use bounds on bilinear forms with Kloosterman fractions and improve the error term in the asymptotic formula of Balazard and Martin (2023) on the average value of the smallest denominators of rational numbers in short intervals.
Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
Celebrated work of Jerrum, Sinclair, and Vigoda has established that the permanent of a {0,1} matrix can be approximated in randomized polynomial time by using a rapidly mixing Markov chain. A separate strand of the literature has pursued…