Related papers: The algebraic dichotomy conjecture for infinite do…
The doubling conjecture predicts that a manifold admits positive scalar curvature with mean convex boundary if and only if its double admits positive scalar curvature. We show that it holds true for manifolds where the inclusion of the…
We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…
We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…
We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…
Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
One of the central problems in the study of parametrized constraint satisfaction problems is the Dichotomy Conjecture by T. Feder and M. Vardi stating that the constraint satisfaction problem (CSP) over a fixed, finite constraint language…
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…
A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…
We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…
We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…
The Gromov-Lawson-Rosenberg conjecture for a group G states that a compact spin manifold with fundamental group G admits a metric of positive scalar curvature if and only if a certain topological obstruction vanishes. It is known to be true…
We prove that the cohomology of the moduli space of morphisms of a fixed finite degree from a smooth projective curve $C$ of genus $g$ to a complete simplicial toric variety $\mathbb{P}(\Sigma)$, denoted by the rational polyhedral fan…
If two conical symplectic resolutions $X\to X_0$ and $X^!\to X_0^!$ are symplectic dual, the cohomology ring $H^*(X)$ and the coordinate ring of $\mathbb{C}^*$-fixed points in $X_0^!$ are expected to be isomorphic as graded algebras. This…
Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…
A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…
Tachikawa's second conjecture predicts that a finitely generated, orthogonal module over a finite-dimensional self-injective algebra is projective. This conjecture is an important part of the Nakayama conjecture. Our principal motivation of…