Example There exist funcoids $latex {f}&fg=000000$ and $latex {g}&fg=000000$ such that $latex \displaystyle ( \mathsf{RLD})_{\mathrm{out}} (g \circ f) \neq ( \mathsf{RLD})_{\mathrm{out}} g \circ ( \mathsf{RLD})_{\mathrm{out}} f. &fg=000000$ Proof: Take $latex {f = {( =)} |_{\Omega}}&fg=000000$ and $latex {g = \mho \times^{\mathsf{FCD}} \left\{…
read moreMy manuscript Connectors and generalized connectedness sent to Topology and its Applications math journal was rejected saying that I have not cited enough articles in order to show that the terminology I introduced and my results are novel, not re-discovery of others’…
read moreMy submission of my Connectors and Generalized Connectedness math article was rejected due a reviewer saying that the author (that is I) must go through the literature and find sources for general connectedness (e.g. Athangelskii+Wiegandt, Castellini, Herrlich, Petz, Preuss, Lowen, …..) That…
read moreI sent my article Connectors and generalized connectedness to a math journal for peer review and publication. This my article however does not address an important facet: It is well known that a set is connected if every function from it to…
read moreI sent the preprint of the article Connectors and generalized connectedness to Topology and its Applications journal. I’m not sure they will classify my article as topological. If not I’ll send to an other journal.
read moreI released the first draft not marked preliminary (that is supposedly readable by mathematicians) of my article Connectors and generalized connectedness. I need yet to little polish it and check for errors to make it a preprint before I’ll send it to…
read moreI updated online draft of the article “Connectors and generalized connectedness” which considers a generalization of topological connectedness, graph connectedness, proximal connectedness, uniform connectedness, etc.
read moreI put online a preliminary draft of my article Connectors and generalized connectedness. This preliminary draft is yet unreadable. The primary reason why I put this unreadable preliminary draft online is that I want to refer to it from this MathOverflow question….
read moreI recently proved the following conjecture (now a theorem): Theorem $latex A\cap^{\mathfrak{F}}\bigcup{}^{\mathfrak{F}}S = \bigcup{}^{\mathfrak{F}} \{ A\cap^{\mathfrak{F}} X | X\in S \}$ for every set $latex A\in\mathscr{P}\mho$ and every $latex S\in\mathscr{P}\mathfrak{F}$ where $latex \mathfrak{F}$ is the set of filter objects on some set…
read moreYesterday I wrote that I next thing which I will research are n-ary funcoids and n-ary reloids. It seems that (n+m)-ary funcoid can be split into a funcoid acting from n-ary funcoids to m-ary funcoids (similarly to (n+m)-ary relation can be split…
read more