Related papers: How to compute the multigraded Hilbert depth of a …
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
The original mixed multiplicity theory considered the class of mixed multiplicities concerning the terms of highest total degree in the Hilbert polynomial. This paper defines a broader class of mixed multiplicities that concern the maximal…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
It is natural to study octonion Hilbert spaces as the recently swift development of the theory of quaternion Hilbert spaces. In order to do this, it is important to study first its algebraic structure, namely, octonion modules. In this…
In arXiv:1210.3178 it was shown that subgroup depth may be computed from the permutation module of the left or right cosets: this holds more generally for a Hopf subalgebra, from which we note in this paper that finite depth of a Hopf…
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
A short proof of the "Rigidity theorem" using the sheaf theoretic model for Hilbert modules over polynomial rings is given. The joint kernel for a large class of submodules is described. The completion $[\mathcal I]$ of a homogeneous…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We present a formula for vector-valued modular forms, expressing the value of the Hilbert-polynomial of the module of holomorphic forms evaluated at specific arguments in terms of traces of representation matrices, restricting the weight…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We consider modules $M$ over Lie algebroids ${\mathfrak g}_A$ which are of finite type over a local noetherian ring $A$. Using ideals $J\subset A$ such that ${\mathfrak g}_A \cdot J\subset J $ and the length $\ell_{{\mathfrak g}_A}(M/JM)<…
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two…
We propose a hierarchical splitting approach to differential equations that provides a design principle for constructing splitting methods for $N$-split systems by iteratively applying splitting methods for two-split systems. We analyze the…
The injective polynomial modules for a general linear group $G$ of degree $n$ are labelled by the partitions with at most $n$ parts. Working over an algebraically closed field of characteristic $p$, we consider the question of which…
We give different bounds for the Stanley depth of a monomial ideal $I$ of a polynomial algebra $S$ over a field $K$. For example we show that the Stanley depth of $I$ is less or equal with the Stanley depth of any prime ideal associated to…
We describe a software package for constructing minimal free resolutions of GL_n(Q)-equivariant graded modules M over Q[x_1, ..., x_n] such that for all i, the ith syzygy module of M is generated in a single degree. We do so by describing…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…