### Abstract

The main asymptotic formula is given for the expected number of maxima transections of the large dimensionality sample for arbitrary orders which are determined on the basis of the special geometrical structures associated with the chosen subsets of reorientations of the d-ordering. theorems are proved that connect the order ratios and the growth degree of the expected dimension of the maxima set. The problem is branched by a set of subclasses interesting by themselves.

Original language | English |
---|---|

Pages (from-to) | 139-148 |

Number of pages | 10 |

Journal | Avtomatika i Telemekhanika |

Issue number | 1 |

Publication status | Published - Jan 1 1996 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering

### Cite this

*Avtomatika i Telemekhanika*, (1), 139-148.

**A set of maxima for arbitrary orders.** / Baryshnikov, Yu M.; Orlova, E. S.

Research output: Contribution to journal › Article

*Avtomatika i Telemekhanika*, no. 1, pp. 139-148.

}

TY - JOUR

T1 - A set of maxima for arbitrary orders

AU - Baryshnikov, Yu M.

AU - Orlova, E. S.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - The main asymptotic formula is given for the expected number of maxima transections of the large dimensionality sample for arbitrary orders which are determined on the basis of the special geometrical structures associated with the chosen subsets of reorientations of the d-ordering. theorems are proved that connect the order ratios and the growth degree of the expected dimension of the maxima set. The problem is branched by a set of subclasses interesting by themselves.

AB - The main asymptotic formula is given for the expected number of maxima transections of the large dimensionality sample for arbitrary orders which are determined on the basis of the special geometrical structures associated with the chosen subsets of reorientations of the d-ordering. theorems are proved that connect the order ratios and the growth degree of the expected dimension of the maxima set. The problem is branched by a set of subclasses interesting by themselves.

UR - http://www.scopus.com/inward/record.url?scp=0029712515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029712515&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029712515

SP - 139

EP - 148

JO - Avtomatika i Telemekhanika

JF - Avtomatika i Telemekhanika

SN - 0005-2310

IS - 1

ER -