相关论文: Short Rational Functions for Toric Algebra and App…

To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case.…

Let K be a field and let m_0,...,m_{n} be an almost arithmetic sequence of positive integers. Let C be a toric variety in the affine (n+1)-space, defined parametrically by x_0=t^{m_0},...,x_{n}=t^{m_{n}}. In this paper we produce a minimal…

In [A. Berele, Computing super matrix invariants, {\it Advances in Applied Math. \bf48} (2012), 273--289.] we defined integrals that approximated the Poincar\'e series of the invariants and concomitants of the general linear Lie supergroup…

In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…

Let $D\subseteq B$ be an extension of integral domains and $E$ a subset of the quotient field of $D$. We introduce the ring of \textit{$D$-valued $B$-rational functions on $E$}, denoted by $Int^R_B(E,D)$, which naturally extends the…

In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…

We define a Grothendieck ring for basic real semialgebraic formulas, that is for systems of real algebraic equations and inequalities. In this ring the class of a formula takes into consideration the algebraic nature of the set of points…

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

We introduce parabolic induction and restriction functors for rational Cherednik algebras, and study their basic properties. Then we discuss applications of these functors to representation theory of rational Cherednik algebras. In…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

Associated to any vector configuration A is a toric ideal encoded by vectors in the kernel of A. Each toric ideal has two special generating sets: the universal Gr\"obner basis and the Graver basis. While the former is generally a proper…

This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algebraic geometry and adiabatic quantum computing (AQC), and…

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…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…