Generation of random pseudo-line arrangements (Q6540084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7849613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of random pseudo-line arrangements |
scientific article; zbMATH DE number 7849613 |
Statements
Generation of random pseudo-line arrangements (English)
0 references
15 May 2024
0 references
In this nice overview, the author presents some basics about pseudoline arrangements in the real (projective) plane, i.e. arrangements of smooth simple plane curves such that each pair of curves crosses transversally at exactly one point. After a nice introduction to the subject, including a question about the stretchability of pseudoline arrangements (which is NP-hard) or about different techniques we can use to understand such arrangements (such as wiring diagrams), the author addresses a question about random pseudoline arrangements and how to use Markov chains to construct such random arrangements with some specific properties. The main result that the author presents is devoted to the rapidly mixing Markov chains that flip only random triangles in general random pseudoline arrangements, and for details we refer to the last theorem in the note.
0 references
pseudoline arrangements
0 references
Markov chains
0 references
random pseudoline arrangements
0 references
0.7534397840499878
0 references
0.7465639114379883
0 references