« first day (2188 days earlier)      last day (2146 days later) » 

Martin Sleziak
Martin Sleziak
10:03 AM
11
Q: Clarifying the usage of (path-length) tag

Martin SleziakThe tag path-length was created about two months ago in the question: Prove that there exists an another path $g$ with the same image as $f$ but length of $g = tL \forall t\in [0,1]$ where $L$ is the length of $f$. Although it has been later removed from this specific question, it was added to se...

discussion tagging
It seems that the outcome of the discussion in meta is that most users of the ones that voted are saying that path-length tag is not needed.
3
A: Clarifying the usage of (path-length) tag

Morgan RodgersI would vote to remove this tag. It is awfully specific; I'm not sure why we would need to have a special tag for (graph-theory) problems concerning path length. Especially since about 90% (anything about finding shortest path) would be covered by adding the (optimization) tag.

Questions which had this tag at some point (and were not deleted) can be found using this query: data.stackexchange.com/math/query/787716/…
I will remove the tag from the 6 question that have it at the moment (and, where suitable, replace by (arc-length)). If somebody checks whether there are some other improvements to how these questions are now tagged, I'd be grateful:
0
Q: Critical path algorithm

JsevillamolIf I want to compute the shortest path between two points in a directed graph, I can use the Dijkistra algorithm. But what if I want to compute the longest path? If the weights on the graph are bounded, then I guess I can use Djkstra to the graph with weights $M-c_i$, where $M = \max_i c_i$. Is...

graph-theory optimization path-length
0
Q: Prove that a length-minimizing path in a metric space is injective

MathManSuppose $(X,d)$ is a metric space with the nearest point property and $a,b \in X$ with $a \ne b$. Suppose there is a path of finite length in $X$ from $a$ to $b$ and let $m$ be the infimum of the lengths of all paths from $a$ to $b$.Then, by Lipschitz reparametrization, there exists a path $g:[0...

metric-spaces lipschitz-functions path-connected path-length
1
Q: Graph theory: path of X cost between two nodes

Jordan MacLachlanI'm looking for a way to, in any given connected, undirected graph, calculate a path between any two nodes with a cost as close as possible to a given value. The example is in this image (sorry, I can't embed images yet): A simple graph Note: the visual length of each edge doesn't exactly ma...

graph-theory algorithms path-connected path-length
1
Q: How many paths of length $n$ with the same start and end point can be found on a hexagonal grid?

SkillzoreGiven this question, what about the special case when the start point and end point are the same? I ask it here instead because I am looking for the mathematical solution to counting these different paths. Another change in my case is that we must move at every step. How many such different path...

combinatorics algorithms permutations random-walk path-length
0
Q: Number of pathways of length n in a grid?

tox123Given a square grid and a point $A:(0,0)$ and another point $B:(n,m)$ (where $n$ and $m$ are both integers), what is the number of pathways ($k$) of length $l$ (a natural number) edges are there between $A$ and $B$? I was experimenting with this on my own, without any sort of proof and found tha...

graph-theory path-length
1
Q: One-dimensional Hausdorff measure of a line segment

Eduardo LongaLet $\mathcal{H}^1$ be the one-dimensional Hausdorff measure in $\mathbb{R}^n$ and let $[uv] = \{ u + t(v-u) : t \in [0,1] \}$ be the segment joining the vectors $u,v \in \mathbb{R}^n$. How do we show that $$ \mathcal{H}^1([uv]) = \Vert u - v \Vert? $$

measure-theory hausdorff-measure path-length
As a side question - what would you think about graph-algorithms tag. Or is using combination graph-theory+algorithms good enough?
If graph-theory isn't specific enough, and with a whole week's questions showing on the first page I think it probably is, then graph-algorithms surely is. — Peter Taylor May 30 at 8:19
Just to clarify what you mean @PeterTaylor - you're suggesting to create a new tag (graph-algorithms)? — Martin Sleziak May 30 at 8:27
No, I'm suggesting that if a more specific tag within graph theory were necessary (which I don't think it is) then graph-algorithms would be preferable to path-length. — Peter Taylor May 30 at 8:46
@PeterTaylor Thanks, at least now understand what you mean. A new tag (graph-algorithm) maybe might be reasonable, since graph algorithms are indeed quite a big topic. They include many other topics, not only algorithms related to path lengths. (In case you reconsider and you decide to propose such tag, maybe you could make a post about it - I am not sure whether it is better to go with a separate question or to make a post in the tag management thread.) — Martin Sleziak May 30 at 8:52
 
 
5 hours later…
Martin Sleziak
Martin Sleziak
3:05 PM
@quid Perhaps the gersgorin vs. gershgorin issue could be resolved. (I am not sure - is it some reason to wait a bit longer to see whether somebody else will add some additional feedback there?)
I agree. If noone objects I'll implement it soon. Ping me if I forget. — quid ♦ May 29 at 15:05
The tag-excerpt and the tag-wiki can be taken from the old version of the tag.
Nov 25 '17 at 17:35, by quid
@MartinSleziak yes, I think it is reasonable. The questions is how to proceed exactly. The creator of the tag will get a badge down the road. I am not sure anybody cares, but in case someone does I do not want to be seen as having grabbed that badge via creating the tag and merging. That is to say, I'd have a preference that somebody else creates the tag. I'll then be happy to merge.
I would guess that taxonomist badge is a non-issue in this case. IIRC regular users cannot create a new tag if a tag with very similar name already exists. (I recall that creating plural of an existing tags was disallowed by the system. In this case, the difference is again just one letter.) So the new tag has to be created by a moderator.
 
 
1 hour later…
Martin Sleziak
Martin Sleziak
4:33 PM
A new tag fubinis-theorem was created, but very promptly removed. The question: Fubini's theorem for sequences.
It seems that tag with the same name was created (and removed) before:
Aug 14 '12 at 13:36, by t.b.
Do we really need all of lebesgue-integral, fubinis-theorem, tonellis-theorem (all of them introduced here?) I think the first one is well covered by measure-theory while I could understand a tag like fubini-tonelli but I don't think it is really useful.
 
 
2 hours later…
Martin Sleziak
Martin Sleziak
6:24 PM
Speaking of the tag-info for Gersgorin/Gershgorin sets:
Apr 18 '17 at 6:18, by Martin Sleziak
Would somebody more knowledge of this topic have a look at gersgorin-sets tag-info. For example, shouldn't it say Pupkov-Solovev instead of Pupkov-Solov?
 

« first day (2188 days earlier)      last day (2146 days later) »