bio | website | york.cuny.edu/~malk |
---|---|---|
location | New York | |
age | ||
visits | member for | 4 years, 5 months |
seen | Dec 31 '10 at 18:21 | |
stats | profile views | 868 |
I am a mathematician interested in geometry, combinatorics, mathematical modeling, and mathematics education.
Nov 9 |
awarded | Yearling |
Nov 9 |
awarded | Yearling |
Nov 10 |
awarded | Yearling |
Apr 20 |
awarded | Necromancer |
Nov 10 |
awarded | Yearling |
Aug 8 |
comment |
Elementary problem about triangles inside a convex polygon
Have other variants of this type of problem been studied where instead of attaching a triangle to each side of the polygon one attaches some other shape? |
Aug 6 |
comment |
Periods of Continued Fractions
Ideas in this paper might be of use: math.princeton.edu/mathlab/jr02fall/Periodicity/periodmain.htm |
Jul 24 |
answered | Probability of random permutation having certain cycles |
Jul 23 |
answered | What is the first interesting theorem in (insert subject here)? |
Jul 22 |
comment |
Cycles of length 1(mod 3) in regular graphs
Gjergij: Yes, that is correct. While not noted above there is quite a large literature about the existence (or lack of existence) of cycles in graphs, in particular mod m. Perhaps things are easier in the case that interests you for planar graphs. |
Jul 22 |
answered | Cycles of length 1(mod 3) in regular graphs |
Jul 21 |
answered | Planar sets where any line through the center of mass divides the set into two regions of equal area. |
Jul 20 |
comment |
What are some mathematical sculptures?
Comments about and samples of George Hart's fascinating work can be found here: richbugger.wordpress.com/2009/12/04/… |
Jul 18 |
answered | Examples of self-centered graphs (with large radius) |
Jul 14 |
answered | Algorithms for maximum weighted spanning (connected) dag (directed acyclic graph) |
Jul 13 |
comment |
Is the feedback vertex number bounded by the maximum number of leaves in a spanning tree?
You might consider looking at this circle of ideas for planar graphs. David Barnette showed that for a planar 3-connected graph there is always a spanning tree of maximum valence 3. However, if I remember properly, he also showed that for d-polytopal graphs (d more than 3) that there is no uniform upper bound for the valence of a spanning tree. d-polytopal graphs are known to be d-connected. This paper might also be of interest: citeseerx.ist.psu.edu/viewdoc/… |
Jul 5 |
comment |
eBook readers for mathematics
If I have a pdf file on my computer (I use a MAC) and transfer it to an Ebook reader such as the Kindle, do I incur a financial charge for doing this? |
Jul 5 |
comment |
Euclid with Birkhoff
This book does not treat the hyperbolic plane. Another advantage of Millman and Parker, Geometry: A Metric Approach with Models is that it has a much more modern flavor treating things like the taxicab plane, the Moulton plane, etc. |
Jul 5 |
answered | Euclid with Birkhoff |
Jul 4 |
answered | determining k-edge-connectivity of a graph |