On a simplified version of Hadamard's maximal determinant problem

04/05/2021
by   Ruslan Sharipov, et al.
0

Hadamard's maximal determinant problem consists in finding the maximal value of the determinant of a square n× n matrix whose entries are plus or minus ones. This is a difficult mathematical problem which is not yet solved. In the present paper a simplified version of the problem is considered and studied numerically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2020

Maximal-entropy driven determination of weights in least-square approximation

We exploit the idea to use the maximal-entropy method, successfully test...
research
07/18/2023

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids

Finding a maximum cardinality common independent set in two matroids (al...
research
11/28/2017

The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

This note is about a reasonable abstract machine, called Maximal MAM, im...
research
03/23/2022

An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds

In this technical report, we provide a complete example of running the S...
research
08/27/2019

A simplified L-curve method as error estimator

The L-curve method is a well-known heuristic method for choosing the reg...
research
09/21/2023

Maximal Simplification of Polyhedral Reductions

Reductions combine multiple input values with an associative operator to...
research
08/04/2020

Out-of-Distribution Generalization with Maximal Invariant Predictor

Out-of-Distribution (OOD) generalization problem is a problem of seeking...

Please sign up or login with your details

Forgot password? Click here to reset