Reunion of disjoint stable sets in a graph
Prove that at most $2k+1$ independent sets form the set of vertices of a graph, where $k$ is the maximum degree.
Bootable USB of Ubuntu Minimal CD I want to burn Ubuntu Minimal CD ISO to an old, 1 GB USB thumbdrive. Regular ISO doesn't fit. I already tried Startup Disk Creator and Unetbootin but both failed. I tried installing GRUB and pointing it to boot like this:  insmod part_msdos linux /linux initrd /initrd.gz   but it doesn't work. I also tried dd but I ended up with not bootable drive.  Rufus worked on Windows with the same thumbdrive but I no longer use Windows.  What else can I do? Why won't Mathematica display an answer? Pre-image of a measurable set A is always measurable? How can I wrap text around a bottom-right div? I'm using LyX for technical documentation and want to automate the process of creating PDF files.  Within LyX, I can simply click the button "View PDF (XeTeX)", and LyX performs the whole build process for me: it creates a .tex file, does some bibliography magic, and uses XeTeX to create the final PDF file.  What I'm looking for is a way to call LyX from the command line and get the same result. So far, I've only managed to generate a plain .tex file (using --export-to xetex). However, when I run xelatex on the generated file, it keeps showing errors that don't occur when building using LyX. Is there a way to get LyX to do the work?  My system: Windows 7 64bit, LyX 2.1.0 I'm looking to do a third-party assessment of the false-positive rate of a video classification algorithm. Since I have a lot of video I'm trying to do a power analysis to figure out exactly how much video I need to look through so that it is representative of all the video data at a given confidence interval.  The algorithm flags video sequences that have at least one cat in it, and I'm looking to evaluate the frequency of false positives on a new unlabeled test set. So I have tagged all the video that my algorithm has identified a cat in and now want to sample the tagged video sections and look through them manually to validate my model since looking through all of it would take too long! Note, I'm not looking to refine the model at this point, just assess it.  My null hypothesis is that the FP rate of the sample of video I watch is equal to the FP rate of all the video.   I think I can use this formula to determine the number of video sequences to view:    Here is my question: am I thinking through this formulation correctly? Since my model has a CV false positive rate of ~0.96, I figure I can use that as a reference. Can I use that for the null hypothesis proportion, p0? Or will that be p, the true proportion?    I've been using this online calculator:   I ask because when setting the parameters I have, I'm getting very small sample sizes, like less than 10 sequences to view. That can't be right. I want to turn a photo in a engraving style picture, like  using GIMP and, if possible, then make an SVG out of it with Inkscape.  Can you recommend any filters/tools/plugins/tutorials for this? When certain nationalities of people want to travel in the Schengen zone, they are required to apply for a Schengen visa. This is a straight-forward process for most, but when an applicant has had problems with removals or refusals they may be reluctant to apply because they want to avoid the complexities of serial visa refusals. This reluctance may lead some into wondering how their history can be expunged, and this line of thought inevitably leads to the idea of getting their passport replaced with a new one.  This sounds like a great formula for people who have had prior refusals or removals.  In essence they can become 'reincarnated' as a first-time traveller and hence avoid the unpleasantness of revealing their prior interactions with the Schengen authorities.  The relevant parts of the application form are shown here...    Nothing asks about a prior removal or refusal, and the applicant is left with simple denials for 3 questions in order to present themselves as a first-time traveller.  Assuming the person is happy to set aside the moral issues associated with denying their history, are there any holes to this strategy?  This question is scoped to Schengen visa applications so that it will not be unmanageably broad, but answers from other regimes (particularly the affluent Commonwealth and the USA) are acceptable as long as the main points are relatively consistent with Schengen. Edits on closed posts Should questions or answers on questions that are closed be edited, even if the question is closed and the edit does not change anything about the reason it's closed? Example:  was just edited, which I saw in the review queue. It certainly improves the answer, but since the answer doesn't really have to exist on SE at all (because the question is off-topic), should this edit be made? In my understanding, the only reason that the edit option for a closed question is not greyed out is so that it can be edited to make it comply with the SE rules. Isomorphism between $\Bbb R$ and $\Bbb R(X)$? My questions are:     $1.$ Is there a field morphism $\Bbb R(X) \hookrightarrow \Bbb R$ ?      $2.$ If the answer to $1.$ is "yes", are $\Bbb R$ and $\Bbb R(X)$ isomorphic as fields?   $ $    $ $  For $1.$, here are some comments:   This is true for $\Bbb C$, see . The key point here is the fact that $\Bbb C$ is algebraically closed, of cardinality $2^{\aleph_0}$, and of characteristic $0$. The same argument doesn't work for $\Bbb R$. We can actually find a subfield $F$ of $\Bbb R$ such that $F \cong F(X) \cong F(X,Y) \cong \cdots$, see .  that $\Bbb Q(X)$ does not embed in $\Bbb Q$ (as a field).  This is equivalent to: Is there an injective ring morphism $\Bbb R[X] \hookrightarrow \Bbb R$ ? (By taking the fraction fields).   As for 2. :   They are isomorphic as abelian groups, and actually as $\Bbb Q$-vector spaces. They are not isomorphic as $\Bbb R$-algebras, because they haven't the same transcendence degree over $\Bbb R$. Let's try to see how to construct such a field isomorphism. We could try$^{[1]}$ to find a subset $B$ of $\Bbb R$ such that $\Bbb R = \Bbb Q(B)$ and $C \subsetneq B \implies \Bbb R \neq \Bbb Q(C)$.  The set $B$ must contain transcendental elements, pick such an $x_0 \in B$.  Then $\Bbb R = \Bbb Q(B) = \Bbb Q(B \setminus \{x_0\})(x_0)$ and we could try$^{[2]}$ to find a field isomorphism $\Bbb Q(B \setminus \{x_0\}) \cong \Bbb Q(B)$, so that $\Bbb Q(B \setminus \{x_0\})(x_0) \cong \Bbb Q(B)(x_0) \cong \Bbb R(X)$.  For ${[1]}$, I tried to use Zorn's lemma on $\mathscr B = \{B \subset \Bbb R \mid \Bbb R = \Bbb Q(B)\}$ and the partial order $B_1 ≤ B_2 \iff B_1 \supset B_2$. But this is not clear to me why this should be an inductive set.  For ${[2]}$, my idea was to define $f : \Bbb Q(B \setminus \{x_0\}) \cong \Bbb Q(B)$ by choosing a bijection $b : B \setminus \{x_0\} \to B$ (these sets should be uncountable), and then trying to extend $f\vert_{B \setminus \{x_0\}} = b$ to a field morphism.     Edit for $^{[1]}$: in  article (MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS, by LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RUZICKA) the theorem 2.4. proves that $\Bbb R$ has no minimal generating set as field (or $\Bbb Q$-algebra, i.e. as ring). The argument uses Artin-Schreier theorem. Minimal generating sets of modules are   .  I think that $B$ is a minimal generating set of a subfield $K \subset \Bbb R$ over $\Bbb Q$ if and only if any element of $B$ cannot be written as a rational fraction of other elements of $B$. Under these conditions and using (transfinite) induction, we can probably prove (and this was my first idea) that any function $f: B \to \Bbb C$ such that $b$ and $f(b)$ are conjugate over $\Bbb Q$ (i.e. have the same minimal polynomial) extends to a (unique) field morphism $\sigma : K = \Bbb Q(B) \to \Bbb C$.  Actually, the collection $\mathscr B$ defined above doesn't have to be an inductive set, at least if we replace $\Bbb R$ by $K =\Bbb Q(\sqrt 2, \sqrt[4]{2},\sqrt[8]{2},\dots)$, because the descending chain $\left(E_n = \{\sqrt[2^m]{2} \mid m \geq n\}\right)_{n \geq 1}$ satisfy $K = \Bbb Q(E_n)$, but $K \neq \Bbb Q\left(\bigcap_{n≥1} E_n\right)=\Bbb Q$, so the chain has no upper bound w.r.t. $≤$ in $\mathscr B$. Let $V$ be a representation with character $\chi$.  I would like to have a formula for the characters of the representations $\mathrm{Sym}^m[V]$ and $\wedge ^m[V]$ in terms of $\chi$.  Fulton and Harris presents such a formula for $m=2$, but not for general $m$.  Is there a "nice" such expression?  I found a paper by , but this doesn't seem to be what I'm looking for (it doesn't seem to give a general formula in terms of $\chi$).  In case the link does not work, here is the reference:  X. Zhou, P. Pulay. Characters for Symmetric and Antisymmetric Higher Powers of Representations: Application to  the  Number of Anharmonic Force Constants in Symmetrical Molecules. Journal of Computational Chemistry, Vol 10, Issue 7, (1989). Why are two permutations conjugate iff they have the same cycle structure? lists Ubuntu 4.10 (Warty Warthog) as the first Ubuntu released by Canonical Ltd.  But I wanted to know whether there ever was an Ubuntu 1.x, as in Windows or Mac OS. If yes, is it available somewhere? Replace one Ubuntu with another from USB pen drive Is the Eel immortal? I have strange problem. My Wallch icon is huge. See the screenshot:    I removed XFCE settings and reordered items a little. How can I restore normal Wallch icon size?  Update:  My /usr/share/applications/wallch-nautilus.desktop file:  [Desktop Entry] Version=4 Name=Wallch Comment=Change desktop wallpapers automatically Exec=/usr/bin/wallch %U Icon=wallch Terminal=false Type=Application Categories=Utility;Application; MimeType=inode/directory;  Actions=Change_Wallpaper;Start;  [Desktop Action Change_Wallpaper] Name=Change Wallpaper Once Exec=/usr/bin/wallch --change TargetEnvironmet=Unity  [Desktop Action Start] Name=Start/Stop Wallpapers Exec=/usr/bin/wallch --start TargetEnvironment=Unity   And the /usr/share/pixmaps/wallch.png: Is it possible to have a monoid with a proper class as the collection of elements? My question if it possible for us to have, for example, a monoid(any algebraic structure really) with a class as the collection of the elements, instead of a set.  An example would be the class of sets and set union as addition. Clearly, it is closed under the operation, is associative and it has an identity element, so it is a monoid. Is it possible to say so? Let $\varphi:G\rightarrow H$ be a group homomorphism from group $G$ to group $H$. Show that, if $H$ is abelian, all subgroups of $G$ that contain $\mathrm{ker} (\varphi)$ are normal in $G$. Why does reading a record struct fields from std::istream fail, and how can I fix it? Why do we need to dummy code categorical variables