相关论文: Descente pour les n-champs (Descent for n-stacks)

We develop the foundations of higher geometric stacks in complex analytic geometry and in non-archimedean analytic geometry. We study coherent sheaves and prove the analog of Grauert's theorem for derived direct images under proper…

Graph Neural Networks (GNNs) have become a standard approach for learning from graph-structured data. However, their reliance on parametric classifiers (most often linear softmax layers) limits interpretability and sometimes hinders…

The distribution of descents in fixed conjugacy classes of $S_n$ has been studied, and it is shown that its moments have interesting properties. Fulman proved that the descent numbers of permutations in conjugacy classes with large cycles…

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

In this paper a method of constructing a semiorthogonal decomposition of the derived category of $G$-equivariant sheaves on a variety $X$ is described, provided that the derived category of sheaves on $X$ admits a semiorthogonal…

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…

We propose a notion of weak (n+k,n)-category, which we call (n+k,n)-Theta-spaces. The (n+k,n)-Theta-spaces are precisely the fibrant objects of a certain model category structure on the category of presheaves of simplicial sets on Joyal's…

The Weil-Kostant integrality theorem states that given a smooth manifold endowed with an integral complex closed 2-form, then there exists a line bundle with connection on this manifold with curvature the given 2-form. It also characterises…

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…

We formalize an abstraction of Grothendieck's philosophy of motives and construct a category of derived motivic spectra in the Segal category $\mathbb{R} \underline{\text{Hom}} ((\text{dSt}_k)^{\text{op}}_{/F}, \text{Top})$ ($\text{dSt}_k$…

In this paper, we first introduce the new class of vertically-recurrent matrices, using a generalization of "the Hockey stick and Puck theorem" in Pascal's triangle. Then, we give an interesting formula for the lower triangular…

In nonsmooth optimization, a negative subgradient is not necessarily a descent direction, making the design of convergent descent methods based on zeroth-order and first-order information a challenging task. The well-studied bundle methods…

We give criteria for certain morphisms from an algebraic stack to a (not necessarily algebraic) stack to admit an (appropriately defined) scheme-theoretic image. We apply our criteria to show that certain natural moduli stacks of local…

Central in entanglement theory is the characterization of local transformations among pure multipartite states. As a first step towards such a characterization, one needs to identify those states which can be transformed into each other via…

We consider the time evolution of a one dimensional $n$-gradient continuum. Our aim is to construct and analyze discrete approximations in terms of physically realizable mechanical systems, called microscopic because they are living on a…

We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a…

Tools to analyze the latent space of deep neural networks provide a step towards better understanding them. In this work, we motivate sparse subspace clustering (SSC) with an aim to learn affinity graphs from the latent structure of a given…

We consider categories of posets with $\mathfrak{C}$-valued structure sheaves for any category $\mathfrak{C}$ and see how they possess poset-indexed lax colimits that are both easy to describe and "weakly equivalent" to their ordinary…

Recent results in the literature suggest that the penultimate (second-to-last) layer representations of neural networks that are trained for classification exhibit a clustering property called neural collapse (NC). We study the implicit…

We present scheme theoretic methods that apply to the study of secant varieties. This mainly concerns finite schemes and their smoothability. The theory generalises to the base fields of any characteristic, and even to non-algebraically…