A computational criterion for the supersolvability of line arrangements. (Q3462407)
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 6530316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational criterion for the supersolvability of line arrangements. |
scientific article; zbMATH DE number 6530316 |
Statements
14 January 2016
0 references
supersolvable arrangements
0 references
minimal distance
0 references
0.7966957688331604
0 references
0.7874016761779785
0 references
0.7829506993293762
0 references
0.7801975011825562
0 references
0.7791702151298523
0 references
