Related papers: A rank computation problem related to the HK funct…

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

We examine so-called rank function equations and their solutions consisting of non-nilpotent matrices. Secondly, we present some geometrical properties of the set of solutions to certain rank function equations in the nilpotent case.

Let R denote a two-dimensional normal standard-graded domain over the algebraic closure K of a finite field of characteristic p, and let I denote a homogeneous primary ideal. We prove that the Hilbert-Kunz function of I has the form =…

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

In this article, we give an explicit and uniform lower bound of the arithmetic Hilbert-Samuel function of projective hypersurfaces, which has the optimal dominant term. As an application, we apply this lower bound in the determinant method.

Here we prove that the Hilbert-Kunz mulitiplicity of a quadric hypersurface of dimension $d$ and odd characteristic $p\geq 2d-4$ is bounded below by $1+m_d$, where $m_d$ is the $d^{th}$ coefficient in the expansion of…

The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…

We describe an algorithm which computes components of Humbert surfaces in terms of Rosenhain invariants, based on Runge's method

Consider a matrix $\mathbf{F} \in \mathbb{K}[x]^{m \times n}$ of univariate polynomials over a field $\mathbb{K}$. We study the problem of computing the column rank profile of $\mathbf{F}$. To this end we first give an algorithm which…

A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…

We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…

Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…

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…

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

We show that the Hilbert polynomial of a Calabi-Yau hypersurface $Z$ in a smooth toric variety $M$ associated to a convex polytope $\Delta$ is given by a lattice point count in the polytope boundary $\partial \Delta,$ just as the Hilbert…

In this paper we combine the theory of reproducing kernel Hilbert spaces with the field of collocation methods to solve boundary value problems with special emphasis on reproducing property of kernels. From the reproducing property of…

In this paper, we will give an upper bound and a lower bound of the arithmetic Hilbert-Samuel function of projective hypersurfaces, which are uniform and explicit. These two bounds have the optimal dominant terms. As an application, we use…

We study a reproducing kernel Hilbert space of functions defined on the positive integers and associated to the binomial coefficients. We introduce two transforms, which allow us to develop a related harmonic analysis in this Hilbert space.…

We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in…