Growth of bilinear maps II: bounds and orders

A good range of problems on trees can be described by the following general setting: Given a bilinear map ∗ : R d × R d → R d and a vector s ∈ R d , we need to estimate the largest possible absolute value g ( n ) of an entry over all vectors obtained from applying n - 1 applications of ∗ to n instan...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algebraic combinatorics 2024, Vol.60 (1), p.273-293
1. Verfasser:	Bui, Vuong
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Computer Science Convex and Discrete Geometry Group Theory and Generalizations Lattices Lower bounds Mathematics Mathematics and Statistics Order Ordered Algebraic Structures Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!