Related papers: On the Complexity of Hilbert Refutations for Parti…

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…

It is shown that any separable state on Hilbert space ${\cal H}={\cal H}_1\otimes{\cal H}_2$, can be written as a convex combination of N pure product states with $N\leq (dim{\cal H})^2$. Then a new separability criterion for mixed states…

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…

The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…

Given a tree $T$ on $n$ vertices, and $k, b, s_1, \ldots, s_b \in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting components can be grouped into $b$ groups such that the number of…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

This manuscript studies a special case of the Hurwitz enumeration problem: for branched covers from genus g compact Riemann surface to the Riemann sphere, with three branch points, and require the branching data at one of the branch points…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

We obtain a new family of relations satisfied by the partition function. In contrast with most partition relations, these involve non-trivial roots of unity. We present two proofs, one using the fact that the discriminant modular form is a…

The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shr\"odinger propagator…

For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal…

Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have a common zero in an algebraically closed field. Associated…

A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

A partial matrix over a field $\mathbb{F}$ is a matrix whose entries are either an element of $\mathbb{F}$ or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in $\mathbb{F}$ to all…