Related papers: Computing vector partition functions
We present a computational method for reconstructing a vector field on a convex polytope $\mathcal{P} \subset \mathbb{R}^d$ of arbitrary dimension from discrete samples. We specifically address the scenario where the vector field is subject…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…
We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…
Functional integrals are central to modern theories ranging from quantum mechanics and statistical thermodynamics to biology, chemistry, and finance. In this work we present a new method for calculating functional integrals based on a…
A fast approximation to the Boys functions (related to the lower incomplete gamma function of half-integer parameter) by a single closed-form analytical expression for all argument values have been developed and tested. Besides the…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…
Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. We prove that, if a determinant $\Delta_{r,D}$, which depends only on $r$ and $D$, with…
In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…
Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role,…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…
We present new, explicit, volume-preserving vector fields for polynomial divergence-free vector fields of arbitrary degree (both positive and negative). The main idea is to decompose the divergence polynomial by means of an appropriate…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$.…
A vector-circulant matrix is a natural generalization of the classical circulant matrix and has applications in constructing additive codes. This article formulates the concept of a vector-circulant matrix over finite fields and gives an…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…