Related papers: A Polynomial Ring Connecting Central Binomial Coef…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
Generic linkage is used to compute a prime ideal such that the radical of the initial ideal of the prime ideal is equal to the radical of a given codimension two monomial ideal that has a Cohen-Macaulay quotient ring.
We construct a quotient ring of the ring of diagonal coinvariants of the complex reflection group $W=G(m,p,n)$ and determine its graded character. This generalises a result of Gordon for Coxeter groups. The proof uses a study of category…
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…
The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…
We study the almost complete intersection ring $R$ defined by $n+1$ general quadrics in a polynomial ring in $n$ variables over a field $\sf{k}$ and a corresponding linked Gorenstein ring $A$. The overarching theme is that, while not Koszul…
In this paper, certain mixed special polynomial families associated with Appell sequences are introduced and their properties are established. Further, operational rules providing connections between these families and the known special…
Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…
This book is a rigorous and conceptually oriented introduction to ring theory. The emphasis is on structural understanding rather than encyclopedic coverage: rings are studied through ideals, homomorphisms, quotients, and universal…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
The content of a polynomial $f(t)$ is the ideal generated by its coefficients. Our aim here is to consider a beautiful formula of Dedekind-Mertens on the content of the product of two polynomials, to explain some of its features from the…
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…
We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…