相关论文: Descente pour les n-champs (Descent for n-stacks)
We define and provide some basic analysis of various types of crossed products by semimultiplicative sets, and then prove a $KK$-theoretical descent homomorphisms for semimultiplicative sets in accord with the descent homomorphism for…
A characteristic property of cohomology with compact support is the long exact sequence that connects the compactly supported cohomology groups of a space, an open subspace and its complement. Given an arbitrary cohomology theory of…
We define novel fully combinatorial models of higher categories. Our definitions are based on a connection of higher categories to "directed spaces". Directed spaces are locally modelled on manifold diagrams, which are stratifications of…
This work bridges two important concepts: the Neural Tangent Kernel (NTK), which captures the evolution of deep neural networks (DNNs) during training, and the Neural Collapse (NC) phenomenon, which refers to the emergence of symmetry and…
In this paper, firstly, we introduce a higher-dimensional analogue of hypergraphs, namely $\omega$-hypergraphs. This notion is thoroughly flexible because unlike ordinary $\omega$-graphs, an n-dimensional edge called an n-cell has many…
The central aim of this monograph is to provide decomposition results for quasi-coherent sheaves on the moduli stack of one-dimensional formal groups. These results will be based on the geometry of the stack itself, particularly the height…
We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…
We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…
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…
The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is…
A rack on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is a permutation of $[n]$ such that $f_{(x)f_y} = f_y^{-1}f_xf_y$ for all $x$ and $y$. In 2013, Blackburn showed that the number of isomorphism classes…
In this paper, we construct proper pushforwards and flat pullbacks in Chow groups of coherent sheaf stacks over a Deligne-Mumford(DM) stack. When there is a relative semi-perfect obstruction theory for a DM-type morphism $X \to Y$, $X$ is a…
Graph neural networks (GNNs) have become increasingly popular for classification tasks on graph-structured data. Yet, the interplay between graph topology and feature evolution in GNNs is not well understood. In this paper, we focus on…
We characterize, for every higher smooth stack equipped with "tangential structure", the induced higher group extension of the geometric realization of its higher automorphism stack. We show that when restricted to smooth manifolds equipped…
We look at homotopy-coherent diagrams of spaces (after Segal, Leitch, Vogt, Mather, Cordier) over a Grothendieck site; we call these ``flexible presheaves''. After some preliminary materiel, we define the ``flexible sheaf'' condition. This…
This work is, in part, a generalization of the article by A.A. Bruen ,T.C Bruen and J.M.McQuillan on Desargues Theorem in arXiv:2007.09175[mathCO]July 17,2020. We prove the extension of Desargues theorem in all dimensions, using 4 different…
We establish a convergence theorem for a certain type of stochastic gradient descent, which leads to a convergent variant of the back-propagation algorithm
Starting with a symmetric monoidal adjunction with certain properties, one derives another symmetric monoidal adjunction with the same properties between the respective categories of all V-categories. If one begins with a reflection of a…
We discuss a systematic procedure for categorifying presentable six-functor formalisms. Our main result produces, given the input of a representation of the $\infty$-category of correspondences of an $\infty$-category with finite limits…
The $k$-deck of a graph is its multiset of induced subgraphs on $k$ vertices. We prove that $n$-vertex graphs with maximum degree $2$ have the same $k$-decks if each cycle has at least $k+1$ vertices, each path component has at least $k-1$…