A Constraint Propagation Algorithm for Sums-of-Squares Formulas over the Integers

10/11/2018
by   Melissa Lynn, et al.
0

Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce sums-of-squares formulas and to show that formulas of certain types cannot exist. In this paper, we introduce an algorithm that produces consistently signed intercalate matrices, or proves their nonexistence, extending previous methods beyond what is computationally feasible by hand.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2023

Numerical cubature on scattered data by adaptive interpolation

We construct cubature methods on scattered data via resampling on the su...
research
08/05/2021

Construction and application of provable positive and exact cubature formulas

Many applications require multi-dimensional numerical integration, often...
research
12/21/2022

Fast multiplication, determinants, and inverses of arrowhead and diagonal-plus-rank-one matrices over associative fields

The article considers arrowhead and diagonal-plus-rank-one matrices in F...
research
05/03/2021

Explicit formulas for the inverses of Toeplitz matrices, with applications

We derive explicit formulas for the inverses of truncated block Toeplitz...
research
09/18/2019

A Tractable Logic for Molecular Biology

We introduce a logic for knowledge representation and reasoning on prote...
research
06/24/2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter ...
research
06/12/2020

Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes

Entropy stable schemes replicate an entropy inequality at the semi-discr...

Please sign up or login with your details

Forgot password? Click here to reset