We prove field quantifier elimination for valued fields endowed with both an analytic structure that is $\unicode[STIX]{x1D70E}$ -Henselian and an automorphism that is $\unicode[STIX]{x1D70E}$ -Henselian. From this result we can deduce various Ax–Kochen–Eršov type results with respect to completeness and the independence property. The main example we are interested in is the field of Witt vectors on the algebraic closure of $\mathbb{F}_{p}$ endowed with its natural analytic structure and the lifting of the Frobenius. It turns out we can give a (reasonable) axiomatization of its first-order theory and that this theory does not have the independence property.

We prove, in $\text{ZF}+\boldsymbol{{\it\Sigma}}_{2}^{1}$-determinacy, that, for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a cone, and (3) relative to some oracle, for every equivalence class $[Y]_{E}$ we have that a real $X$ computes a member of the equivalence class if and only if ${\it\omega}_{1}^{X}\geqslant {\it\omega}_{1}^{[Y]}$. We also show that the implication from (1) to (2) is equivalent to the existence of sharps over $ZF$.

Nešetřil and Ossona de Mendez introduced the notion of first-order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether, if (G i )i∈ℕ is a sequence of graphs with M being their first-order limit and v is a vertex of M, then there exists a sequence (v i )i∈ℕ of vertices such that the graphs G i rooted at v i converge to M rooted at v. We show that this holds for almost all vertices v of M, and we give an example showing that the statement need not hold for all vertices.

In this note we partially answer a question of Cascales, Orihuela and Tkachuk [‘Domination by second countable spaces and Lindelöf ${\rm\Sigma}$-property’, Topology Appl.158(2) (2011), 204–214] by proving that under $CH$ a compact space $X$ is metrisable provided $X^{2}\setminus {\rm\Delta}$ can be covered by a family of compact sets $\{K_{f}:f\in {\it\omega}^{{\it\omega}}\}$ such that $K_{f}\subset K_{h}$ whenever $f\leq h$ coordinatewise.

We explain which Weierstrass ${\wp}$ -functions are locally definable from other ${\wp}$ -functions and exponentiation in the context of o-minimal structures. The proofs make use of the predimension method from model theory to exploit functional transcendence theorems in a systematic way.

The form of information presented can influence its utility for the conveying of knowledge by affecting an interpreter’s ability to reason with the information. There are distinct types of representational systems (for example, symbolic versus diagrammatic logics), various sub-systems (for example, propositional versus predicate logics), and even within a single representational system there may be different means of expressing the same piece of information content. Thus, to display information, choices must be made between its different representations, depending upon many factors such as: the context, the reasoning tasks to be considered, user preferences or desires (for example, for short symbolic sentences or minimal clutter within diagrammatic systems). The identification of all equivalent representations with the same information content is a sensible precursor to attempts to minimise a metric over this class. We posit that defining notions of semantic redundancy and identifying the syntactic properties that encapsulate redundancy can help in achieving the goal of completely identifying equivalences within a single notational system or across multiple systems, but that care must be taken when extending systems, since refinements of redundancy conditions may be necessary even for conservative system extensions. We demonstrate this theory within two diagrammatic systems, which are Euler-diagram-based notations. Such notations can be used to represent logical information and have applications including visualisation of database queries, social network visualisation, statistical data visualisation, and as the basis of more expressive diagrammatic logics such as constraint languages used in software specification and reasoning. The development of the new associated machinery and concepts required is important in its own right since it increases the growing body of knowledge on diagrammatic logics. In particular, we consider Euler diagrams with shading, and then we conservatively extend the system to include projections, which allow for a much greater degree of flexibility of representation. We give syntactic properties that encapsulate semantic equivalence in both systems, whilst observing that the same semantic concept of redundancy is significantly more difficult to realise as syntactic properties in the extended system withprojections.

We show that a computable and conformal map of the unit disk onto a bounded domain $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}D$ has a computable boundary extension if $D$ has a computable boundary connectivity function.

We continue the research programme of comparing the complex exponential with Zilberś exponential. For the latter, we prove, using diophantine geometry, various properties about zero sets of exponential functions, proved for $\mathbb{C}$ using analytic function theory, for example, the Identity Theorem.

We obtain a formula for the reflexivity index of a finite lattice of sets and of various types of infinite lattices of sets.

We study countable saturation of metric reduced products and introduce continuous fields of metric structures indexed by locally compact, separable, completely metrizable spaces. Saturation of the reduced product depends both on the underlying index space and the model. By using the Gelfand–Naimark duality we conclude that the assertion that the Stone–Čech remainder of the half-line has only trivial automorphisms is independent from ZFC (Zermelo-Fraenkel axiomatization of set theory with the Axiom of Choice). Consistency of this statement follows from the Proper Forcing Axiom, and this is the first known example of a connected space with this property.

Given a cardinal $\lambda $ with $\lambda =\lambda ^{\aleph _0}$ , we show that there is a field of cardinality $\lambda $ whose automorphism group is a free group of rank $2^\lambda $ . In the proof of this statement, we develop general techniques that enable us to realize certain groups as the automorphism group of structures of a given cardinality. They allow us to show that analogues of this result hold for free objects in various varieties of groups. For example, the free abelian group of rank $2^\lambda $ is the automorphism group of a field of cardinality $\lambda $ whenever $\lambda $ is a cardinal with $\lambda =\lambda ^{\aleph _0}$ . Moreover, we apply these techniques to show that consistently the assumption that $\lambda =\lambda ^{\aleph _0}$ is not necessary for the existence of a field of cardinality $\lambda $ whose automorphism group is a free group of rank $2^\lambda $ . Finally, we use them to prove that the existence of a cardinal $\lambda $ of uncountable cofinality with the property that there is no field of cardinality $\lambda $ whose automorphism group is a free group of rank greater than $\lambda $ implies the existence of large cardinals in certain inner models of set theory.

The problem of finding a nontrivial factor of a polynomial $f(x)$ over a finite field ${\mathbb{F}}_q$ has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the generalized Riemann hypothesis (GRH). In this work we improve the state of the art by focusing on prime degree polynomials; let $n$ be the degree. If $(n-1)$ has a‘large’ $r$ -smooth divisor $s$ , then we find a nontrivial factor of $f(x)$ in deterministic $\mbox{poly}(n^r,\log q)$ time, assuming GRH and that $s=\Omega (\sqrt{n/2^r})$ . Thus, for $r=O(1)$ our algorithm is polynomial time. Further, for $r=\Omega (\log \log n)$ there are infinitely many prime degrees $n$ for which our algorithm is applicable and better than the best known, assuming GRH. Our methods build on the algebraic-combinatorial framework of $m$ -schemes initiated by Ivanyos, Karpinski and Saxena (ISSAC 2009). We show that the $m$ -scheme on $n$ points, implicitly appearing in our factoring algorithm, has an exceptional structure, leading us to the improved time complexity. Our structure theorem proves the existence of small intersection numbers in any association scheme that has many relations, and roughly equal valencies and indistinguishing numbers.

It has been a long-standing question whether every amenable operator algebra is isomorphic to a (necessarily nuclear) $\mathrm{C}^*$ -algebra. In this note, we give a nonseparable counterexample. Finding out whether a separable counterexample exists remains an open problem. We also initiate a general study of unitarizability of representations of amenable groups in $\mathrm{C}^*$ -algebras and show that our method cannot produce a separable counterexample.

We prove that if $y''=f(y,y',t,\alpha ,\beta ,\ldots)$ is a generic Painlevé equation from among the classes II, IV and V, and if $y_1,\ldots,y_n$ are distinct solutions, then $\mathrm{tr.deg}(\mathbb{C}(t)(y_1,y'_1,\ldots,y_n,y'_n)/\mathbb{C}(t))=2n$. (This was proved by Nishioka for the single equation $P_{{\rm I}}$.) For generic Painlevé III and VI, we have a slightly weaker result: $\omega $-categoricity (in the sense of model theory) of the solution space, as described below. The results confirm old beliefs about the Painlevé transcendents.

We prove that groups definable in o-minimal structures have Cartan subgroups, and only finitely many conjugacy classes of such subgroups. We also delineate with precision how these subgroups cover the ambient group.

We explain how the André–Oort conjecture for a general Shimura variety can be deduced from the hyperbolic Ax–Lindemann conjecture, a good lower bound for Galois orbits of special points and the definability, in the $o$ -minimal structure ${ \mathbb{R} }_{\mathrm{an} , \mathrm{exp} } $ , of the restriction to a fundamental set of the uniformizing map of a Shimura variety. These ingredients are known in some important cases. As a consequence a proof of the André–Oort conjecture for projective special subvarieties of ${ \mathcal{A} }_{6}^{N} $ for an arbitrary integer $N$ is given.

We prove a “special point” result for products of elliptic modular surfaces, elliptic curves, multiplicative groups and complex lines, and deduce a result about vanishing linear combinations of singular moduli and roots of unity.

We study the consequences of stationary and semi-stationary set reflection. We show that the semi-stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of the weak square principle, etc. We also consider two cardinal tree properties introduced recently by Weiss, and prove that they follow from stationary and semi-stationary set reflection augmented with a weak form of Martin’s Axiom. We also show that there are some differences between the two reflection principles, which suggests that stationary set reflection is analogous to supercompactness, whereas semi-stationary set reflection is analogous to strong compactness.

We address the question of the dualizability of nilpotent Mal’cev algebras, showing that nilpotent finite Mal’cev algebras with a nonabelian supernilpotent congruence are inherently nondualizable. In particular, finite nilpotent nonabelian Mal’cev algebras of finite type are nondualizable if they are direct products of algebras of prime power order. We show that these results cannot be generalized to nilpotent algebras by giving an example of a group expansion of infinite type that is nilpotent and nonabelian, but dualizable. To our knowledge this is the first construction of a nonabelian nilpotent dualizable algebra. It has the curious property that all its nonabelian finitary reducts with group operation are nondualizable. We were able to prove dualizability by utilizing a new clone theoretic approach developed by Davey, Pitkethly, and Willard. Our results suggest that supernilpotence plays an important role in characterizing dualizability among Mal’cev algebras.