Combinatorial Derivation
Igor V. Protasov

TL;DR
This paper introduces and explores a combinatorial derivation on groups, analyzing its properties, special subsets, and relationships with topological derivations, providing new insights into group subset structures.
Contribution
It defines the combinatorial derivation $ riangle$, investigates its properties, and establishes connections with topological derivations, offering novel methods for studying group subsets.
Findings
Properties of the combinatorial derivation $ riangle$
Characterization of thin and almost thin subsets
Analysis of $ riangle$-trajectories and their behaviors
Abstract
Let be a group, be the family of all subsets of . For a subset , we put . The mapping , , is called a combinatorial derivation and can be considered as an analogue of the topological derivation , , where is a topological space and is the set of all limit points of . Content: elementary properties, thin and almost thin subsets, partitions, inverse construction and -trajectories, and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
