An article about functions taking ordinal number of arguments
I’ve put online this article. It is a rough draft, is incomplete and contains little errors. Nevertheless I hope you’ll enjoy reading it: A New Kind of Product of Ordinal Number of Relations having Ordinal Numbers of Arguments
Circuitoids, a Generalization of Categories
Circuitoids are a generalization of a category where each morphisms has an arbitrary (possibly infinite) number of arguments. Two morphisms are not required to have the same number of arguments. See this manuscript where I first define circuitoids. I haven’t (yet) defined some notion of associativity for circuitoids. This may be a topic of our […]
A proposal for arXiv – managing patches
A famous mathematician Gowers wrote that it is needed “a positive strategy of actually setting up a new system might work rather better” for publishing math articles. In this post I suggest a way for the community to improve quality of self-published (or self-archived as scientists say) articles. I suggest to add the following feature […]
On product of an arbitrary family of funcoids
I previously defined product of two funcoids. Now the description of product of two funcoids is integrated into my article about multifuncoids. In this article I now also define product of an arbitrary (possibly infinite) family of multifuncoids. The article is yet a very rough preliminary partial draft. The relations of my definition of product […]
Polymath problem: Difference of two filters
My open problem first published in this my blog post (about pair-wise equality of four different expressions for differences of two filters) may be considered to be the next polymath problem. Well, I realize that this may problem may be not ideal for polymath, because to approach a solution of this problem not inventing my […]
A draft about multifuncoids
I put online a rough preliminary draft about multifuncoids, a generalization of funcoids. It contains a few definitions, and theorems. Probably the most interesting thing in it is what I call graph-composition of multifuncoids. The draft contains several open problems.
“Upgrading a Multifuncoid” article upgraded
Now my article Upgrading a Multifuncoid is updated. The main change is that it now contains the conjecture “Upgrading a completary multifuncoid is a completary multifuncoid” (see the article for an exact formulation).
My first article is published
My first math article (titled “Filters on Posets and Generalizations”) was recently published in a peer reviewed, open access journal. Why I published my first research article only in the age of 31? See my short autobiography.
Product of two funcoids and product of two funcoids
I’ve put online an article (PDF, a partial draft) where I define product of two morphisms for certain categories. (Such products are pointfree funcoids.) Particularly it is defined product of two funcoids and product of two reloids. It is a more mature version of a draft I put online previously.
Some new theorems
I added the following theorems to Funcoids and Reloids article. The theorems are simple to prove but are surprising, as do something similar to inverting a binary relation which is generally neither monovalued nor injective. Proposition Let $latex f$, $latex g$, $latex h$ are binary relations. Then $latex g \circ f \not\asymp h \Leftrightarrow g […]