I had submitted a paper in a reputed journal in more than 2 months back. Upto one month the status was " manuscript is assigned to the editor"  Now, the status of the paper is showing "Awaiting Associate Editor decision". Please, tell what does this status indicates? Is all the reviewers process has been done??
What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.
$(xy + 1)(yz + 1)(zx + 1) $ is a perfect square if and only if each factor is Enroll Apple Developer Program under 18 I've seen a lot of questions like this throughout the web but they're mostly from 2 or 3 years ago, so I decided to ask to have some updated answers.   I'm 16 and I want to start publishing and using the benefits that comes with the Developer Program. In the legal agreement says that I should be over 18, and I'm not so, i can't do it. I've contacted the apple developer support and they told me that I should use a account in my father's name. We reside in Brazil. With that, I had some doubts:   Will the name on the App Store be mine or my father's? In the future, when I'm 18, this account can be transferred to my name?   Besides that, if someone has any advice or (legal) workaround I'd appreciate it, thanks What are the differences in implementing interfaces implicitly and explicitly in C#?  When should you use implicit and when should you use explicit?  Are there any pros and/or cons to one or the other?    Microsoft's official guidelines (from first edition ) states that using explicit implementations are not recommended, since it gives the code unexpected behaviour.  I think this guideline is very valid in a pre-IoC-time, when you don't pass things around as interfaces.  Could anyone touch on that aspect as well? How to disable auto-complete braces in TEXStudio? I want to disable auto-complete for braces in TeXstudio. In its simplest form, when I type {  I do not want it to automatically add a }.  When it does this, many times I end up deleting the brace, which is a hassle.  Also, when I hit Ctrl+I to get into italics mode I don't want it to auto-complete the ending brace either.  I have gone to Options -&gt; Configure TeXstudio... -&gt; Completion -&gt; Show Advanced Options and disabled everything.  But it still auto-completes them.  In case it matters the version I have is TeXstudio 2.8.4. What are the proposed theoretical explanations for the EmDrive? How can I find the location of an icon of a launcher in use? Prove that sequence $ x_{(n+1)}= \frac {a}{1+x_n}$ is convergent to positive root of $x^2+x-a=0,$where $a >0$ and $x_1 >0$ Prove that sequence $$ x_{(n+1)}= \frac {a}{1+x_n}$$ is convergent to positive root of $x^2+x-a=0,$where $a &gt;0$ and $x_1 &gt;0$  we have $$x_{(n+2)}-x_n=\frac{-a(x_{(n+1)}-x_{(n-1)})}{(1+x_{(n-1)})(1+x_{(n+1)})}$$  Hence from this we see behaviour of even terms subsequence and odd terms subsequence  is opposite. how to proceed from there. any hint please iPhone asks 'Trust This Computer' again (I am on macOS 10.14.6 and iOS 12.4)   I am certain that I have trusted my Mac before. Without the latter trust, I can also access the phone in iTunes.   I have tried reset "Location and Privacy" on my phone. Then   When connecting the iPhone with iTunes running, it asks for the trust and I trust it.  Reboot my Mac and the phone asks for another trust.   Is there some known malware mimics system behavior and steal data from an iPhone?  (I do have installed some pir*ted software recently. That's my fault.) Why do corn flakes clump together in milk when stirred? The Cheerios Effect is the name the scientific community has given to this phenomenon. When cornflakes or oats are mixed with milk and stirred, they tend to clump together. Why does this happen? Can physics explain this? Intuitive explanation of unit root How would you explain intuitively what is a unit root, in the context of the unit root test?   I'm thinking in ways of explaining much like I've founded in .  The case with unit root is that I know (little, by the way) that the unit root test is used to test for stationarity in a time series, but it's just it.   How would you go to explain it to the layperson, or to a person who has studied a very basic probability and statistics course?  UPDATE  I accepted whuber's answer as it is what most reflect what I asked here. But I urge everybody that came here to read Patrick's and Michael's answers also, as they are the natural "next step" in understanding the Unit Root. They use mathematics, but in a very intuitive way. Traditional search-as-you-type on newer Nautilus versions Until now I was using a "traditional" version of Nautilus: that that comes with Ubuntu 10.10. Now I'm using 3.6.3, included with Ubuntu 13.04 (most likely any recent version is equivalent for the scope of my question, anyway).  One major difference between the two is the search-as-you-type behavior: in classic versions of Nautilus, when you typed an input, the file with the closest alphabetical match would become the selected one, the eligible files/folders being restricted to the current directory.  The new behavior is to perform an optionally-global search instead.  Can one configure Nautilus to provide the previous functionality ? I'm trying to compute the difference between the output of two awk commands but my simple attempts at it seem to be failing. Here is what I'm trying:  diff $(awk '{print $3}' f1.txt | sort -u) $(awk '{print $2}' f2.txt | sort -u)   This doesn't work for reasons unknown to me. I was under the assumption that $() construct was used to capture the output of another command but my "diff" invocation fails to recognize the two inputs given to it. Is there any way I can make this work.  By the way, I can't use the obvious solution of writing the output of those two commands to separate files given that I'm logged on to a production box with no 'write' privileges. How can I draw a graph like the diagram below? I'm trying, but something is wrong with my code in LaTeX: \begin{asy} pair dynkinMark(real x, real y, string s = &quot;&quot;, pen p = defaultpen, pair B = dir(45)) { if (s != &quot;&quot;) { dot(&quot;$&quot;+s+&quot;$&quot;, (x,y), B, p); }     else { dot((x,y), p); }     return (x,y); }  dynkinMark(0,1, &quot;1&quot;, dir(135)); dynkinMark(0,2, &quot;2&quot;, dir(135)); dynkinMark(0,3, &quot;3&quot;, dir(135)); dynkinMark(0,4, &quot;4&quot;, dir(135)); dynkinMark(7,1, &quot;1'&quot;); dynkinMark(7,2, &quot;2'&quot;); dynkinMark(7,3, &quot;3'&quot;); dynkinMark(7,4, &quot;4'&quot;); path p1 = (0,1)..(2,2.0)..(5,3.5)..(7,4); path p2 = (0,2)..(2,1.2)..(5,2.5)..(7,3); path p3 = (0,3)..(2,2.8)..(5,1.5)..(7,1); path p4 = (0,4)..(2,3.8)..(5,3.5)..(7,2); draw(p1, blue); draw(p2, heavycyan); draw(p3, mediumcyan); draw(p4, lightblue); dot(&quot;$12$&quot;, IP(p1, p2), dir(90), heavygreen); dot(&quot;$13$&quot;, IP(p1, p3), dir(90), heavygreen); dot(&quot;$23$&quot;, IP(p2, p3), dir(90), heavygreen); dot(&quot;$14$&quot;, IP(p1, p4), dir(90), heavygreen); dot(&quot;$24$&quot;, IP(p2, p4), dir(90), heavygreen); real y = 0.8; label(&quot;$s_1$&quot;, (IP(p1,p2).x, y), heavygreen); label(&quot;$s_2$&quot;, (IP(p1,p3).x, y), heavygreen); label(&quot;$s_1$&quot;, (IP(p2,p3).x, y), heavygreen); label(&quot;$s_3$&quot;, (IP(p1,p4).x, y), heavygreen); label(&quot;$s_2$&quot;, (IP(p2,p4).x, y), heavygreen); \end{asy} Let $f,g:X\to Y$ be maps of spaces such that $f\simeq g$. Is it true that the mapping cones $\operatorname{cone}(f)$ and $\operatorname{cone}(g)$ are homotopy equivalent?  Can we write down an explicit homotopy equivalence? It ought not to be too hard to get a map $\operatorname{cone}(f)\to \operatorname{cone}(g)$ from the existence of a homotopy $H:X\times I\to Y$, but I haven't been able to find a sensible candidate, despite trying for quite a while. One whose solution never makes me happy is the following: $$y'(t)=\sin(y+t)\text{.}$$ I would start by substituting $z(t)=y(t)+t$ to get an ODE in $z(t)$, but then I'm not sure about how to substitute back my solution to check if it's correct or not$\dots$ The following is a geometry puzzle from a math school book. Even though it has been a long time since I finished school, I remember this puzzle quite well, and I don't have a nice solution to it.  So here is the puzzle:    The triangle $ABC$ is known to be isosceles, that is, $AC=BC$. The labelled angles are known to be $\alpha=\gamma=20°$, $\beta=30°$. The task is to find the angle labelled "?".  The only solution that I know of is to use the sine formula and cosine formula several times. From this one can obtain a numerical solution. Moreover this number can be algebraically shown to be correct (all sines and cosines are contained in the real subfield of the 36th cyclotomic field). So in this sense I solved the problem, but the solution is kind of a brute force attack (for example, some of the polynomials that show up in the computation have coefficients > 1000000). Since the puzzle originates from a book that deals only with elemetary geometry (and not even trigonometry if I remember correctly) there has to be a more elegant solution. Proving the total number of subsets of S is equal to $2^n$ Student here! Just reading Liebecks Introduction to pure mathematics for fun and I made an attempt at proving the total number of subsets of S is equal to $2^n$.   I realized that the total number of subsets of S is just:  $ \binom{n}{1} + \binom{n}{2} + \cdots + \binom{n}{n} + 1$  And so I put together the cool looking formula  $ \displaystyle \sum_{r=1}^n \frac{n!}{r!(n-r)!} = 2^n - 1$  But I have no clue how to approach proving this formula analytically. Any help?    So if I try a proof by induction:  $\displaystyle \sum_{r=1}^n \frac{n!}{r!(n-r)!} = 2^n - 1$  $\displaystyle \sum_{r=0}^n \frac{n!}{r!(n-r)!} = 2^n$  obviously true for $n = 1$:  $1 + \frac{1}{1!0!} = 2 = 2$  assume true for $n$, I could multiply both sides by $2$?  $\displaystyle 2\sum_{r=0}^n \frac{n!}{r!(n-r)!} = 2^{n+1}$  How could I go about proving that  $\displaystyle 2\sum_{r=0}^n \frac{n!}{r!(n-r)!}  = \sum_{r=0}^{n+1} \frac{(n+1)!}{r!((n+1) - r)!}$ This is Exercise 26 from Chapter V Algebraic Extensions in Lang's Algebra.  $F$ is finite normal extension over $k$ and $f(x)$ is irreducible in $k[x]$. If $f(x)=g(x)h(x)k(x) \in F[x]$ where $g(x),h(x)$ are monic irreducible factors in $F[x]$, I need to show that there exists an automorphism of $F$ which takes $g(x)$ to $h(x)$.  Any hints would be appreciated.  Sending one root to another is okay but how to do that for a collection of roots? Why is the Fisher Information matrix positive semidefinite? show that a distance function is continuous Let $X$ be a metric space with metric $d$. Define $d: X \times X \to \mathbb{R}$, show that $d$ is continuous.  I would like to show that the function is continuous the topology way (since it is a course on topology).   Let $(a,b)$ be a basic open set in $\mathbb{R}$, then $d^{-1}(a,b) = \{(x,y): a&lt;d(x,y)&lt;b\}$. Define $A= \bigcup_{x \in X} B_{b} (x)$, where $B_b (x) = \{y \in X| d(x,y)&lt;b$}. Clearly $A$ is open. Now define $C = \{(x,y):d(x,y)&gt;a \}.$ Essentially I hope that $A \cap C$ is open. But I am stuck in showing that $C$ is open.  Any help please? :)