Related papers: On Conjugates and Adjoint Descent
The distribution of descents in a fixed conjugacy class of $S_n$ is studied, and it is shown that its moments have an interesting property. A particular conjugacy class that is of interest is the class of matchings (also known as fixed…
Riehl and Verity have introduced an "$\infty$-cosmic" framework in which they redevelop the category theory of $\infty$-categories using 2-categorical arguments. In this paper, we begin with a self-contained review of the parts of their…
We develop a theory of descent and forms of tensor categories over arbitrary fields. We describe the general scheme of classification of such forms using algebraic and homotopical language, and give examples of explicit classification of…
In this paper we elaborate a general homotopy-theoretic framework in which to study problems of descent and completion and of their duals, codescent and cocompletion. Our approach to homotopic (co)descent and to derived (co)completion can…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
This paper synergizes the roles of adjoint in various disciplines of mathematics, sciences, and engineering. Though the materials developed and presented are not new -- as each or some could be found in (or inferred from) publications in…
We define a coherent adjunction in a strict $3$-category and we use string diagrams to show that any adjunction can be extended to a coherent adjunction in an essentially unique way.
There appeared not long ago a Reduction Formula for derived Hochschild cohomology, that has been useful e.g., in the study of Gorenstein maps and of rigidity w.r.t. semidualizing complexes. The formula involves the relative dualizing…
We show how to use formal desingularizations (defined earlier by the first author) in order to compute the global sections (also called adjoints) of twisted pluricanonical sheaves. These sections define maps that play an important role in…
We give several algorithms addressing computations of intersections of conjugate subgroups.
Adjoint functor theorems give necessary and sufficient conditions for a functor to admit an adjoint. In this paper we prove general adjoint functor theorems for functors between $\infty$-categories. One of our main results is an…
We introduce a new categorical framework for studying derived functors, and in particular for comparing composites of left and right derived functors. Our central observation is that model categories are the objects of a double category…
For every adjunction of stable $\infty$-categories -- or more generally, in any locally stable $(\infty,2)$-category -- we give a simple procedure for inverting the twist and cotwist functors associated to this adjunction. As a consequence,…
Given an adjoint pair of functors $F,G$, the composite $GF$ naturally gets the structure of a monad. The same monad may arise from many such adjoint pairs of functors, however. Can one describe all of the adjunctions giving rise to a given…
Dirichlet distribution and Dirichlet process as its infinite dimensional generalization are primarily used conjugate prior of categorical and multinomial distributions in Bayesian statistics. Extensions have been proposed to broaden…
This thesis is an exposition of the author's contribution on effective descent morphisms in various categories of generalized categorical structures. It consists of: Chapter 1, where an elementary description of descent theory and the…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect…
In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis. We present generalisations of powerful complexity…
Descent theory (a modern formulation of Fermat's classical method of infinite descent) is a powerful tool in arithmetic geometry. In this article, we reinterpret descent theory through the lens of quotient stacks and apply it in the setting…