Linear equations for unordered data vectors in [D]^k→Z^d

08/09/2021
by   Piotr Hofman, et al.
0

Following a recently considered generalisation of linear equations to unordered-data vectors and to ordered-data vectors, we perform a further generalisation to data vectors that are functions from k-element subsets of the unordered-data set to vectors of integer numbers. These generalised equations naturally appear in the analysis of vector addition systems (or Petri nets) extended so that each token carries a set of unordered data. We show that nonnegative-integer solvability of linear equations is in nondeterministic exponential time while integer solvability is in polynomial time.

READ FULL TEXT

Authors

02/19/2018

Linear Equations with Ordered Data

Following a recently considered generalization of linear equations to un...
01/31/2020

Exact and Robust Reconstruction of Integer Vectors Based on Multidimensional Chinese Remainder Theorem (MD-CRT)

The robust Chinese remainder theorem (CRT) has been recently proposed fo...
04/08/2016

A modified block Lanczos algorithm with fewer vectors

The block Lanczos algorithm proposed by Peter Montgomery is an efficient...
03/09/2021

Fast and Efficient Bit-Level Precision Tuning

In this article, we introduce a new technique for precision tuning. This...
12/16/2016

Computing solutions of linear Mahler equations

Mahler equations relate evaluations of the same function f at iterated b...
07/21/2021

PT VECTORS & TENSORS

PSYCHOTHOTONIX defines a quantum data set of internal non-matter image s...
02/10/2022

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

We study linear equations in combinatorial Laplacians of k-dimensional s...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.