Mathematics desk | ||
---|---|---|
< April 27 | << Mar | April | May >> | April 29 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
There's a simple formula for calculating your line of sight given a certain height H: .
But what about the longest possible line of sight given two heights, H1 and H2? (Assuming spherical Earth of course) ECS LIVA Z ( talk) 07:42, 28 April 2017 (UTC)
Hi all,
How many independent sets of size k are there in a d-regular graph on n vertices?
Thanks in advance — Preceding
unsigned comment added by
185.120.126.40 (
talk) 18:10, 28 April 2017 (UTC)
Consider the space of all connected acyclic graphs whose vertices are the elements of N. A basic clopen set is of the form where is an acyclic graph on , and is the set of all connected acyclic graphs that restrict to on . Is this space Polish?
The natural metric is , where is largest such that the restrictions of and agree on , but this isn't complete. For example, for odd, let be the graph with an edge between and for every , and an edge from to . Then , but the limit isn't connected.-- 2406:E006:2C7:1:5CE9:32F9:4BCD:AEF3 ( talk) 21:31, 28 April 2017 (UTC)
Mathematics desk | ||
---|---|---|
< April 27 | << Mar | April | May >> | April 29 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
There's a simple formula for calculating your line of sight given a certain height H: .
But what about the longest possible line of sight given two heights, H1 and H2? (Assuming spherical Earth of course) ECS LIVA Z ( talk) 07:42, 28 April 2017 (UTC)
Hi all,
How many independent sets of size k are there in a d-regular graph on n vertices?
Thanks in advance — Preceding
unsigned comment added by
185.120.126.40 (
talk) 18:10, 28 April 2017 (UTC)
Consider the space of all connected acyclic graphs whose vertices are the elements of N. A basic clopen set is of the form where is an acyclic graph on , and is the set of all connected acyclic graphs that restrict to on . Is this space Polish?
The natural metric is , where is largest such that the restrictions of and agree on , but this isn't complete. For example, for odd, let be the graph with an edge between and for every , and an edge from to . Then , but the limit isn't connected.-- 2406:E006:2C7:1:5CE9:32F9:4BCD:AEF3 ( talk) 21:31, 28 April 2017 (UTC)