This is my first time trying to create citations and a bibliography. I have read plenty of information online and watched numerous videos. I still am not sure if I understand it. I am using TexMaker since it is the only software that works well for me.  Following and online guide here is how my main document looks.   \documentclass[11pt, letterpaper]{article} \usepackage[margin=0.5in]{geometry}  \begin{document}  \begin{titlepage} \title{Homework 1: Annotated Bibliography} \author{Author Name} \end{titlepage} \maketitle  Game Theory \cite{test}  \bibliography{anbib} \bibliographystyle{plain}  \end{document}    I created a file called  anbib.bib and placed in the same folder.   @article{test, title={A general theory of equilibrium selection in games},   author={Harsanyi, John C and Selten, Reinhard}, journal={MIT Press Books},   volume={1},   year={1988}, publisher={The MIT Press} }   I try to compile the main file using quickquick build in TexMaker and the title shows up fine. Then I get in the main text Game Theory [?]. Furthermore I do not see a bibliography in my document.  What am I doing wrong? I read somewhere that I can download software called BibTex to make a bibliography document. I cannot find it for download anywhere. Sorry about the formatting. Normally all my code shows up fine in StackExchange. For some reason not so much here.
I've browsed the forums and found a number of posts that have addressed this issue, but none of the solutions seem to work for me. I have the following script that I just copied from the bibtex home page to get familiar with it. Instead of the citation number I get a question mark. I compile using Latex+Bibtex+Latex+Latex+PDFLatex+ViewPDF just as has been previously suggested and the problem persists.   \documentclass[11pt]{article} \usepackage{cite}  \begin{document}  \title{My Article} \author{Nobody Jr.} \date{Today} \maketitle  Blablabla said Nobody ~\cite{Nobody06}.  \bibliography{mybib} \bibliographystyle{plain} \end{document}   My bibliography (Bib.bbl)  @misc{ Nobody06, author = "Nobody Jr", title = "My Article", year = "2006" }    Looking at previous posts one thing that is concerning is that my .bbl looks empty as shown below. Further, I don't have a .blg  \begin{thebibliography}{}  \end{thebibliography}
Can I create script tag by jQuery? Need to understand why my Schengen visa was refused Can commuting matrices $X,Y$ always be written as polynomials of some matrix $A$? Consider square matrices over a field $K$. I don't think additional assumptions about $K$ like algebraically closed or characteristic $0$ are pertinent, but feel free to make them for comfort. For any such matrix $A$, the set $K[A]$ of polynomials in $A$ is a commutative subalgebra of $M_n(K)$; the question is whether for any pair of commuting matrices $X,Y$ at least one such commutative subalgebra can be found that contains both $X$ and $Y$.  I was asking myself this in connection with frequently recurring requests to completely characterise commuting pairs of matrices, like . While providing a useful characterisation seems impossible, a positive anwer to the current question would at least provide some answer.  Note that in many rather likely situations one can in fact take $A$ to be one of the matrices $X,Y$, for instance when one of the matrices , or more generally if its  (so coincides with the characteristic polynomial). However this is not always possible, as can be easily seen for instance for diagonal matrices $X=\operatorname{diag}(0,0,1)$ and $Y=\operatorname{diag}(0,1,1)$. However in that case both will be polynomials in $A=\operatorname{diag}(x,y,z)$ for any distinct values $x,y,z$ (then $K[A]$ consists of all diagonal matrices); although in the example in  the matrices are not both diagonalisable, an appropriate $A$ can be found there as well.   I thought for some time that any maximal commutative subalgebra of $M_n(K)$ was of the form $K[A]$ (which would imply a positive answer) for some $A$ with minimal polynomial of degree$~n$, and that a positive answer to my question was in fact instrumental in proving this. However I was wrong on both counts: there exist (for $n\geq 4$) commutative subalgebras of dimension${}&gt;n$ (whereas $\dim_KK[A]\leq n$ for all $A\in M_n(K)$) as shown in , and I was forced to correct  in the light of this; however it seems (at least in the cases I looked at) that many (all?) pairs of matrices $X,Y$ in such a subalgebra still admit a matrix $A$ (which in general is not in the subalgebra) such that $X,Y\in K[A]$. This indicates that a positive answer to my question would not contradict the existence of such large commutative subalgebras: it would just mean that to obtain a maximal dimensional subalgebra containing $X,Y$ one should in general avoid throwing in an $A$ with $X,Y\in K[A]$. I do think these large subalgebras easily show that my question but for three commuting matrices has a negative answer.  Finally I note that  to the cited MO question mentions a result by Gerstenhaber that the dimension of the subalgebra generated two commuting matrices in $M_n(K)$ cannot exceed$~n$. This unfortunately does not settle my question (if $X,Y$ would generate a subalgebra of dimension${}&gt;n$, it would have proved a negative answer); it just might be that the mentioned result is true because of the existence of $A$ (I don't have access to a proof right now, but given the formulation it seems unlikely that it was done this way).  OK, I've tried to build up the suspense. Honesty demands that I say that I do know the answer to my question, since a colleague of mine provided a convincing one. I will however not give this answer right away, but post it once there has been some time for gathering answers here; who knows somebody will prove a different answer than the one I have (heaven forbid), or at least give the same answer with a different justification. Using property() on classmethods I have a class with two class methods (using the classmethod() function) for getting and setting what is essentially a static variable.  I tried to use the property() function with these, but it results in an error.  I was able to reproduce the error with the following in the interpreter: class Foo(object):     _var = 5     @classmethod     def getvar(cls):         return cls._var     @classmethod     def setvar(cls, value):         cls._var = value     var = property(getvar, setvar)  I can demonstrate the class methods, but they don't work as properties: &gt;&gt;&gt; f = Foo() &gt;&gt;&gt; f.getvar() 5 &gt;&gt;&gt; f.setvar(4) &gt;&gt;&gt; f.getvar() 4 &gt;&gt;&gt; f.var Traceback (most recent call last):   File &quot;&lt;stdin&gt;&quot;, line 1, in ? TypeError: 'classmethod' object is not callable &gt;&gt;&gt; f.var=5 Traceback (most recent call last):   File &quot;&lt;stdin&gt;&quot;, line 1, in ? TypeError: 'classmethod' object is not callable  Is it possible to use the property() function with @classmethod decorated functions? I am a newbie in linux and I don't know how to open the Ubuntu Software Center via Terminal!! Please help How long will it take for Google's disavow tool to work? I had updated the disavow list on March 18th  with spammy domains which were linked to my site. Those links still show up in Google Search Console.  I Wanna know how long does it need to take effect? Expandably change letter case and use inside \csname, without a package I want to change the letter-case of a single character argument, and use that changed letter inside a \csname.  And I want to do it without an additional package.  For example, I want to pass a macro the letter {S}, and have it execute the macro \csname macros\endcsname, or pass it the letter {T}, and have it execute the macro \csname macrot\endcsname.    In my MWE, I show three approaches:   I didn't expect \lowercase to work, since I recall reading that it is not truly expanded until the last possible moment.  Surprisingly, it goes into an \edef okay, but it must not be truly expanded, because it breaks the \csname. I also formulated an approach where I used \numexpr to add 32 to the ASCII code of the argument and perform a \char upon that result.  Like \lowercase, it gives the appearance of being expandable, but it also fails inside the \csname. I finally achieve success with the stringstrings package.  Having written the package, I know the conversion was not pretty... essentially, it is an exhaustive 26-fold check of the form \if #1Aa\else\if #1Bb\else\if #1Cc\else...\fi\fi\fi, which has the virtue that it can be expandably placed into an \edef, and so it works.   There has to be a better way.  The MWE works only because I use the inefficiently calculated \tmp from METHOD 3 inside the \csname.  If I use \tmp from either of the two earlier methods, it breaks.  \documentclass{article} \usepackage{stringstrings} \def\macros{Expandably converted an S to a s} \def\macrot{Expandably converted a T to a t} \newcommand\convert[1]{%   %MAKE THE ARGUMENT LOWER CASE   1) LOWERCASE\\   \edef\tmp{\lowercase{#1}}% PRETENDS TO EXPAND, BUT FAILS IN \csname   Here is the ``expanded'' conversion: \tmp\\   % OR   2) ASCII CONVERSION\\   \edef\tmp{\expandafter\char\numexpr`#1+32\relax}% PRETENDS TO EXPAND, BUT FAILS IN \csname   Here is the ``expanded'' conversion: \tmp\\   % OR   3) STRINGSTRINGS PACKAGE\\   \caselower[q]{#1}\def\tmp{\thestring}% WORKS BUT USES A PACKAGE   Here is the ``expanded'' conversion: \tmp\\   %   Now use it in a csname: \csname macro\tmp\endcsname% } \begin{document} \convert{S}\par \convert{T} \end{document}       SUMMARY OF ANSWERS:  I have added egreg's code snippets into this MWE to produce a document (and not just terminal output), showing the methods put forth to this point:  \documentclass{article}  %%%%%%%%%%%%%%%%%%%%%%%%%%%% L3 APPROACH  \usepackage{expl3}  \ExplSyntaxOn \cs_set_eq:NN \Xexplower \tl_expandable_lowercase:n \ExplSyntaxOff  %%%%%%%%%%%%%%%%%%%%%%%%%%%% EGREG'S LESS HACKY SOLUTION  \def\explowerchar#1{%   \ifcase\numexpr`#1-`A\relax    a\or b\or c\or d\or e\or f\or g\or h\or i\or j\or k\or l\or m\or    n\or o\or p\or q\or r\or s\or t\or u\or v\or w\or x\or y\or z\else    #1\fi }  \def\explower#1{%   \doexplowerchar#1\relax }  \def\doexplowerchar#1{%   \ifx#1\relax   \else     \explowerchar{#1}\expandafter\doexplowerchar   \fi }  %%%%%%%%%%%%%%%%%%%%%%%%%%%% STEVE'S HACKY PACKAGE APPROACH  \usepackage{stringstrings}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%  \def\macros{Expandably converted an S to a s} \def\macrot{Expandably converted a T to a t}  \begin{document}  \textbf{Steve's hacky approach}  \caselower[q]{S}\csname macro\thestring\endcsname\par \caselower[q]{T}\csname macro\thestring\endcsname  \textbf{egreg's less hacky approach}  \edef\lcstring{\explowerchar{S}}\csname macro\lcstring\endcsname\par \edef\lcstring{\explower{T}}\csname macro\lcstring\endcsname  \textbf{L3 approach}  \edef\lcstring{\Xexplower{S}}\csname macro\lcstring\endcsname\par \edef\lcstring{\Xexplower{T}}\csname macro\lcstring\endcsname  \end{document} "It's cold today" -- what term do linguists use to call "it" when it's used as the subject of a sentence, but has no real antecedent? lsusb relevant output Bus 001 Device 006: ID 0bda:8812 Realtek Semiconductor Corp. RTL8812AU 802.11a/b/g/n/ac WLAN Adapter  Upon plugging the device it is recognized by lsusb, however when I go to wireless settings no adapter is recognized. The driver is installed (by going to software and updates -> addition drivers and selecting the open source driver). A post here on DBA.StackExchange () has spawned an interesting question (at least, interesting to me) regarding performance in MySQL.  The context is that we want to insert a record in a table for each row that is updated.  Before the row is updated, we want to store off a previous value and then increment one of the columns (a "version" column).  If we do this inside a trigger, it works out nicely.  For MySQL, the triggers are , so it would be an easy solution.  Select the data currently in the table, insert it into the logging table, and the update the "version" column in the new data.  However, it's possible to move this logic to a stored procedure. If you do that, you're performing the insert, then incrementing the "version" column in the table.  The entire thing would be set based.   So, when it comes to performing this insert, would this be more performant to use the set-based stored procedure approach or a trigger based approach?  This question is for MySQL (since it has row-by-row triggers), although it could apply to other row-by-row trigger DBMSs. I have a Canon 550D with 70-200 f4 and 50mm prime lenses. Although the camera has built-in 9 focal points, I sometimes face a strange problem. Here's a sample photo:    In reference to the above pic, you can see that both of the faces are NOT in focus. I used 70-200 f4 for this shot at max aperture. Still, I couldn't get both of them in focus. Why? I also try decreasing the aperture to attain a greater DoF but still, I couldn't get both of them into focus.  Another thing: Although the cam has 9 focal points, why can't I use all of them to focus, say, 9 points in a portrait shot? In manual mode, it has the option to select one of the 9 focal points. And in auto mode, it sometimes select more than one focal points.  This is just an example image. I've faced this problem zillions of times. Well, I'm trying to find the Thevenin equivalent of this circuit:    As you can see, the only current source is a dependent source. However, the control variable is in a wire where, if nothing is connected between A and B, is \$i_\Delta = 0\$ A, and that makes the source 0 A. However, if I connect an impedance \$Z\$ to the circuit, I will have current, and a Thevenin equivalent. I don't know how to solve this problem. I've bee searching here for a while, and I found this:   . I can see how is solved that case. However, I still don't know how to apply that method to my circuit.  Any help about finding the Thevenin equivalent is appreciated n.n Show that the series $\sum\limits_{n=2}^{\infty} \frac {(n^3+1)^{1/3}-n}{\log n}$ converges I have seen this construct in scripts a lot and used it myself, but it bothers me that I can't seem to find it in the documentation.  Example:  [ -f file1 ] &amp;&amp; [ -f file2 ] &amp;&amp; echo "Both files exist." || echo "One or the other file doesn't exist."   This could also be done with backslashes before the newlines, as mentioned in man bash:  If a \&lt;newline&gt; pair appears,  and  the  backslash  is  not itself  quoted,  the \&lt;newline&gt; is treated as a line continuation (that is, it is removed from the input stream and effectively ignored).   Example:  [ -f file1 ] &amp;&amp; \ [ -f file2 ] &amp;&amp; \ echo "Both files exist." || \ echo "One or the other file doesn't exist."   ...but this doesn't seem to be necessary.  The first version above works even without the backslashes.  Where can I find this in man bash?  (Also, is this bash specific or POSIX compliant?) Suppose $\lim \limits_{n \to ∞} a_n=L$. Prove that $\lim\limits_{n \to ∞} \frac{a_1+a_2+\cdots+a_n}{n}=L$ Is the closure of path-connected set path connected? Wikipedia introduces the vector product for two vectors $\vec a$ and  $\vec b$ as $$ \vec a \times\vec b=(\| \vec a\| \|\vec b\|\sin\Theta)\vec n $$ It then mentions that $\vec n$ is the vector normal to the plane made by $\vec a$ and  $\vec b$, implying that $\vec a$ and  $\vec b$ are 3D vectors. Wikipedia mentions something about a 7D cross product, but I'm not going to pretend I understand that.  My idea, which remains unconfirmed with any source, is that a cross product can be thought of a vector which is orthogonal to all vectors which you are crossing.  If, and that's a big IF, this is right over all dimensions, we know that for a set of $n-1$ $n$-dimensional vectors, there exists a vector which is orthogonal to all of them.  The magnitude would have something to do with the area/volume/hypervolume/etc. made by the vectors we are crossing.  Am I right to guess that this multidimensional aspect of cross vectors exists or is that last part utter rubbish? Random operators Let $(\Omega, \mathcal F,P)$ be a probability spaces and $H$ be a Hilbert space. By a random operator $A$ from $H$ to $H$ we mean a linear continuous mapping from $H$ into the Frechet space $L_0^H (\Omega, \mathcal F,P)$ of all $H$-valued random variables. My question is: How Can we define $|A|$ and the adjoint $A^*$? $n^2 + 3n +5$ is not divisible by $121$ Question:  Show that $n^2 + 3n + 5$ is not divisible by $121$, where $n$ is an integer. Query Feature and Usage based entitlements license