相关论文: The Complexity of the Core Model

Given a countable scattered linear order $L$ of Hausdorff rank $\alpha < \omega_1$ we show that it has a $d\text{-}\Sigma_{2\alpha+1}$ Scott sentence. Ash calculated the back and forth relations for all countable well-orders. From this…

We prove the formula \begin{equation*} TC(X\vee Y)=\max\{TC(X),TC(Y),cat(X\times Y)\} \end{equation*} for the topological complexity of the wedge $X\vee Y$.

We prove three theorems about solutions of $\Delta u + e^{2u} = 0$ in the plane. The first two describe explicitly all concave and quasiconcave solutions. The third theorem says that the diameter of the plane with respect to the metric with…

We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…

The aim of this paper is to give natural examples of $\mathbf{\Sigma}_1^1$-complete and $\mathbf{\Pi}_1^1$-complete sets. In the first part, we consider ideals on $\omega$. In particular, we show that the Hindman ideal $\mathcal{H}$ is…

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

We define a homomorphism from (a certain extension of) the fundamental group of the Hamiltonian automorphism group of a symplectic manifold to the group of invertibles in its quantum cohomology ring. The manifold must satify a technical…

Let $S$ be a $*$-monoid and let $a,b,c$ be elements of $S$. We say that $a$ is $(b,c)$-core-EP invertible if there exist some $x$ in $S$ and some nonnegative integer $k$ such that $cax(ca)^{k}c=(ca)^{k}c$, $x{\mathcal R}(ca)^{k}b$ and…

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

We consider finite-dimensional complex Lie algebras. We generalize the concept of Lie derivations via certain complex parameters and obtain various Lie and Jordan operator algebras as well as two one-parametric sets of linear operators.…

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

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",…

We give a higher-algebraic interpretation of complex orientations of ring spectra as "$\mathbb{E}_2$ strictifications" of the identity element. We show that higher strictifications do not exist for most ring spectra of interest in chromatic…

Here, we show that the first isomorphism theorem, the orbit-stabilizer theorem, and the non-uniqueness of solutions of underdetermined linear systems are all manifestations of the same underlying algebraic property. We will call this…

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

We study the problem of extending a complex structure to a given Lie algebra g, which is firstly defined on an ideal h of g. We consider the next situations: h is either complex or it is totally real. The next question is to equip g with an…

A dictionary is a set of finite words over some finite alphabet X. The omega-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [Omega-powers and descriptive set theory,…

Let ${\mathscr M}(p)$ $(p=2,3,\ldots)$ be the singlet vertex operator algebra and $\omega$ its conformal vector. We classify the simple weak ${\mathscr M}(p)$-modules with a non-zero element $u$ such that for some integer $s\geq 2$,…