I am making some slides for a presentation. I am copying parts of a texfile which I made earlier. The \emph{} command is not working in beamer (even though it is working in my original texfile).  For example, this code which is working in the original file is not working in beamer:  \begin{theorem} {  |\emph{Gal}(L|K)|=[F:K] } \end{theorem}   But this is working:  \begin{theorem} {  |Gal(L|K)|=[F:K] } \end{theorem}   But the 'Gal' is italic  (I want it to be straight).
Lets say I have something like:   \[ Let x = number of cats \]   (This is a contrived example, but pretend we are actually inside a long align environment block...) "Let" and "number of cats" need to be written like normal text, while x= needs to be math type text.  I've seen this:  \[ \mbox{Let } x = \mbox{ number of cats} \]   and this:  \[ \textrm{Let } x = \textrm{ number of cats} \]   They seem to produce equivalent output, but I'm not sure which is the "correct" one. Also, they are not ideal in that the extra space needs to be placed inside the text mode block, otherwise it is ignored as math mode and butts the text right up against the math.  Ideally there would be some command which allowed embedding text into an equation, which correctly inserted leading and trailing space around the block as required without adding space inside the text block.  How does one do that "correctly"?
US Salary Transfered to Indian Acc and Tax Relation I am on an H1b visa working and receiving a salary in the US. I have transferred approximately $15-20k to my account in India Account (not an NRE account).    How would this transfer affect my taxes in US and India. How can I avoid tax on the money that I have transferred. Would any investments help save taxes? Do I need to declare anything? If so, where ? As you can see, the off-topic page isn&#39;t quite right...    Could this (minor) issue be fixed? How do you make Ubuntu accept files sent over bluetooth I have a problem when I send my files from phone to ubuntu 12.04 via bluetooth as the phone prompts with the message "the file not sent"! I can send any files from ubuntu 12.04 to my android phone. Why multiplicative group $\mathbb{Z}_n^*$ is not cyclic for $n = 2^k$ and $k \ge 3$ Supremum of a product measurable function... Why say "of x's" instead of "of x"? I have often heard people say "x of his" or "x of mine". But since his and mine point out ownership, isn't using "of" here doubles that ownership? Wouldn't it be more appropriate to say "x of him" or "x of them" etc.?  Example:     I was a good friend of your dad's. He told me all about you` If a graph with $n$ vertices and $n$ edges there must a cycle? I realize I am taking a risk by reopening what seems to be an old, hoary, and thorny discussion. However, it seems that in all the long discussions about Meta Stack Exchange reputation, what it means, and why it's separate from reputation on other sites, I have never seen a complete answer to this question:  If reputation on Meta Stack Exchange is used by the community to indicate agreement with an opinion instead of the quality of a post, why is it still tied to site privileges?  The association between reputation and privileges makes sense on other Stack Exchange sites, where reputation is a measure of your participation in the site and the quality of your questions and answers. If you contribute positively to the community your reward is increased privileges, whereas your punishment for "polluting" the site with bad questions or unhelpful answers is a loss of privileges.  However, on Meta Stack Exchange, reputation is a measure of the popularity, not the quality, of your contributions. Tying reputation to privileges means that losing privileges on the site is a punishment for expressing an unpopular opinion, and gaining them is a reward for agreeing with the majority.   My opinion:  I don't think that tying privileges to popularity makes sense as a feedback system. It doesn't really encourage quality contributions, and even worse, acts to suppress minority opinions through the threat of losing privileges. As a user with fairly low reputation, I am afraid of asking a question that may be controversial, because if enough other members disagree with me I will be stripped of the ability to vote and chat. Even if I had higher reputation, I would still be concerned that expressing a controversial opinion would cause me to lose helpful privileges like editing and viewing close votes.   The FAQ tells new users "not to be concerned" by downvotes because all it means is that the community disagrees with them. However, I think new users have every right to be concerned about downvotes, because they still mean the loss of privileges. Is their a way to move multiple vertices gradually at a time? I have moved multiple vertices gradually but a set of vertices at a time not all at a time, as shown in the animation below (First I moved the four vertices from top, then three, then two and at last the last vertex).  I wanted to do the same thing as shown in the animation below but all at a time. How to compute $\,3^{3^{3^{\:\!\phantom{}^{.^{.^.}}}}}\!\!\!\!\bmod 46,$ for power tower height $2020$? What is the remainder of $\,3^{3^{3^{\:\!\phantom{}^{.^{.^.}}}}}\!\!\!$ divided by $46$?  The level of powers is $2020$.  First there is no parenthesis so it means 3 power of 3 which is also power 3 and so on 2020 times  Second I think that we can use Fermat's Little Theorem but I don't know how, and maybe there is a better way. What is the purpose of Microsoft.SharePoint.Runtime.dll in CSOM? I know we need to use Microsoft.SharePoint.Client and Microsoft.SharePoint.Client.Runtime dll's reference in .NET managed CSOM application development. But can someone help me understand why we have to use Microsoft.SharePoint.Client.Runtime and whats it's purpose, in detail. or point me to a reference please. Thank you in advance I want to do a survey of textbooks in set theory. Amazon returns 3582 books for the keywords "set theory". A small somewhat random selection with number of references in Google scholar is the following.   Two questions:    What textbooks in set-theory are considered standard?  What is a good place to aggregate standard references (of textbooks)?    (I'm only interested in text-books, which as a format already provide a kind of standardization)  Textbooks on set theory (author: title (year) #Google Scholar citations )   Thomas J. Jech: Set Theory 3rd Edition (1978) #2441  Kenneth Kunen: Set Theory (1980) #1881  P. R. Halmos: Naive Set Theory (1974) #1079 AA Fraenkel, Y Bar-Hillel, A Levy: Foundations of set theory (1973) #696 K Kuratowski, A Mostowski, M Mączyński: Set theory (1976) #609 Suppes: Axiomatic set theory  (1972) #589 Quine: Set theory and its logic (1969) #442 A Levy: Basic set theory (1979) #442 Herbert B. Enderton: Elements of Set Theory (1977) #349 Karel Hrbacek, Thomas J. Jech: Introduction to set theory (1999) #284 RR Stoll: Set theory and logic (1979) #281  N. Bourbaki: theory of sets (1970) #211 K Devlin: The joy of sets: fundamentals of contemporary set theory (1994) #182 Ciesielski: Set theory for the working mathematician (1997) #156 YN Moschovakis: Notes on set theory (1994) #138 FW Lawvere: Sets for mathematics (2003) #118 G Takeuti, WM Zaring: Introduction to axiomatic set theory (1982) #106 Kaplansky: Set Theory and Metric Spaces (2001) #103 Potter: Set Theory and Its Philosophy: A Critical Introduction (2004) #91 PT Johnstone: Notes on logic and set theory (1987) #87 Judith Roitman: Introduction to Modern Set Theory (1990) #47 Derek Goldrei: Set Theory: For Guided Independent Study (1996) #31 Basic set theory: A Shen, NK Vereshchagin (2002) #14 Ralf Schindler: Set Theory (2014) #13 Foreman, Kanamori: Handbook of Set Theory (2009) #38   Note:  Please feel free to add textbooks to the list, as long as they are not just on a smaller subset of set theory. (Some of the dates might not be the first published edition.) Cryptoclass Throws Error. Invalid private key. Must be 16 bytes. Sending 16 characters long key key__c :- abcdefghijklmnop  public static String decrypt(String data) {     EncryptionSettings__c settings = EncryptionSettings__c.getOrgDefaults();     if (settings.key__c == null) {         throw new FacebookException('Cannot decrypt without a key!');     }     Blob key = EncodingUtil.base64Decode(settings.key__c);     return Crypto.decryptWithManagedIV('AES128', key, EncodingUtil.base64Decode(data)).toString(); }  public static String encrypt(String data) {         EncryptionSettings__c settings = EncryptionSettings__c.getOrgDefaults();     Blob key = null;     if (settings.key__c == null) {         checkUserCanCustomizeApplication();         key = Crypto.generateAesKey(128);         settings.key__c = EncodingUtil.base64Encode(key);         insert settings;     } else {         key = EncodingUtil.base64Decode(settings.key__c);     }     return EncodingUtil.base64Encode(Crypto.encryptWithManagedIV('AES128', key, Blob.valueOf(data))); } How to interpret autocorrelation plot in MCMC I am getting familiar with Bayesian statistics by reading the book Doing Bayesian Data Analysis, by John K. Kruschke also known as the "puppy book". In chapter 9, hierarchical models are introduced with this simple example: \begin{align} y_{ji}   &amp;\sim {\rm Bernoulli}(\theta_j)  \\ \theta_j &amp;\sim {\rm Beta}(\mu\kappa, (1-\mu)\kappa)  \\ \mu      &amp;\sim {\rm Beta}(A_\mu, B_\mu)   \\ \kappa   &amp;\sim {\rm Gamma}(S_\kappa, R_\kappa) \end{align} and the Bernoulli observations are 3 coins, each 10 flips. One shows 9 heads, the other 5 heads and the other 1 head.  I have used pymc to infer the hyperparamteres.  with pm.Model() as model: # define the          mu = pm.Beta('mu', 2, 2)     kappa = pm.Gamma('kappa', 1, 0.1)     # define the prior     theta = pm.Beta('theta', mu * kappa, (1 - mu) * kappa, shape=len(N))     # define the likelihood     y = pm.Bernoulli('y', p=theta[coin], observed=y)      # Generate a MCMC chain     step = pm.Metropolis()     trace = pm.sample(5000, step, progressbar=True)     trace = pm.sample(5000, step, progressbar=True)   burnin = 2000  # posterior samples to discard thin = 10  # thinning  pm.autocorrplot(trace[burnin::thin], vars =[mu, kappa])   My question is regarding the autocorrelation. How shall I interpret autocorrelation? Could you please help me to interpret the autocorrelation plot?    It says as the samples gets further from each other the correlation between them reduces. right? Can we use this to plot to find the optimum thinning? Does the thinning affect the posterior samples? after all, what is the use of this plot? Let $X$ be simply connected and let $ \tau $ be a cycle in $X$. If $ \tau(0)=\tau(1)=x_0$ and $\gamma $ is a path between $x\in X$ and $x_0$, is $\tau$ homologous to $ \gamma\tau\gamma^{-1} $?  I think it is, but I'm not sure about the proof. Can I use the fact that $ \gamma\tau\gamma^{-1} $ is homologous to $ \gamma+\tau+\gamma^{-1} $, where $+$ is the operation between 1-chains (that is abelian)? Role of dependencies while installing software?? What is the role of dependencies while installing any software?I was installing vlc player and it were closed by giving me error something like check dependency .  What is to solution of this and how i'll get these dependencies??  Thanks in Advance. Weak solutions to the Neumann's problem (Evans PDE) Let $U$ be connected. A function $u \in H^1(U)$ is a weak solution   of Neumann's problem   \begin{equation} (*)\qquad\left\{ \begin{array}{rl} -\Delta = f &amp; \text{in } U \\ \frac{\partial u}{\partial \nu} = 0 &amp; \text{on } \partial U \end{array} \right. \end{equation}   if   $$ \int_U Du \cdot Dv \; dx = \int_Ufv \; dx $$   for all $v \in H^1(U)$. Let $f\in L^2(U)$. Prove $(*)$ has a weak solution   if and only if   $$ \int_U f \; dx =0. $$   For the only if part I set $v=1$. However I do not see where to start the if part. I was thinking of the Lax-Milgram theorem. That's where I'm now. Why does a translation matrix need extra row? I've got an iPhone app with icon file Icon.png.  This icon shows up properly when the app is on the phone itself, but it doesn't show up in the applications pane in iTunes.  What do I need to do to get it to show up properly? What levels-up Psi-abilities?