Related papers: Partition identities and application to infinite d…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
In the article "Non-commutative Grobner bases for commutative algebras", Eisenbud-Peeva-Sturmfels proved a number of results regarding Grobner bases and initial ideals of those ideals in the free associative algebra which contain the…
We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…
A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…
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…
Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…
Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial…
In a 2016 paper, Straub proved an analogue to Euler's partition identity for partitions with fixed perimeter. Later, Fu and Tang provided a refinement and generalization of Straub's analogue to $d$-distinct partitions as well as a result…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…
By using the Kang-Kashiwara-Misra-Miwa-Nakashima-Nakayashiki crystal base character formula for the basic $A_2^{(1)}$-module, and the principally specialized Weyl-Kac character formula, we obtain a Rogers-Ramanujan type combinatorial…
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…