相关论文: The Complexity of the Core Model

We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…

We give a precise estimate of the Bergman kernel for the model domain defined by $\Omega_F=\{(z,w)\in \mathbb{C}^{n+1}:{\rm Im}w-|F(z)|^2>0\},$ where $F=(f_1,...,f_m)$ is a holomorphic map from $\mathbb{C}^n$ to $\mathbb{C}^m$, in terms of…

We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove…

Sabok showed that the set of codes for $G_\delta$ Ramsey positive subsets of $[\omega]^\omega$ is $\mathbf{\Sigma}^1_2$-complete. We extend this result by providing sufficient conditions for the set of codes for $G_\delta$ Ramsey positive…

Let $(M,I, \Omega)$ be a holomorphically symplectic manifold equipped with a holomorphic Lagrangian fibration $\pi:\; M \mapsto X$, and $\eta$ a closed form of Hodge type (1,1)+(2,0) on $X$. We prove that $\Omega':=\Omega+\pi^* \eta$ is…

Scott showed that for every countable structure $\mathcal{A}$, there is a sentence of the infinitary logic $\mathcal{L}_{\omega_1\omega}$, called a Scott sentence for $\mathcal{A}$, whose models are exactly the isomorphic copies of…

A Hermitian symplectic manifold is a complex manifold endowed with a symplectic form $\omega$, for which the bilinear form $\omega(I\cdot,\cdot)$ is positive definite. In this work we prove $dd^c$-lemma for 1- and (1,1)-forms for compact…

The complexity of the matching polytope of graphs may be measured with the maximum length $\beta$ of a starting sequence of odd ears in an ear-decomposition. Indeed, a theorem of Edmonds and Pulleyblank shows that its facets are defined by…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…

We study locally compact group topologies on semisimple Lie groups. We show that the Lie group topology on such a group $S$ is very rigid: every 'abstract' isomorphism between $S$ and a locally compact and $\sigma$-compact group $\Gamma$ is…

We call the \emph{$p$-fundamental string} of a complex simple Lie algebra to the sequence of irreducible representations having highest weights of the form $k\omega_1+\omega_p$ for $k\geq0$, where $\omega_j$ denotes the $j$-th fundamental…

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…