Related papers: A canonical tree-of-tangles theorem for structural…

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

Let $\Gamma$ be a compact tropical curve (or metric graph) of genus $g$. Using the theory of tropical theta functions, Mikhalkin and Zharkov proved that there is a canonical effective representative (called a break divisor) for each linear…

We explain the precise relationship between two module-theoretic descriptions of sheaves on an involutive quantale, namely the description via so-called Hilbert structures on modules and that via so-called principally generated modules. For…

We classify the possible ramification data and etale local structure of orders over surfaces with canonical singularities.

We show that every thick subcategory of the singularity category of a complete intersection ring is self dual. We also prove the analogous statement for thick subcategories of the bounded derived category and give applications to the…

It is shown that separation conditions (separation curves) are fundamental objects of separability theory. They are used for the classification of certain clases of separable systems, for the proof of bi-Hamiltonian property and finally…

Weak coalgebra-Galois extensions are studied. A notion of an invertible weak entwining structure is introduced. It is proven that, within an invertible weak entwining structure, the surjectivity of the canonical map implies bijectivity…

We develop a unified framework based on topological crossed modules for various lifting obstructions for $\Gamma$-kernels. It allows us to identify actions, cocycle actions and $\Gamma$-kernels up to their natural equivalence relations with…

A soft tree is an actively studied variant of a decision tree that updates splitting rules using the gradient method. Although soft trees can take various architectures, their impact is not theoretically well known. In this paper, we…

In ``Cohen--Macaulay rings'' Bruns and Herzog define the graded canonical module for $\mathbb{Z}^r$-graded rings. We generalize the definition to multigradings and prove that the canonical module ``localizes''. As an application, we give a…

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

We use intersection theory, degeneration techniques and jet schemes to study log canonical thresholds. Our first result gives a lower bound for the log canonical threshold of a pair in terms of the log canonical threshold of the image by a…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

Let $M$ be a $C$-minimal structure and $T$ its canonical tree (which corresponds in an ultrametric space to the set of closed balls with radius different than $\infty$ ordered by inclusion). We present a description of definable locally…

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

We consider a canonical bundle formula for generically finite proper surjective morphisms and obtain subadjunction formulae for minimal log canonical centers of log canonical pairs. We also treat related topics and applications.

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

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…

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…