Related papers: An algorithm for computing the multigraded Hilbert…

We consider the notion of mixed multiplicities for multigraded modules by using Hilbert series, and this is later applied to study the projective degrees of rational maps. We use a general framework to determine the projective degrees of a…

We use the method of Faltings (Arakelov, Par\v{s}in, Szpiro) in order to explicitly study integral points on a class of varieties over $\mathbb Z$ called Hilbert moduli schemes. For instance, integral models of Hilbert modular varieties are…

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

We study the degree of the special cubic fourfolds in the Hilbert scheme of cubic fourfolds via a computation of the generating series of Heegner divisors of even lattice of signature (2, 20).

We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an…

By a high-order numerical homogenization method, a heterogeneous multiscale scheme was developed in Jin & Li (2022) for evolving differential equations containing two time scales. In this paper, we further explore the technique to propose…

In this presentation we shall deal with some aspects of the theory of Hilbert functions of modules over local rings, and we intend to guide the reader along one of the possible routes through the last three decades of progress in this area…

We study multiview moduli problems that arise in computer vision. We show that these moduli spaces are always smooth and irreducible, in both the calibrated and uncalibrated cases, for any number of views. We also show that these moduli…

In this work, we consider the bilevel optimization problem on Riemannian manifolds. We inspect the calculation of the hypergradient of such problems on general manifolds and thus enable the utilization of gradient-based algorithms to solve…

We introduce the good Hilbert functor and prove that it is algebraic. This functor generalizes various versions of the Hilbert moduli problem, such as the multigraded Hilbert scheme and the invariant Hilbert scheme. Moreover, we generalize…

Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…

To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original…

We develop a theory of Valuation Hilbert Modules and prove a version of Beurling's theorem for these. Then we apply our version of Beurling's theorem to obtain complete descriptions of the closed invariant subspaces of a number of Hilbert…

Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms…

We present the first known efficient decoding algorithm for correcting multiple insertion-deletion errors in Helberg codes and their non-binary generalizations, extending a known algorithm for correcting multiple deletion errors.

A multiscale optimization framework for problems over a space of Lipschitz continuous functions is developed. The method solves a coarse-grid discretization followed by linear interpolation to warm-start project gradient descent on…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…

We construct an algorithm for the minimal model program in dimension three over the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein…

Let $K$ be a field and $S=K[x_1,...,x_n]$. In 1982, Stanley defined what is now called the Stanley depth of an $S$-module $M$, denoted $\sdepth(M)$, and conjectured that $\depth(M) \le \sdepth(M)$ for all finitely generated $S$-modules $M$.…

In this note we compute length, support and dimension of syzygy modules of certain modules. This partially answers questions asked by Huneke et al.