Mathematics

Associated with Math.SE; for both general discussion & math qu...
Feb 4 16:44
@Thorgott Sure, but there might be a nice relation with another sequence that also doesn't have a nice closed form
Feb 4 16:41
or do you mean about relations to the OEIS sequences?
Feb 4 16:41
Do you expect anything more than the MSE post you already linked?
Feb 4 16:39
on a post with 2 upvotes
Feb 4 16:39
that's a nice ratio
Feb 4 16:38
how many deleted answers?
Feb 4 16:36
Huh, I wasn't expecting it to be that hard
Feb 4 16:32
reflexivity isn't hard to take into account
Feb 4 16:23
#(Ref+Symm+Transitive) is less than #(Ref+Transitive)
Feb 4 16:22
with a minus sign but yeah, sure
Feb 4 16:21
there are symmetries playing tricks I think
Feb 4 16:20
@SohamSaha but you want more than equivalence relations
Feb 4 16:18
is the idea of the formula to group in connected components, and for each component do the 1<..<n case?
Feb 4 15:55
just to avoid confusion
Feb 4 15:55
Yes I understood, which is why I emphasized that graphs in Desmos are a different mathematical notion than what I meant
Feb 4 15:54
In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called arcs, links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. == Definitions == Definitions in graph theory vary. The following...
Feb 4 15:53
graph means something different here
Feb 4 15:52
to be clear: what I said relied on the assumption that Thor also made, i.e. 1<2<...<n
Feb 4 15:51
drawing the graph should make it clear
Feb 4 15:51
Oh
Feb 4 15:50
if a<a+1<...<b and you can go from b to a, then a, a+1, a+2, ..., b are all equivalent
Feb 4 15:48
then it becomes a combinatorics problem
Feb 4 15:48
depends with which relations, but if you keep 1<2<..<|A| the same approach should work
Feb 4 15:47
This amounts to grouping nodes that are "equivalent"
Feb 4 15:46
Now the question you are asking is what other arrows can I add until I can go from any node to any other
Feb 4 15:45
You can draw a directed graph with nodes 1,2,3 and arrows 1->2 and 2->3
Feb 4 15:45
This is only in this specific case
Feb 4 15:42
1<2<3, 1=2<3, 1<2=3
Jan 31 11:59
looks correct to me but it's been a long time since I last thought about such stuff
Jan 31 11:55
what do you think?
Nov 27, 2024 13:57
of the function $s, t\mapsto (X_1(s,t), X_2(s,t))$
Nov 27, 2024 13:56
@ShaVuklia Looks like the local inverse theorem to me
Nov 24, 2024 22:35
In particular $\frac{P(r)-P(0)}{r P(0)} \in R\otimes_{\mathbb Z}\mathbb Q$ and it is an inverse of $r$
Nov 24, 2024 22:34
@ShaVuklia Let $r$ be in $R$. Then there is a polynomial equation $P(r)=0$ with $P(0)\ne 0$
Nov 14, 2024 11:19
@SoumikMukherjee What about $\mathbb F_{un}$
Nov 14, 2024 11:10
You have the p-adic topology, induced by the p-adic norm $x\mapsto p^{-\nu_p(x)}$, where $\nu_p$ is the p-adic valuation
Nov 14, 2024 11:10
What do you mean by characterization?
Apr 11, 2024 21:43
aaaand it's a draw
Apr 11, 2024 21:33
what a game
Apr 11, 2024 20:50
if they have the same sign
Apr 11, 2024 20:28
only when his buddy eric is playing
Apr 11, 2024 20:07
frfr
Apr 11, 2024 20:05
who are you guys rooting for?
Apr 11, 2024 20:04
Alireza is out right?
Mar 28, 2024 16:13
the inter-universal category
Mar 27, 2024 16:54
not voting is one thing, abstaining completely from political matters is another
Mar 27, 2024 16:54
probably A should start thinking
Mar 27, 2024 16:14
making bad jokes and not getting banned
Mar 27, 2024 16:06
(not)
Mar 27, 2024 16:06
the plural of "moose" is actually "meese"