Related papers: Morphic Sequences: Complexity and Decidability
Log-symplectic structures are Poisson structures that are determined by a symplectic form with logarithmic singularities. We construct moduli spaces of curves with values in a log-symplectic manifold. Among the applications, we classify…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
One can define the complexity of a smooth 4-manifold as the minimal sum of the number of disks, strands and crossings in a Kirby diagram. Martelli proved that the number of homeomorphism classes of complexity less than n grows as $n^2$. In…
By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…
The notion of a holomorphically symplectic manifold can be generalized to the singular one. This paper studies the birational contraction maps between symplectic varieties, and then describes the deformation of a symplectic variety which…
This note presents a discussion of the algebraic and combinatorial aspects of the theory of pure O-sequences. Various instances where pure O-sequences appear are described. Several open problems that deserve further investigation are also…
When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for…
There is no recursively enumerable sequence of sufficiently strong 2-consistent r.e. theories such that each proves the $2$-consistency of the next. Montalb\'an and Shavrukov independently asked whether this result generalizes to…
We solve the integration problem for generalized complex manifolds, obtaining as the natural integrating object a weakly holomorphic symplectic groupoid, which is a real symplectic groupoid with a compatible complex structure defined only…
Recently the first two authors constructed an L-infinity morphism using the S^1-equivariant version of the Poisson Sigma Model (PSM). Its role in deformation quantization was not entirely clear. We give here a "good" interpretation and show…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
We consider symplectic singularities in the sense of A. Beauville as examples of Poisson schemes. Using Poisson methods, we prove that a symplectic singularity admits a finite stratification with smooth symplectic strata. We also prove that…
Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a…
Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…
Contents 1. Algebraicity criterion: statement 2. Proof of the algebraicity criterion. 3. Pseudoeffectivity and movable classes. 4. Harder-Narasimhan filtrations and pseudo-effectivity. 5. Pseudo-effectivity of relative canonical bundles. 6.…
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…
We give a self-contained algebraic description of a formal symplectic groupoid over a Poisson manifold M. To each natural star product on M we then associate a canonical formal symplectic groupoid over M. Finally, we construct a unique…
Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both…
In this article, we focus on a very special class of foliations with complex leaves whose diffeomorphism type is fixed. They have a unique compact leaf and the noncompact leaves all accumulate onto it. We show that the complex structure…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…