Related papers: Homomorphism Preservation Theorems for Many-Valued…
We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…
Model order reduction provides low-complexity high-fidelity surrogate models that allow rapid and accurate solutions of parametric differential equations. The development of reduced order models for parametric \emph{nonlinear} Hamiltonian…
Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…
We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…
This is the first installment of a series of papers whose aim is to lay a foundation for homotopy probability theory by establishing its basic principles and practices. The notion of a homotopy probability space is an enrichment of the…
It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…
We obtain a rigidity phenomena of rational cohomology automorphisms of certain homogeneous spaces, in the presence of external cohomology classes arising from spaces with trivial cup product in rational cohomology algebra. We classify…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Our main result states that for each finite complex L the category ${\bf TOP}$ of topological spaces possesses a model category structure (in the sense of Quillen) whose weak equivalences are precisely maps which induce isomorphisms of all…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
This paper unifies problems and results related to (embedding) universal and homomorphism universal structures. On the one side we give a new combinatorial proof of the existence of universal objects for homomorphism defined classes of…
We present a novel methodology for constructing arbitrarily high-order structure-preserving methods tailored for damped Hamiltonian systems. This method combines the idea of exponential integrator and energy-preserving collocation methods,…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
We introduce and develop a topological semantics of conservativity logics and interpretability logics. We prove the topological compactness theorem of consistent normal extensions of the conservativity logic $\mathbf{CL}$ by extending…
We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…
An old theorem of Weil and Kodaira says that for a compact K\"ahler manifold $X$ there is a closed logarithmic $1$-form with residue divisor $D$ if and only if $D$ is homologous to zero in $H_{2n-2}(X,\mathbb C)$. In the first part of this…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…