Related papers: Iterative Desingularization
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of…
Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…
The definition of a pseudo-dualizing complex is obtained from that of a dualizing complex by dropping the injective dimension condition, while retaining the finite generatedness and homothety isomorphism conditions. In the specific setting…
This article is first in a series of papers where we reprove the statements in constructing the Enhanced Operation Map and the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem regarding constructing…
We introduce a notion of join for (augmented) simplicial sets generalising the classical join of geometric simplicial complexes. The definition comes naturally from the ordinal sum on the base simplicial category $\Delta$.
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
In this paper we classify endofunctors on the simplex category, and we identify those that induce weak equivalence preserving functors on the category of simplicial sets.
We establish a criterion for determining when a family of geometric functors is jointly conservative through the lens of purity in compactly generated triangulated categories. We introduce the notion of pure descendability and we apply it…
We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…
The simplicial extension of any functor from Sets to Sets which commutes with directed colimits takes weak equivalences to weak equivalences. The goal of the present paper is construct a framework which can be used to proof results of this…
We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.
We identify the obstructions for the functoriality and the uniqueness of the totalization functor, (partially) defined on the category of simplicial objects in the homotopy category of a stable model category, and we use a result from the…
Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets. In this paper, nominal sets are related to nominal renaming sets, which…
We develop a symbolic computational approach to classifying low-rank modular categories. We use this technique to classify pseudo-unitary modular categories of rank at most 5 that are non-self-dual, i.e. those for which some object is not…
We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
To a function with values in the power set of a pre-ordered, separated locally convex space a family of scalarizations is given which completely characterizes the original function. A concept of a Legendre-Fenchel conjugate for set-valued…