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

This is the second of a series of papers outlining an approach to the classification of $\mathcal{N}{=}2$ superconformal field theories at rank 2 via a systematic analysis of their Coulomb branches, mathematically described by special…

Using techniques developed in \cite{KLR}, we verify Sarnak's conjecture for two classes of rank-one subshifts with unbounded cutting parameters. The first class of rank-one subshifts we consider are called {\em almost complete congruency…

We define a new perverse t-exact pullback operation on derived categories of constructible sheaves which generalizes most perverse t-exact functors in sheaf theory, such as microlocalization, the Fourier-Sato transform and vanishing cycles.…

This is the first draft of a book about higher categories approached by iterating Segal's method, as in Tamsamani's definition of $n$-nerve and Pelissier's thesis. If $M$ is a tractable left proper cartesian model category, we construct a…

The goal of these talks was to explain how cohomology and other tools of algebraic topology are seen through the lens of n-category theory. Special topics include nonabelian cohomology, Postnikov towers, the theory of "n-stuff", and…

In this article we develop the cotangent complex and (co)homology theories for spectral categories. Along the way, we reproduce standard model structures on spectral categories. As applications, we show that the invariants to descend to…

Using Nisnevich coverings and a Hilbert stack of stacky points, we prove \'etale d\'evissage results for non-representable \'etale and quasi-finite flat coverings. We give applications to absolute noetherian approximation of algebraic…

Various characterizations are offered of injectivity of the canonical fundamental group homomorphism for a certain class of inverse limit spaces. One application characterizes the existence of a kind of generalized universal cover.

Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and…

Graph classification is a fundamental but challenging issue for numerous real-world applications. Despite recent great progress in image/video classification, convolutional neural networks (CNNs) cannot yet cater to graphs well because of…

For positive integers $k$, $n$, and $g$ with $k\geq2$, we give a closed-form expression for the $k$-th $\mathbb{Z}_2$-zero-divisor cup length $\mathsf{zcl}_k(SP^n(N_g))$ of the $n$-th symmetric product $SP^n(N_g)$ of the closed…

Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…

We consider N=1 supersymmetric U(N), SO(N), and Sp(N) gauge theories, with two-index tensor matter and added tree-level superpotential, for general breaking patterns of the gauge group. By considering the string theory realization and…

In this book chapter, we briefly describe the main components that constitute the gradient descent method and its accelerated and stochastic variants. We aim at explaining these components from a mathematical point of view, including…

In this paper, we develop several techniques for computing the higher G-theory and K-theory of quotient stacks. Our main results for computing these groups are in terms of spectral sequences. We show that these spectral sequences degenerate…

We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Although deep learning models have been successfully applied to a variety of tasks, due to the millions of parameters, they are becoming increasingly opaque and complex. In order to establish trust for their widespread commercial use, it is…

We begin development of a method for studying dynamical systems using concepts from computational complexity theory. We associate families of decision problems, called telic problems, to dynamical systems of a certain class. These decision…

Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…