Related papers: Macaulay bases of modules
Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…
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…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases that are as "far apart" as possible, and their classification reveals rich underlying geometric structure. Given a complex inner product space, we construct…
Let $H$ be the Iwahori--Hecke algebra associated with $S_n$, the symmetric group on $n$ symbols. This algebra has two important bases: the Kazhdan--Lusztig basis and the Murphy basis. While the former admits a deep geometric interpretation,…
For Arithmetization-Oriented ciphers and hash functions Gr\"obner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gr\"obner basis algorithms is only understood for special…
Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…
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…
We define a method which produces explicit cellular bases for algebras obtained via a Jones basic construction. For the class of algebras in question, our method gives formulas for generic Murphy--type cellular bases indexed by paths on…
In this paper we describe the structure of the space of parabolic reductions, and their compactifications, of principal $G$-bundles over a smooth projective curve over an algebraically closed field of arbitrary characteristic. We first…
Consider the diagonal action of the special orthogonal group on the direct sum of a finite number of copies of the standard representation--the underlying field is assumed to be algebraically closed and of characteristic not equal to two.…
Let $R$ be a commutative ring with identity and $G$ a graph. \emph{An extending generalized spline} on $G$ is a vertex labeling $f \in \prod_{v} M_v$ such that at each edge $e=uv$ there is an $R$-module $M_{uv}$ together with homomorphisms…
This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
In equivariant topology, Greenlees and May used Mackey functors to show that, rationally, the stable homotopy category of $G$-spectra over a finite group $G$ splits as a product of simpler module categories. We extend the algebraic part…
The GVW algorithm is a signature-based algorithm for computing Gr\"obner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are rejected by GVW's Syzygy Criterion, instead, GVW have to…
The goal of the present paper is a short introduction to a general module frame theory in C*-algebras and Hilbert C*-modules. The reported investigations rely on the idea of geometric dilation to standard Hilbert C*-modules over unital…