Related papers: More Reduced Obstruction Theories
Using tangent bundle geometry we construct an equivalent reformulation of classical field theory on flat spacetimes which simultaneously encodes the perspectives of multiple observers. Its generalization to curved spacetimes realizes a new…
In this paper we present a novel approach to graph (and structural) limits based on model theory and analysis. The role of Stone and Gelfand dualities is displayed prominently and leads to a general theory, which we believe is naturally…
The goal of these notes is to provide an introduction to rough partial differential equations. For this purpose, we will present the theory of rough paths to the extend as it is required. Applications to stochastic partial differential…
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying…
The formalism which has been developed to give general expressions for the determinants of differential operators is extended to the physically interesting situation where these operators have a zero mode which has been extracted. In the…
The purpose of this note is to give a self contained description of Walls finiteness obstruction.
In this paper we develop the obstruction theory for lifting complexes, up to quasi-isomorphism, to derived categories of flat nilpotent deformations of abelian categories. As a particular case we also obtain the corresponding obstruction…
This note is about variations on a theorem of Bers about short pants decompositions of surfaces. It contains a version for surfaces with boundary but also a slight improvement on the best known bound for closed surfaces.
We develop square zero obstruction theory for modules over $\mathbb{E}_1$-algebras in an arbitrary stable (presentably) monoidal $\infty$-category. We explicitly describe the obstruction element as the homotopy class of a canonically…
In this article we are defining a refinement of Kool-Thomas invariants of local surfaces via the equivariant $K$-theoretic invariants proposed by Nekrasov and Okounkov. Kool and Thomas defined the reduced obstruction theory for the moduli…
We develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a destriction functor and apply it to some well-known biset functors. The obstruction groups for this theory are reduced cohomology…
We give new computable necessary conditions for a class of optimal transportation problems to have smooth solutions.
We describe an obstruction to smoothing stable maps in smooth projective varieties, which generalizes some previously known obstructions. Our obstruction comes from the non-existence of certain rational functions on the ghost components,…
We develop two approaches to obstruction theory for deformations of derived isomorphism classes of complexes $Z^\bullet$ of modules for a profinite group $G$ over a complete local Noetherian ring $A$ of positive residue characteristic…
Given a fibration over the circle, we relate the eigenspace decomposition of the algebraic monodromy, the homological finiteness properties of the fiber, and the formality properties of the total space. In the process, we prove a more…
Recurrent Neural Network, Long Short-Term Memory, and Transformer have made great progress in predicting the trajectories of moving objects. Although the trajectory element with the surrounding scene features has been merged to improve…
We give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
We resurrect a standard construction of analytical mechanics dating from the last century. The technique allows one to pass from any dynamical system whose first order evolution equations are known, and whose bracket algebra is not…
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…