Related papers: Kolmogorov structure functions for automatic compl…
We construct orbifolds with quasitoric boundary and show that they have stable almost complex structure. We show that a quasitoric orbifold is complex cobordant to finite disjoint copies of complex orbifold projective spaces. Finally some…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We describe several infinite series of rational conformal field theories whose conformal characters are modular units, i.e. which are modular functions having no zeros or poles in the upper complex half plane, and which thus possess simple…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
We prove a structure theorem for the Gromov-Witten invariants of compact Kahler surfaces with geometric genus $p_g>0$. Under the technical assumption that there is a canonical divisor that is a disjoint union of smooth components, the…
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of…
This is a survey on formality results relying on weight structures. A weight structure is a naturally occurring grading on certain differential graded algebras. If this weight satisfies a purity property, one can deduce formality. Algebraic…
In this short note we use ideas from systems theory to define a functional calculus for infinitesimal generators of strongly continuous semigroups on a Hilbert space. Among others, we show how this leads to new proofs of (known) results in…
Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of…
As in [5], we study holomorphic maps of positive degree between compact complex manifolds, and prove that any holomorphic map of degree one from a compact complex manifold to itself is biholomorphic. This conclusion confirms that under a…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Most ideas about what an algorithm is are very similar. Basic operations are used for transforming objects. The evaluation of internal and external states by relations has impact on the further process. A more precise definition can lead to…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…
Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.
We define analogues of Verma modules for finite W-algebras. By the usual ideas of highest weight theory, this is a first step towards the classification of finite dimensional irreducible modules. Motivated by known results in type A, we…
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing…
We show that Hopf invariants, defined by evaluation in Harrison cohomology of the commutative cochains of a space, calculate the logarithm map from a fundamental group to its Malcev Lie algebra. They thus present the zeroth Harrison…