𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Maximal Width of Empty Lattice Simplices

✍ Scribed by Christian Haase; Günter M. Ziegler

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
116 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We construct d-dimensional empty lattice simplices of arbitrarily high volume from (d -1)dimensional ones, while preserving the lattice width. In particular, we give an example of infinitely many empty 4-simplices of width 2.

📜 SIMILAR VOLUMES

On Simplicity of the Maximal Eigenvalue
On Simplicity of the Maximal Eigenvalue
✍ Bojan Kuzma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 81 KB

It is shown that a maximal eigenvalue of a rank-one perturbed, compact, self-adjoint operator is automatically simple, if the norm of perturbation is large enough.

The Width of Random Subsets of Boolean L
The Width of Random Subsets of Boolean Lattices
✍ Y. Kohayakawa; B. Kreuter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Suppose we toss an independent coin with probability of success p for each subset of ½n ¼ f1; . . . ; ng; and form the random hypergraph Pðn; pÞ by taking as hyperedges the subsets with successful coin tosses. We investigate the cardinality of the largest Sperner family contained in Pðn; pÞ: We obta

On the bisection width of the transposit
On the bisection width of the transposition network
✍ Kalpakis, Konstantinos; Yesha, Yaacov 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB 👁 3 views

The transposition network T n of order n! is the Cayley graph of the symmetric group S n with generators the set of all transpositions in S n . Finding the bisection width of the transposition network is an open question posed by F. T. Leighton. We resolve this question for n even, by showing that t