Searcharxiv⌕ Search

arXiv subjects

Markus Lange-Hegermann

Publications and source records attributed to Markus Lange-Hegermann.

42 records · Page 3Linked to original sources

Characterizing Serre quotients with no section functor and applications to coherent sheaves

We prove an analogon of the the fundamental homomorphism theorem for certain classes of exact and essentially surjective functors of Abelian categories $\mathscr{Q}:\mathcal{A} \to \mathcal{B}$. It states that $\mathscr{Q}$ is up to equivalence the Serre quotient $\mathcal{A} \to \mathcal{A} / \mathrm{ker} \mathscr{Q}$, even in cases when the latter does not admit a section functor. For several classes of schemes $X$, including projective and toric varieties, this characterization applies to the sheafification functor from a certain category $\mathcal{A}$ of finitely presented graded modules to the category $\mathcal{B}=\mathfrak{Coh} X$ of coherent sheaves on $X$. This gives a direct proof that $\mathfrak{Coh} X$ is a Serre quotient of $\mathcal{A}$.

math.CT↗

On the Ext-computability of Serre quotient categories

To develop a constructive description of $\mathrm{Ext}$ in categories of coherent sheaves over certain schemes, we establish a binatural isomorphism between the $\mathrm{Ext}$-groups in Serre quotient categories $\mathcal{A}/\mathcal{C}$ and a direct limit of $\mathrm{Ext}$-groups in the ambient Abelian category $\mathcal{A}$. For $\mathrm{Ext}^1$ the isomorphism follows if the thick subcategory $\mathcal{C} \subset \mathcal{A}$ is localizing. For the higher extension groups we need further assumptions on $\mathcal{C}$. With these categories in mind we cannot assume $\mathcal{A}/\mathcal{C}$ to have enough projectives or injectives and therefore use Yoneda's description of $\mathrm{Ext}$.

math.KT↗

The Differential Dimension Polynomial for Characterizable Differential Ideals

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it decides equality of characterizable differential ideals contained in each other.

math.AC↗

Thomas decompositions of parametric nonlinear control systems

This paper presents an algorithmic method to study structural properties of nonlinear control systems in dependence of parameters. The result consists of a description of parameter configurations which cause different control-theoretic behaviour of the system (in terms of observability, flatness, etc.). The constructive symbolic method is based on the differential Thomas decomposition into disjoint simple systems, in particular its elimination properties.

math.OC↗

Algorithmic Thomas Decomposition of Algebraic and Differential Systems

In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.

math.AC↗

Thomas Decomposition of Algebraic and Differential Systems

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.

math.AC↗