I propose to make qcqp (10 questions) a synonym of quadratic-programming (34 questions).
quadratic-programming has no usage guidance.
qcqp has: A quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic...
We say that a subset $A$ of $\mathbf Z$ is irreducible if $|A| \ge 2$ and there do not exist $X, Y \subseteq \mathbf Z$ with $|X|, |Y| \ge 2$ such that $A = X + Y$.
If $X \subseteq \mathbf Z$, we denote by $\mathsf L(X)$ the set of all $k \in \mathbf N^+$ such that $X = A_1 + \cdots +A_k$ for s...
specific-questiontitlesClass of lattices that excludes M_3? I would be tempted to edit M_3 to $M_3$ - but perhaps people are purposely avoiding MathJax, so that the question remains in the HNQ list. The question is also missing a top-level tag.
It is well known that a lattice is distributive iff it excludes as a sublattice $N_5$ (the pentagon) and $M_3$ (three unordered elements with a top and bottom). Further, a lattice that only excludes $N_5$ is modular, and consequently a lattice excluding $N_5$ but including $M_3$ is modular but no...
This should be confirmed by mods, but I do not think that the tag was burninate. Moderators can merge tags - in this case ft.factorization-theory was merged into factorization-theory. AFAIK, help from Stack Exchange staff is needed for burnination. (It cannot be done by mods alone.)
We say that a subset $A$ of $\mathbf Z$ is irreducible if $|A| \ge 2$ and there do not exist $X, Y \subseteq \mathbf Z$ with $|X|, |Y| \ge 2$ such that $A = X + Y$.
If $X \subseteq \mathbf Z$, we denote by $\mathsf L(X)$ the set of all $k \in \mathbf N^+$ such that $X = A_1 + \cdots +A_k$ for s...
> A tag, when it's burninated, is removed from all questions that carry this tag. The entire history of the tag is wiped out, with no trace of the tag existing in revision histories. This will just remove the tag from the system, but it can easily be re-created by users with the privilege to.
I will stress that burninantion removes the tag from all posts without bumping any posts (unlike manual retaggin). AFAIK, a tag can be burninated only by Stack Exchange staff (not by mods).
Things which can be done by mods is merging tags - which essentially means that all occurrences of tag1 are replaced by tag2. (Without any bumping - possibly with bumping one question where the tag "tag2" was created.)
> Mods can merge two tags, which removes one of them and replaces all occurrences by the other one. So this works basically as renaming the tag. Some details about merging are explained in this answer.
> For moderators: the actual way to rename a tag is to merge it into a nonexistent tag. Go to the tag page (/questions/tagged/[existing-tag-name]), click the “merge” button, enter the new tag name, and confirm until done.
Anyway, I think I am just repeating things which I have already mentioned here before..
deprecated-tags I will just remind that mods can merge tags without any bumping. So if at some point we will reach the state that all question tagged abstract-algebra are questions where gr.group-theory fits, mods can change the tags without bumping any questions.
deprecated-tags Alternatively a tag could be burninated, which removes all instances of the tag without any bumping. (This cannot be done by mods. However, MO mods sometimes used merging into tag-removed as a replacement.)
I propose to make qcqp (10 questions) a synonym of quadratic-programming (34 questions).
quadratic-programming has no usage guidance.
qcqp has: A quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic...
We say that a subset $A$ of $\mathbf Z$ is irreducible if $|A| \ge 2$ and there do not exist $X, Y \subseteq \mathbf Z$ with $|X|, |Y| \ge 2$ such that $A = X + Y$.
If $X \subseteq \mathbf Z$, we denote by $\mathsf L(X)$ the set of all $k \in \mathbf N^+$ such that $X = A_1 + \cdots +A_k$ for s...
