Wikipedia:Reference desk/Mathematics

Welcome to the mathematics section
of the Wikipedia reference desk.

skip to bottom

Select a section:

• Computing
• Entertainment
• Humanities
• Language
• Mathematics
• Science
• Miscellaneous
• Archives

Want a faster answer?

Main page: Help searching Wikipedia

   

How can I get my question answered?

• Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
• Post your question to only one section, providing a short header that gives the topic of your question.
• Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
• Don't post personal contact information – it will be removed. Any answers will be provided here.
• Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
• Note:
  • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
  • We don't answer requests for opinions, predictions or debate.
  • We don't do your homework for you, though we'll help you past the stuck point.
  • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.

Ready? Ask a new question!

How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

• The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.

See also:

• Teahouse
• Help desk
• Village pump
• Help manual

April 11

Parametrization of the set of triangles upto similarity

Is there any simple way to map a triangle to a pair of real parameters such that:

1. The parameters are invariant under (a) relabelling of the vertices, (b) translation, (c) rotation, (d) reflection and (e) scaling of the triangle
2. The mapping is continuous and infinitely differentiable, not piecewise - no "take the longest side"
3. The mapping is either invertible or otherwise provably one-to-one?

If there is no easy answer to that, then what topological surface is defined by the set; a sphere, a torus? Thanks, catslash (talk) 00:54, 11 April 2019 (UTC)

@Catslash: If you allowed 'take the two smallest angles' (or two largest angles), than such a pair is a mapping you want. Taking arbitrary two angles would work, but in one direction only: (30°, 60°) and (90°, 30°) would map to the same set of triangles.

BTW, what do you mean by continuous? That requires some distance between arguments and between values of a function. How would you define a distance between arbitrary two triangles? --CiaPan (talk) 09:33, 11 April 2019 (UTC)

Here, continuous means that the parameters are continuous functions of the real coordinates of the vertices (at least as long as the area of the triangle remains non-zero).

I had, perhaps erroneously, discounted taking two angles as being piecewise and therefore non-smooth. This is however clearly continuous at the joins where a smallest angle jumps from one vertex to another and the triangle passes through being isosceles into the mirror image of its former self. catslash (talk) 11:33, 11 April 2019 (UTC)

By the way, what do you mean by "being piecewise"? "Piecewise" has to modify another adjective rather than a noun. Anyway, the nature of the problem somewhat depends on what you mean by "triangle". That is, can its points coincide? Can they be collinear? The answer to those questions determine what kind of configuration space your domain is. –Deacon Vorbis (carbon • videos) 12:05, 11 April 2019 (UTC)

By piecewise, I meant having different maps for different pieces of the domain. It raises the issue of continuity and smoothness on passing from one piece to another. If implemented in a computer program, it necessitates conditional branching. catslash (talk) 19:26, 11 April 2019 (UTC)

Yes, but that's not what "piecewise" means. A function on the reals is piecewise blah (where blah might be continuous, or differentiable, etc.) if you can divide its domain up into a number of intervals such that the function is blah on each interval. But for more variables, it's a bit less clear what even, e.g., piecewise continuity would entail. Not only that, but as I mentioned above, the "space of triangles" isn't just $\mathbb {R} ^{6}$ – you may or may not want to remove parts that correspond to degenerate triangles, and you're implicitly taking the quotient by the group action of the symmetric group which permutes the vertices of the triangle. Also, mathematically, there's really no such thing as being "piecewise" without being "piecewise blah". For example, the standard way to describe the absolute value function:

$|x|={\begin{cases}-x&{\text{if }}x\leq 0\\x&{\text{if }}x\geq 0\end{cases}}$

may be superficially given in a piecewise fashion, but it's still perfectly continuous. It could just as easily be written as

$|x|={\sqrt {x^{2}}}.$

So it really doesn't make sense to call a function "piecewise" without saying "piecewise blah" (still not forgetting that for functions of multiple variables, some extra caution is needed to use that sort of term). This is more than semantic quibbling; it really gets at what it means to specify a function. –Deacon Vorbis (carbon • videos) 21:44, 11 April 2019 (UTC)

Then I should have said either not merely piecewise, or else everywhere continuous and differentiable. I was unaware that piecewise had a technical meaning - thank you for explaining it. Irrespective of how |x| for real x is written, it is not smooth -has a discontinuous derivative- at x = 0.

Triangles of zero area are of zero interest - they can be included or excluded from the domain, whichever makes the problem tractable. Please let me know whether the question requires further clarification in order for you to offer an answer. catslash (talk) 23:10, 11 April 2019 (UTC)

What's wrong with your parameters $(a,b)$ being mapped to a triangle with two angles $(\alpha ,\beta )$ where

1. $\alpha =\arctan(a)+{\frac {\pi }{2}}$
2. $\beta =(\pi -\alpha ){\frac {\arctan(b)+{\frac {\pi }{2}}}{\pi }}$?

I think this maps the reals to the set of triangles up to similarity.--Leon (talk) 13:33, 11 April 2019 (UTC)

@Catslash: I suppose the pair of ratios of some global 'linear size' of a triangle to a similar measure of the circumscribed and the inscribed circle could work. For example:

${\text{triangle}}\mapsto \left({\frac {\text{triangle circumference}}{\text{circumradius}}},{\frac {\text{triangle circumference}}{\text{inradius}}}\right)$

Areas (which are proportional to a square of linear sizes) should work as well:

${\text{triangle}}\mapsto \left({\frac {\text{triangle area}}{\text{circumcircle area}}},{\frac {\text{triangle area}}{\text{incircle area}}}\right)$

This seems smooth and it's independent on translation, permutation, rotation and scaling. It doesn't cover degenerated triangles (which would have infinite or zero circumcircles and degenerated incircles). However, I didn't make sure yet it is one-to-one. --CiaPan (talk) 06:39, 12 April 2019 (UTC)

@CiaPan: I’m curious–how can you prove that the two ratios triangle circumference / circumradius and triangle circumference / inradius together specify a unique triangle (up to similarity)? Loraof (talk) 18:03, 14 April 2019 (UTC)

@CiaPan: Those are exactly the sort of parameters I was hoping for: normalized to the triangle area, two quantities out of; circumradius, inradius, second moment, perimeter, sum of squares of sides etc. But how to prove that the two parameters together specify a unique triangle (up to similarity)? catslash (talk) 22:33, 14 April 2019 (UTC)

April 15

What are negative odds?

From this article: [1]. It describes one bet as having -100,000 odds and a $20,000 bet that wins at those odds nets $20. What does that mean and how does that math work on that? My thought is that if $20,000 gets you $20 then that is 1:1000 odds ($1000 bet gets $1 win), so I don't follow what -100,000 means. RudolfRed (talk) 18:55, 15 April 2019 (UTC)

These are Moneyline odds, primarily used in the US. Iffy★Chat -- 19:52, 15 April 2019 (UTC)

Thanks for the link, that answers it! RudolfRed (talk) 20:42, 15 April 2019 (UTC)

April 16

Recurrence Relation

Given the recurrence:

$\forall m,n>0.\ T(n,m)=\min(\{m\}\cup \{T(a,b)+T(n-a,c)+T(n,m-bc)\ |a,\ b,\ n-a,\ c,\ n,\ m-bc\ >\ 0,\ b\leq a!,\ c\leq (n-a)!\})$

What is $T(n,n!)$? (I am intersted only in the asymptotic growth, and the no initial condition is needed, since in the "initial cases" the rightmost set is empty)

David (talk) 19:09, 16 April 2019 (UTC)

Are the inputs all taken to be positive integers? Nonnegative integers? (In the latter case, it is not clear to me that this is well-defined, in that there may be cycles in terms of which values depend on which others; in the former, at least some of the weak inequalities should be strict.) Is there a context for the question (e.g., permutation enumeration)? --JBL (talk) 23:01, 16 April 2019 (UTC)

Yes, it's about permutation enumeration.

I edited my question. Is it clear now? David (talk) 06:24, 17 April 2019 (UTC)

@עברית: no, because if a, b must always be less than m and n, then the only possibility is a = b = 1, which I don't think is what you intend.--Jasper Deng (talk) 10:07, 17 April 2019 (UTC)

@Jasper I don't see why the only possibility is a=b=1. David (talk) 10:43, 17 April 2019 (UTC)

As you stated it, n and m are independent variables, with a, b, and c dependent variables that must satisfy the stated inequalities for all valid pairs n,m. Probably not what you intended. --{{u|Mark viking}} {Talk} 18:48, 17 April 2019 (UTC)

What I mean is: for each pair n,m we get a (possibly empty) set of numbers with a,b,c that are depending on this specific pair n,m. David (talk) 21:14, 17 April 2019 (UTC)