Related papers: The Complexity of the Core Model

An \emph{$\omega$-admissible almost complex structure} on a $2n$-dimensional symplectic manifold $(M,\omega)$ is a $\omega$-calibrated almost complex structure $J$ admitting a nowhere vanishing $\bar{\partial}_J$-closed $(n,0)$-form $\psi$.…

Let f be a unimodal map of the interval with critical point c. If the orbit of c is not dense then most points in lim{[0,1],f} have neighborhoods that are homeomorphic with the product of a Cantor set and an open arc. The points without…

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

We address Calder\'on's problem of stably determining the anisotropic complex admittivity $\sigma$ in a domain $\Omega\subset\mathbb{R}^n$, with $n\geq3$, representing a conducting medium, in terms of a Dirichlet-to-Neumann map locally…

We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…

We prove that the number of 3-dimensional simplicial complexes having the spherical topology grows exponentially as a function of a volume. It is suggested that the 3d simplicial quantum gravity has qualitatively the same phase structure as…

Let $E$ be a $\mathbb Q$-curve without complex multiplication. We address the problem of deciding whether $E$ is geometrically isomorphic to a strongly modular $\mathbb Q$-curve. We show that the question has a positive answer if and only…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…

We study the build up of complexity on the example of 1 kg matter in different forms. We start on the simplest example of ideal gases, and then continue with more complex chemical, biological, life and social and technical structures. We…

We classify (up to quasi-isomorphism) the free differential modules whose homology is equal to a given module $M$ by developing a theory for deforming an arbitrary free complex into a differential module. We use an iterative approach to…

We define a new version of $\mathbb A^1$-homology, called cellular $\mathbb A^1$-homology, for smooth schemes over a field that admit an increasing filtration by open subschemes with cohomologically trivial closed strata. We provide several…

We develop techniques for studying fundamental groups and integral singular homology of symmetric Delta-complexes, and apply these techniques to study moduli spaces of stable tropical curves of unit volume, with and without marked points.…

An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…

We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…

Exact formulas for the singularities of the dynamical structure factor, S^{zz}(q,omega), of the S=1/2 xxz spin chain at all q and any anisotropy and magnetic field in the critical regime are derived, expressing the exponents in terms of the…

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…