**Activities**

**Student Organizations**

**Math Club**

**BingAWM**

**Actuarial Association**

seminars:comb:abstract.201604mat

I will discuss two papers by Roudneff along with other established bounds on the number of triangles in arrangements of lines and pseduolines. First I will show Roudneff's construction of an infinite family of simple arrangements of pseudolines which satisfies the upper bound on the number of triangles, thus establishing a sharp polynomial upper bound. I will briefly discuss the upper bound on the number of triangles in simple arrangements of lines. I will then prove that any arrangement of lines satisfying the lower bound on the number of triangles must be simple.

seminars/comb/abstract.201604mat.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported