In strongly negatively curved space, are solar systems possible?

I know that we’re still uncertain whether our own universe has slight negative curvature. But imagine a universe where space has an obvious negative curvature of, say, K=-1. In that universe, planets still be able to orbit stars?

submitted by Nevin Manimala Nevin Manimala /u/curiousscribbler
[link] [comments]

Fractional derivatives

I wondered if there was such thing as taking half the derivative and I googled it and found fractional calculus. I looked at it a little bit and found that it is based on Cauchy formula for repeated integration but with gamma function instead of factorials. The Cauchy formula is proven using induction which holds for natural numbers yet in fractional calculus it is used with real numbers. So I want to know how is that valid.

I’m studying electrical engineering so I’m not a mathematician which is why this might be a silly question.

submitted by Nevin Manimala Nevin Manimala /u/og_daily
[link] [comments]

Help finding a Best-fit Geomapping software

I’m looking for a geomapping software that will allow me to plug in about 18 months worth of data to view trends from month to month and show changing trends in a geographic area. I will input a series of customer’s zip codes and the months in which those customers came to visit us. I want to be able to see changing trends for the past 18 months in some sort of animation.

I know that Batchgeo will allow me to plug in the locations, but I’m not certain I will be able to view the changing trends in an animation. Any tips?

submitted by Nevin Manimala Nevin Manimala /u/zesty1989
[link] [comments]

SPSS computing variable error!

Hi guys!

I am currently working with SPSS and wanted to compute a “mean” variable for one of my tests (27 items).

When I am trying to, it says that i am only allowed 64 characters….

So, I can’t compute the mean out of those items because I am only allowed a limited number of characters????

Please help me,

thanks

submitted by Nevin Manimala Nevin Manimala /u/TomRiddle2411
[link] [comments]

Error term in latent variable derivation of logistic regression

Hi, I’m working on a model based off a latent utility framework where Pr[d=1] = Pr[xb > -e] with e is distributed logistically, x is some independent variable, b is its coefficient, and d is an indicator for if the option is chosen. This is a simple binomial choice scenario.

Now, I understand the typical assumption is that e has a standard logistic distribution with a mean of 0, but what if it actually has a mean greater than 0? Can you still write the choice probabilities as the CDF of the logistic distribution? It seems to me that you should be able to, however when I run a simple simulation in a statistical package the predicted choice probabilities only match the value of the CDF when I designate the error to have mean 0.

Could someone explain what I am missing here? I greatly appreciate any help.

submitted by Nevin Manimala Nevin Manimala /u/Gustatsor
[link] [comments]

Giving a presentation, don’t know where to start

I have been working with a professor on an undergraduate research project. The goal of the project was to create a program that could numerically solve differential equations. I ended up using the method of colocation, wherein I set up a linear system of equations to solve for the coefficients of the chebyshev polynomials that “solve” (as close as a polynomial can solve the equation, usually on the order of 10-10 – 10-16). The professor has asked me to give a 1 hr presentation on it to a group of freshmen. This is my problem, there is so much information that is crucial to why it works (chebyshev nodes and polynomials, orthagonality, fredholm alternative), and I can only assume knowledge up to cal 1. I don’t know what the best way to squeeze all of it down into an intuitive 1 hour session would be, and was wondering if you guys could give me some insight.

Thanks

submitted by Nevin Manimala Nevin Manimala /u/hellacatholic
[link] [comments]

Post all your Tesla news in this sticky. Follow the enclosed links for more discussion. New threads starters will be removed.

Is there any good way to describe the patterns of an infinite peg game?

If you don’t know, the peg game is a game where you have a triangle of holes all filled with pieces, one of which is empty. You jump pieces over each other into empty squares and take out the piece they jump, and the goal is to get only one peg left. This is an article showing it and how to solve it for the standard game board..

For a board like this, it’s pretty easy to determine what configurations of empty squares and pieces are possible just by checking all the possibilities. My question is this: I’m interested in a hypothetical infinitely large board, with still only one empty hole at the start. Given infinite moves, what are the kinds of patterns you can make? Are there patterns you can’t make? Which ones?

I’m not even sure how to adequately describe any given infinite board state unless it has a repeating pattern. Even if it’s not a super answerable question, if there’s any work that has been done that might be useful in talking or thinking about this kind of structure I would be very appreciative if someone could point me to it.

This has been bothering me for a while and I can’t find a good way to constructively move forward. I feel like it might not be something we can really describe very well at all. Thanks for any insights anyone can offer!

submitted by Nevin Manimala Nevin Manimala /u/QuickAGiantRabbit
[link] [comments]