Status of submitted paper changed - why? Two months ago, I submitted a (mathematical) paper to a journal. On the journal's website, there is a status concerning the paper, e.g. "Rejected", "Awaiting reviewer selection" and so on.  About two weeks ago, the submitted paper's status was "Awaiting reviewer assignment", and then it changed to "Awaiting reviewer selection". This seems more like a backtrack in terms of statuses rather than a step forward to get the paper reviewed (correct me if I'm wrong).  Now my question is:  What could be the reason for that step back in terms of statuses?  (I always thought that if somebody declines to review the paper for some reason, then it will be rejected?)
What does the typical workflow of a journal look like? 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.
Let $\mathbb{F}_{27}$ denote the finite field of size 27. For each $\alpha\in\mathbb{F}_{27}$ , define $ A_{\alpha}$ $=$ { $ 1, 1+\alpha , 1+\alpha+{\alpha}^2 , 1+\alpha+{\alpha}^2+{\alpha}^3 , .... $} . Then  prove that  the number of  $\alpha\in\mathbb{F}_{27}$ such that $|A_\alpha|$=26 equals 12.  $ 0\in A_\alpha $ if and only if $\alpha\neq 0$ For the first proof , the multiplicative group of the field $\mathbb{F}_{27}$ is cyclic and its order is 26  , so there are 12 generators in that group.   Now  I need  to  show  that  $ 1+\alpha+{\alpha}^2+.. {\alpha}^{25} $ =0  , where order of $\alpha$=26 . Since   $\alpha ^{26}$ =1 ($\alpha$-1)(1+$\alpha$+${\alpha}^2$+...+${\alpha}^{25}$)=0 , since $\alpha\neq 1$  , So $ 1+\alpha+...+{\alpha}^{25} $ =0 My question is , can I write these last two  lines?  I mean are those two lines alright to write? If those two lines are invalid then I need some help to show  $ 1+\alpha+{\alpha}^2+..+{\alpha}^{25} $=0  .Thanks Given a compact Hausdorff space $X$, if $a \in X$ is a $G_\delta$ singleton (i.e., $\{ a \}$ is a $G_\delta$ set), then there is a countable local base at $a$.   The point $a$ can be written as countable intersection of open sets let's call $U_{n}$.  How can I use the compactness? What is the next step for proof? Could you give me hint please? If $a_n$ is a strictly increasing unbounded sequence, does $\sum_n \frac{a_{n+1} - a_n}{a_n}$ diverge? So I've been thinking through some test cases. If $a_n = n$ then $\sum_n \frac{a_{n+1} - a_n}{a_n}$ is the harmonic series which diverges. And if $a_n = \sum_{k=1}^n 1/k$ then $\sum_n \frac{a_{n+1} - a_n}{a_n}$ diverges like $\sum_n 1/(n \log n)$. So that got me thinking, if $a_n$ is a strictly increasing unbounded sequence, does $\sum_n \frac{a_{n+1} - a_n}{a_n}$ necessarily diverge? I've got a road bike with brake lever shifters, and it's developed a small problem with age: sometimes, the shifter doesn't catch the first time or two I push it. It'll move easily, with no resistance, since it's not actually pulling on the cable, then after a few tries, catch and work normally. The colder the temperature, the more often this happens.  I don't know how the mechanism works internally, so I'm curious what would cause this, and also whether it's (as I suspect) gradual wear of some part of the mechanism, and if it's likely to fail catastrophically, or gradually worsen. How can I make a Random Number Generator with vanilla redstone? Which is the recommended way to plot: matplotlib or pylab? My desktop look is empty so all I have is a nice wallpaper. My Windows taskbar has the "Taskbar Appearance" setting to "Auto-hide the taskbar". Although hidden, it leaves a thin top layer so you can still see it a bit, and where the pinned shortcuts are. Is it possible to totally have it hidden without a trace? This is a serious question. It really bugs m. How to configure Micromax 352g USB Modem? I want the driver software for my Micromax 352g USB modem for Ubuntu 12.04 LTS. On Ubuntu 10.04 sakis3g was working well, but it is not working on Ubuntu 12.04 LTS. "This question is not available, it may have been deleted" when submitting a question on the Android app after losing internet connection I own a 2016 Macbook (with the USB-C charging) - at the time and in response to all of the reports of poor cables and poor chargers, I bought a meter so I could see what the throughput of my cables/chargers was. However, having run some tests I'm now not sure what to consider normal / what is harmless to the battery.   For all tests I used an original Apple C-C cable - though was able to replicate with two third party cables I own.  I have the original Apple block charging at 14.3 V / 1.99 A and a third party block that charges the same.  Another third party block which advertises USB PD and 3 A is currently charging at 20 V / 1.43 A  I've done some research online but I can't find any articles that indicate what a normal USB PD output is relative to the devices that connect to it and would appreciate any guidance / assistance.   TL;DR: Have Apple charger which charges at one voltage/amperage. Bought several others advertised at PD which are higher voltage, lower amperage. Not sure what is 'safe', or 'fast', or does least overall damage to battery. Prove universal morphism is unique up to unique isomorphism. I'm following along Wikipedia page() on universal property, and this seems it should be trivial, but I couldn't finish the proof.  The definition I am working with:   The problem   So I want to prove that if $(A, u)$ and $(A', u')$ are universal morphism from $X$ to $F$, then there exists unique isomorphism $k: A \rightarrow A'$ such that $u' = F(k) \circ u$.   My attempt:   For any $B \in C$ and $f: X \rightarrow F(B)$, there exists unique $h: A \rightarrow B$ such that $f = h \circ u$.  Letting $B = A'$ and $f = u'$, we see that there exists unique $k: A \rightarrow A'$ such that $Fk \circ u = u'$.  This shows existence and uniqueness. We only need that $k$ is isomorphism, but this is the part I cannot prove.   Similarly, there exists unique $k': A' \rightarrow A$ such that $Fk' \circ u' = u$.  Plugging into each equation, we get  $$Fk \circ Fk' \circ u' = F(k \circ k') \circ u' = u'$$  $$Fk' \circ Fk \circ u = F(k' \circ k) \circ u = u$$  but this of course doesn't imply $F(k \circ k') = id$, so it seems useless.   Thanks for your help! Hilbert, Gödel, and "God equations" - a 19th century lesson for 21st century physicists? It seems there are a lot of respected physicists appearing on pop-sci programs (discovery channel, science channel, etc.) these days spreading the gospel of   Three examples, quickly: 1) Many programs feature Michio Kaku saying that he is on a quest to find an equation, "perhaps just one inch long," which will "describe the whole universe."  2) Max Tegmark has come out with  in which he expresses the gut feeling that "nothing is off-limits" to science.  The subtitle of this book is My Quest for the Ultimate Nature of Reality.  3) In the series  there is talk about a search for the "God equation."  (A good counter-example would be Feynman, but his self-described "non-axiomatic" or "Babylonian" approach does not seem popular with physicists today.)  Is there any sense among physicists that it might be impossible to articulate the "ultimate nature of reality" in equations and formal logic?  It seems to me that physicists are following in the footsteps of the 19th century mathematicians (led by Hilbert) who were on a similar quest which was put to rest by Gödel's incompleteness theorems in 1931.  Is there any appreciation for how the Incompleteness Theorems might apply to physics?  Has any progress been made on  for the 20th century?  Shouldn't this be addressed before getting all worked up about a "God equation?" How do you generate dynamic (parameterized) unit tests in Python? Read columns from file, then column into an exsisting csv file Essentially, I have a csv file that contain multiple columns, called cols.csv  1,a,100 2,b,200 3,c,300 4,e,400   and I have a new csv file that has one column, called col.csv  f g h i   I want to copy the items in col.csv and append them to the end of each line in cols.csv so that, cols.csv now contains those  1,a,100,f 2,b,200,g 3,c,300,h 4,e,400,i   is that possible at all? i tried join, paste, nothing worked Is there a direct download link with a raw data dump of Stack Overflow? (not a torrent) I would like to create a local MySQL copy of Stack Overflow for academic purposes (school project). As far as I know, the database dump of the  database is available only in an XML format that I will have to convert to SQL on my own with some tool.  Most of direct download links I found were broken (404). The only non-torrent source that I have found and that is still alive is  but the latest Stack&nbsp;Overflow dump there is from October 2009, content of which looks like this:    Where could I find a direct download link with the Stack&nbsp;Overflow dump?    Note: I am not able to use torrents due to network policies, yet for the completeness of this question, here's the link that might help someone:    Other related questions / links that haven't helped me:     ~ all links there give 404  ~ from September '09 with another broken link  ~ from about a year ago with a clearbits.net link  ~ also not working anymore $k$ times's draw from $n$ numbers with replacement, each number at least appear once Sample $k$ times with order from $n$ distinct numbers with replacement where $k\ge n$. Here "with order" means the sample is treated like a sequence rather than a set, so results like "1,3,3" and "3,1,3" are different.  The question is what is the probability that every number is sampled at least once? My answer is $1-\frac{{\sum\limits_{i = 1}^n {C_n^i\times i! \times {{(n - i)}^k}} }}{{{n^k}}}$ where $C_n^i$ denotes $n$ chooses $i$.  ${C_n^i\times i! \times {{(n - i)}^k}}$ means first choose $i$ ($i=1,2,...,n-1$) of numbers not to appear in the sample, and then we sample from the remaining $n-i$ numbers for $k$ times.   My question is, is there more elegant solution where the numerator can be directly computed? i.e. can we directly calculate the number of possible sample sequences in which every number has at least one occurrence? Thank you!    PS: my attempt was $C_k^n\times n!\times n^{n-k}$, meaning that we first choose $n$ positions in the sequence of length $k$ to place $n$ numbers, and then permute the $n$ numbers. This is to ensure every number to appear once. The remaining $n-k$ are sampled from the $n$ numbers without restriction.   However, I later found this seems not correct, and it counts the same sequence multiple times.  PS2: as pointed out in the comments, my first answer "1- ..." is not correct either. How to increase the signal power of a wi-fi card? I use an atheros card that requires ath9k driver. Are there any tools that can be used to increase the signal power of the wi-fi card? Why are year, pound and mile in the singular form in the phrases below?   five-year-old children  20 pound note 10 mile run   Is that because they're acting as adjectives, which are always invariable in English?  Is it incorrect to say...   five-years-old children? 20 pounds note? 10 miles run? Why wget doesn't verify SSL certificates? I have a problem with my Fedora 8 installation. It looks that wget doesn't know how to verify SSL certificates any more. It's strange because I have another Fedora 8 box which I believe has the same configuration and it works!   How can I make it work without using --no-check-certificate switch?  This is a sample output:  wget https://www.google.com --2011-09-23 00:11:13--  https://www.google.com/ Resolving www.google.com... 74.125.230.146, 74.125.230.147, 74.125.230.148, ... Connecting to www.google.com|74.125.230.146|:443... connected. ERROR: cannot verify www.google.com's certificate, issued by `/C=ZA/O=Thawte Consulting (Pty) Ltd./CN=Thawte SGC CA':   Unable to locally verify the issuer's authority. To connect to www.google.com insecurely, use `--no-check-certificate'. Unable to establish SSL connection.   EDIT  I have this file /etc/pki/tls/certs/ca-bundle.crt file and when I run wget with --ca-certificate switch pointing to this file everything goes fine. Where should this file be placed so that I don't need to use the switch?  BTW: curl and links work fine, but lynx also complains: "SSL error:unable to get local issuer certificate" so this is not only wget's issue... I'm using python\pyodbc and would like to access the second result set of a stored procedure. As near as I can tell, pyodbc does not support multiple result sets. Additionally, I can't modify the stored procedure. Are there any options to access the second result set using SQL or some other work-around? Perhaps create a second stored procedure that only returns the second result set of the first?