Related papers: How to compute the multigraded Hilbert depth of a …

In this paper, we give a way to construct graded filtrations of graded modules. We then apply it to the Sally module, which describes a correction term of the Hilbert function. As a result, we obtain the inequality of the Hilbert…

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

We present short and elementary proofs of two theorems of Huckaba and Marley, while generalizing them at the same time to the case of a module. The theorems concern a characterization of the depth of the associated graded ring of a…

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation.

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

In this note we settle some technical questions concerning finite rank quasi-free Hilbert modules and develop some useful machinery. In particular, we provide a method for determining when two such modules are unitarily equivalent. Along…

Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that…

Let $ R=k[x_1...x_r]$ and $M$ a multigraded $R-$module. In this work we interpret $M$ as a multipersistent homology module and give a multigraded resolution of it. The construction involves cellular resolutions of monomial ideals and…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…

Let $h:\mathbb Z \to \mathbb Z_{\geq 0}$ be a nonzero function with $h(k)=0$ for $k\ll 0$. We define the Hilbert depth of $h$ by $\operatorname{hdepth}(h)=\max\{d\;:\; \sum_{j\leq k} (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq…

Any Hilbert space with composite dimension can be factorized into a tensor product of smaller Hilbert spaces. This allows to decompose a quantum system into subsystems. We propose a simple tractable model for a constructive study of…

For computing the exact value of the halfspace depth of a point w.r.t. a data cloud of $n$ points in arbitrary dimension, a theoretical framework is suggested. Based on this framework a whole class of algorithms can be derived. In all of…

Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…

The aim of this work is to study the ring-theoretic properties of the diagonals of a Rees algebra, which from a geometric point of view are the homogeneous coordinate rings of embeddings of blow-ups of projective varieties along a…

One standard approach to compute the Hilbert function of any graded module over a field is to come up with a free-resolution for the graded module and another is via a Hilbert power series which serves as a generating function. The proposed…

Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The…

In this paper, we develop general machinery for computing the classifying ring $L^A$ of one-dimensional formal $A$-modules, for various commutative rings $A$. We then apply the machinery to obtain calculations of $L^A$ for various number…