✦ LIBER ✦

An upper bound for the height for regular affine automorphisms of({{{mathbb{A}}^ n}})

✍ Scribed by Lee, Chong Gyu

Book ID: 118248361
Publisher: Springer
Year: 2012
Tongue: English
Weight: 236 KB
Volume: 355
Category: Article
ISSN: 0025-5831
DOI: 10.1007/s00208-011-0775-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for theα-height of (0, 1)

An upper bound for theα-height of (0, 1)-matrices

✍ V. K. Leont'ev 📂 Article 📅 1974 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 351 KB

An upper bound for the number of Euleria

An upper bound for the number of Eulerian orientations of a regular graph

✍ M. Las Vergnas 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 168 KB

Spectral upper bounds for the order of a

Spectral upper bounds for the order of a k-regular induced subgraph

✍ Domingos M. Cardoso; Peter Rowlinson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Exponential upper and lower bounds for t

Exponential upper and lower bounds for the order of a regular language

✍ Andreas Weber 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

An Upper Bound for the Probability of a

An Upper Bound for the Probability of a Union

✍ David Hunter 📂 Article 📅 1976 🏛 Applied Probability Trust 🌐 English ⚖ 569 KB

An upper bound for the diameter of a pol

An upper bound for the diameter of a polytope

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d