Sentence examples for maximal determinant problem from inspiring English sources

The Hadamard maximal determinant problem asks for the largest n×n determinant with entries ±1.

These (−1,1 -matrices satisfy that HHT="HTH="nI and give the solution to the maximal determinant problem when n="1,2 or a multiple of 4. In this paper, we approach the maximal determinant problem using cocyclic matrices when n≡2mod4).

For certain small n, still larger determinants have been known; e.g., see [W.P. Orrick, B. Solomon, R. Dowdeswell, W.D. Smith, New lower bounds for the maximal determinant problem, arXiv preprint math.CO/0304410].

In this paper we summarize what is known about the number of equivalence classes of matrices having maximal determinant.

Although we have discussed the Hankel determinant problem in the paper, the first two problems are specifically related with the Fekete-Szegö functional, which is a special case of the Hankel determinant.

When n≡1(mod4), the maximal excess construction of Farmakis and Kounias [The excess of Hadamard matrices and optimal designs, Discrete Math. 67 (1987) 165 176] produces many large (though seldom maximal) determinants.

This leaves Gale with 15 minutes to cover some curriculum on what it's like working in a city with a high rate of social determinant problems.

Hub covering problems, as location-allocation problems, consist of two sub problems namely hub set covering problem (HSCP) and hub maximal covering problem (HMCP).

In this contribution, we introduced a polynomial algorithm for the Maximal Pairing Problem (MPP) as well as some variants.

It will turn out that the maximal clique problem for the graphs considered here is not NP-hard.

We assume individual relay power constraints and study an important design problem, a so-called determinant maximization (DM) problem.