.NET Framework Time complexity in the documentation
Asymptotic complexity of .NET collection classes
Finite groups with exactly one maximal subgroup I am trying to adjust spacing between entries in LoF and LoT. My code is  \documentclass[11pt,a4paper]{book} \usepackage[english,greek]{babel} \setcounter{secnumdepth}{3} \usepackage[iso-8859-7]{inputenc} \usepackage{kerkis} \usepackage[pdftex]{graphicx} \usepackage[margin=2.8cm]{geometry} \usepackage[Glenn]{fncychap} \usepackage{fancyhdr} %!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! \usepackage{tocloft} \setlength\cftparskip{-15pt}%For ToC works great \setlength\cftbeforesecskip{-8pt}%For ToC works great \setlength\cftbeforesubsecskip{-5pt}%For ToC works great \setlength\cftbeforechapskip{-1pt}%For ToC works great \setlength\cftaftertoctitleskip{-50pt}%For ToC works great  % I also tried \renewcommand instead of \setlength \setlength\cftbeforeloftitleskip{-2cm}%It has no effect in LoF \setlength\cftbeforelottitleskip{-5cm}%It has no effect inLoT  \makeatletter \newcommand*{\tocwithouttitle}{\@starttoc{toc}} \makeatother %-------------------------------------------------------------------------------- \makeatletter \newcommand*{\lofwithouttitle}{\@starttoc{lof}} \makeatother %-------------------------------------------------------------------------------- \makeatletter \newcommand*{\lotwithouttitle}{\@starttoc{lot}} \makeatother %-------------------------------------------------------------------------------- %!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! \renewcommand{\cftsecleader}{\cftdotfill{\cftdotsep}}  \begin{document}  %~~~~~~~~~~~~~~~~~~~~~~~Front-Page~~~~~~~~~~~~~~~~~~~~~~~~~~ \begin{titlepage} Εξώφυλλο \end{titlepage}  \chapter*{\contentsname} \markboth{\MakeUppercase{\contentsname}}{\MakeUppercase{\contentsname}} \tocwithouttitle \addcontentsline{toc}{chapter}{Πειρεχόμενα}  %LoF \chapter*{Κατάλογος σχημάτων}%List of Figures \markboth{\MakeUppercase{Κατάλογος Σχημάτων}}{\MakeUppercase{Κατάλογος Σχημάτων}} %\renewcommand\cftbeforeloftitleskip{5pt} %\renewcommand\cftbeforelottitleskip{5pt} \lofwithouttitle %\setlength\cftbeforefigskip{0pt} \addcontentsline{toc}{chapter}{Κατάλογος Σχημάτων}  %LoT \newpage  \chapter*{Κατάλογος Πινάκων} \markboth{\MakeUppercase{Κατάλογος Πινάκων}}{\MakeUppercase{Κατάλογος Πινάκων}} \lotwithouttitle %\renewcommand\cftbeforeloftitleskip{5pt} %\renewcommand\cftbeforelottitleskip{5pt} \addcontentsline{toc}{chapter}{Κατάλογος Πινάκων}  \newpage \end{document}   While some code is working on ToC(See comments in Preamble) I cannot adjust spacing in LoF/LoT. How can this be achieved? If, one fine day, someone found a contradiction in ZFC (or even ZF), what implications would such an event have for mathematicians? Is there currently any backup axiomatic system on par with ZFC that would enable mathematicians to continue pursuing mathematics, should the unthinkable occur? I'm colorizing the header of a table formatted with column -ts $'\t'  Works well without color codes, but when I add color codes to the first line column doesn't properly align the output.  Without colored output it works as expected: printf "1\t2\t3\nasdasdasdasdasdasdasd\tqwe\tqweqwe\n" | column -ts $'\t'  But when adding color on the first line column doesn't align the text of the colored row: printf "\e[7m1\t2\t3\e[0m\nasdasdasdasdasdasdasd\tqwe\tqweqwe\n" | column -ts $'\t'  Observed this behaviour both on Ubuntu Linux and Mac OS X. TexShop will not compile without trashing aux files after every error I have a couple of LaTeX files with the same problem. If I produce an error, fix it, and then try to compile a pdf, I get the following error.  )Runaway argument? {{ ! File ended while scanning use of \@newl@ablel. &lt;inserted text&gt;                 \par l.90 \begin{document}   If I then click on the console or trash my .aux file, it compiles fine. Any thoughts on what is going on and how to prevent this annoying extra step? How can I remove a trailing newline? What is the Python equivalent of Perl's chomp function, which removes the last character of a string if it is a newline? Run TTY script every time I open a GUI terminal Brackets in if condition: why am I getting syntax errors without whitespace? Is there a CSS selector for elements containing certain text? What is the easiest way to duplicate an activerecord record? I want to make a copy of an ActiveRecord object, changing a single field in the process (in addition to the id).  What is the simplest way to accomplish this? I realize I could create a new record, and then iterate over each of the fields copying the data field-by-field - but I figured there must be an easier way to do this. Perhaps something like this:  new_record = Record.copy(:id) Determine device (iPhone, iPod Touch) with iOS Is there a way to determine the device running an application. I want to distinguish between iPhone and iPod Touch, if possible. Why is setTimeout(fn, 0) sometimes useful? I have a repeated composition of functions ${T_n}(z) = {\tau _0} \circ {\tau _1} \circ {\tau _2} \circ  \cdots  \circ {\tau _n}(z)$  By analogy with $\sum\limits_{i = 1}^n {} ,\prod\limits_{i = 1}^n {} ,\bigcup\limits_{i = 1}^n {} ,\bigcap\limits_{i = 1}^n {} ,$ I want to write ${T_n}(z) = \left( {\mathop  \circ \limits_{i = 0}^n {\tau _i}} \right)(z)$ or even ${T_n}(z) = {\mathop  \circ \limits_{i = 0}^n {\tau _i}} (z)$. Can I do this? How do I stop orca from starting up on login? Orca keeps starting up after system starting, and I'm not able to find it in "Startup Applications".  How to stop it? What is the difference between: Rooting, Jailbreak, ROM, Mod, etc.? Best resources to learn bash scripting? When is it best to write "can't" versus writing "cannot"? Are they interchangeable in every situation? SD card partitioning? why? how? No, not like this:    Hear me out!  As Stack Overflow grows, it becomes increasingly ridden with extremely newbie and mediocre questions. It's just natural. The team are fighting hard to keep the crap out, but there are many very basic questions that are okay on their own. They don't deserve to be kicked out* - they are just very, very, very basic and/or localized.   Too much basicness tires users who are interested in discussing more advanced topics.  As has been discussed many times over, the voting system is not suited to identify advanced questions due to what is known as the . A group of people will vote on what they understand, which puts truly expert questions at a natural disadvantage that a democratic voting system can't overcome.  Now, there is a small number of users on Stack Overflow who I, as a user, know share my basic values (like, teaching a man to fish rather than fishing for them); I also know they are experts in their fields. It is safe to assume that what these users regard an interesting question worthy of attention, is likely to be interesting to me as well.      The idea is to introduce an opt-in "follow" mechanism that allows followed users to share what they find interesting, with very little fuss and on a purely opt-in basis.   Allow every SO user to follow any other SO user with a certain minimum rep, say 3000.   To every user who is being followed (or every user), display a new link underneath every question, "Recommend".    Introduce a new filtered view somewhere, named "Recommended". The view will show me all questions that my followed users are recommending.   Whenever I browse a list of questions, highlight those questions that have been recommended by my followed users. (I haven't put much thought into how to implement this graphically - you get the drift.)      I'm not especially fond of social networking, and I think most of it doesn't have a place on SO. But I'm starting to think this specific thing could be the right way to go in order to tell apart expert content from the 10000th dreary "how do I upload a file" question.  This is an entirely opt-in feature - unless I actively follow some users, I will never notice this.   Maybe for a bit of ego-stroking, the profile page can show how many users follow you. Or even who. Everything else would simply be kept under wraps - no publication of follower data in the data dump, no follower leagues or anything like that.      * At least not under current SO rules. Maybe those rules need to be changed - but that is a different discussion. First Order Language for vector spaces over fields I'm attempting to come up with a first order language $L$ that is able to describe vector spaces over fields. I came up with a few sets of nonlogical symbols.  $Rs_L=\{Scal,Vec\}$ where $Scal,Vec$ are unary relation symbols which I interpret to be true or false depending on whether $x$ is a scalar or vector.  Also, $Fs_L=\{+,\cdot,\}$ which are the usual addition and multiplication for both vectors and scalars.  For constant symbols, $Cs_L=\{0,1,0_V\}$, where $0$ and $1$ are regular field scalars for the additive and multiplicative identities, respectively, and $0_V$ is the additive identity for vectors.   Using these, I was able to formulate axioms for scalar multiplication on a given structure, and I define addition between a scalar and a vector to simply always give the 0 vector and define multiplication between two vectors to always be the 0 vector. This gives a theory such that a structure models it if and only if it is a vector space in the regular algebraic sense. It is easy to see that all linear transformations in the algebraic sense are included in the class of homomorphisms (in the logical sense), but I am having difficulty proving they are the only ones in this class.   I suppose I want to show that for any $L$-homomorphism $T$, $T(av+w)=aTv+Tw$ for $a$ a scalar and $v,w$ vectors. Since $T$ is a homomorphism, I see that $T(av+w)=Tav+Tw=TaTv+Tw$, so it would be enough to show that all homomorphisms act as the identity on all scalars? Is there a way to show this, or an extra axiom to include?