On Conjugates and Adjoint Descent
Asaf Horev, Lior Yanovski

TL;DR
This paper introduces an $ abla$-categorical framework for descent along adjunctions and provides a universal formula for counting conjugates up to equivalence, unifying various known results across fields.
Contribution
It develops a general $ abla$-categorical approach to descent and conjugate counting, unifying multiple existing formulas in a broad theoretical framework.
Findings
Unified formula for counting conjugates up to equivalence.
Framework applies to various fields through $ abla$-categorical methods.
Provides a general approach to descent along adjunctions.
Abstract
In this note we present an -categorical framework for descent along adjunctions and a general formula for counting conjugates up to equivalence which unifies several known formulae from different fields.
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
TopicsAdvanced Topology and Set Theory · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
