« first day (2557 days earlier)      last day (516 days later) » 

5:06 AM
@MartinSleziak The tag now contains three questions:
Q: Extent of “unscientific”, and of wrong, papers in research mathematics

ArchieThis question is cross-posted from academia.stackexchange.com where it got closed with the advice of posting it on MO. Kevin Buzzard's slides (PDF version) at a recent conference have really unsettled me. In it, he mentions several examples in what one would imagine as very rigorous areas (e...

Q: Errata database?

user717Some authors do a really great job by collecting errors and comments to their books and putting a list on their websites. I wonder if there is some (perhaps wiki-style) website where errata are collected. Does anybody know?

Q: Is this an error in Loomis and Sternberg?

Robin AdamsIn Loomis and Sternberg's Advanced Calculus section 3.3 Continuity, they make this comment (just before Theorem 3.2, [pp. 128-129 in my copy): A linear map $T : V \rightarrow W$ is bounded below by $b$ if $\|T(\xi)\| \geq b \|\xi\|$ for all $\xi$ in $V$ [...] If $V$ is finite-dimensional, the...

Jan 31 at 22:14, by Martin Sleziak
The tag was created also back in 2016 by Shamisen and removed by Yemon Choi: https://mathoverflow.net/posts/13000/revisions https://mathoverflow.net/posts/42241/revision shttps://mathoverflow.net/posts/11437/revisions https://mathoverflow.net/posts/232351/revisions
This tag was mentioned a few times in this room: chat.stackexchange.com/search?q=errata&room=10243 chat.stackexchange.com/…
The tag (errata) was created back in 2016, but then removed from all four questions. It was created again in January 2020, since then it was used on three questions. — Martin Sleziak 17 secs ago
8 hours later…
1:03 PM
@MartinSleziak The tag now has two questions.
Q: Differential forms on standard simplices via Whitney extension vs diffeological structure

David RobertsThe standard simplices $\Delta^n \subset \{\mathbf{x}\in\mathbb{R}^{n+1}\mid x_0 + \ldots + x_n =1 \} =: \mathbb{A}^n$ carry two natural sorts of smooth differential forms: Those differential forms on the interior of $\Delta^n$ that extend smoothly to a neighbourhood of $\Delta^n$ in $\mathbb{...

Q: When is the quotient of a manifold by a discrete group of diffeomorphisms a diffeological covering space?

HugocitoI was reading An Introduction to Diffeology by Patrick Iglesias-Zemmour and he defines a diffeological covering space as a diffeological fiber bundle with discrete fiber. My question: Consider a manifold $M$ and a discrete subgroup $G$ of $\mathrm{Diff}(M)$ acting on $M$ freely. When is the q...

@MartinSleziak The tag has grown to three questions.
Q: What are Harish-Chandra bimodules used for?

Yellow PigThere are many recent papers on classification of Harish-Chandra bimodules for rational Cherednik algebras and, more generally, non-commutative algebras which are quantizations of symplectic singularities (Losev). What is the meaning of Harish-Chandra bimodules in terms of representation theory o...

Q: Classification of symplectic resolutions

Yellow PigA. Okounkov said, "symplectic resolutions are Lie algebras of the 21st century." Is there a conjecture on the classification of symplectic resolutions? Do Braverman-Finkelberg-Nakajima Coulomb branches give most known examples of symplectic singularities (and do BFN Coulomb branches have explicit...

Q: Coulomb branch varieties and symplectic singularities

Hollis WilliamsI was recently looking at the survey article of Fu on symplectic resolutions which has a number of open questions and conjectures at the end. (I think one of these was existence of a classification of when symplectic singularities admit symplectic resolutions, which is discussed on other MathOve...

@MartinSleziak now has four questions.
Q: Math reviews in "Zentralblatt für Mathematik und ihre Grenzgebiete"

studentIs there a website where i could read/download math reviews appeared in the above Journal? Of course, I guess all the reviews are available on ZBMATH https://zbmath.org/, which is not free for access. Besides, the reviews (before 1990s) on ZBMATH are uploaded as scanned files, not very clear and...

Q: When to start reviewing

B. BischofRecently I had a few papers published, and I suppose in response to this, I received a request from Zentralblatt to be a reviewer. They ask some general questions about what I would feel comfortable reviewing, and if I would be willing to receive papers electronically. My concern about just signi...

Q: Frequency of papers showing academic misconduct among the articles indexed by MathSciNet and Zentralblatt MATH

Stefan KohlAmong the papers indexed by MathSciNet and Zentralblatt MATH, I occasionally have seen papers which consist essentially only of text copied from elsewhere without proper attribution and without adding any significant value. I would be interested whether anyone has an idea what the frequency of su...

Q: Is a free alternative to MathSciNet possible?

Anton Petrunin How could a free (i.e. free content) alternative for MathSciNet and Zentralblatt be created? Comments Some mathematicians have stopped writing reviews for MathSciNet because they feel their output should be freely available. (The Pricing for MathSciNet is not high, but it is not the point....

@MartinSleziak has grown to four questions as well.
Q: What is known about iterated matching as a TSP heuristic

Manfred WeisA fairly wellknown heuristic for TSP that is based on matching is described in the 2003 paper Match twice and stitch: a new TSP tour construction heuristic by Andrew B. Kahng and Sherief Reda. Its basic idea is to generate a vertex-covering collection of even cycles via the union of two edge-disj...

Q: Computational complexity of optimization algorithms using random algorithm theory

MBISA fundamental and undoubtedly much-studied problem is that of determining not only whether or not an optimization algorithm converges to its optimum but also how fast it converges (see a discussion on how to measure this here: https://mathoverflow.net/a/90920/47228). I am interested in whether or...

Q: Algorithm for finding minimally overlapping paths in a graph

Grizz1618I'm curious to find an algorithm that solves the following graph-theory problem. Suppose I have a graph $G(V,E)$ with two disjoint sets of vertices, $V_a$ and $V_b$. My goal is to find paths from every vertex in $V_a$ to every vertex in $V_b$ where the edges in these paths are minimally overlap...

Q: Minimize overlap penalty between paths in graph

Grizz1618Suppose we have a weighted undirected graph $G(V,E)$. We are given the information that $V_a \cap V_b = \emptyset$ and $V_a,V_b \subset V$. We want to find paths from all vertices in $V_a$ to all vertices in $V_b$ given the following conditions: Primary objective: paths minimize the number of ...


« first day (2557 days earlier)      last day (516 days later) »