Related papers: Decidability of some complicated structures defina…

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

We prove irreducibility for the space of cyclic covers of fixed numerical type between smooth projective curves, and also for the space of cyclic covers of prime order and of fixed numerical-combinatorial type between moduli-stable…

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Let $G$ be a connected reductive algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p \ge 0$, and let $\mathcal{N}$ be its nilpotent cone. Under mild hypotheses, we construct for each nilpotent $G$-orbit $C$ and…

Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon's approach, axiomatizing what an…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

We characterize the possible reductions of $j$-invariants of elliptic curves which admit complex multiplication by an order $\mathcal{O}$ where the curve itself is defined over $\mathbb{Z}_p$. In particular, we show that the distribution of…

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that…

We show a case of Zilber's Exponential-Algebraic Closedness Conjecture, establishing that the conjecture holds for varieties which split as the product of a linear subspace of the additive group $\mathbb{C}^n$ and an algebraic subvariety of…

Let $A$ be an artin algebra. The aim of this work is to describe the enlargements of an indecomposable complex in $\mathbf{C}_{n}(\mbox{proj} \,A)$, and to study the irreducible morphisms between them. Precisely, we prove that any…

For CM elliptic curve over rational field with analytic rank one, for any potential good ordinary prime p, not dividing the number of roots of unity in the complex multiplication field, we show the p-part of its Shafarevich-Tate group has…

In this note, we prove the Zilber--Pink conjecture for subvarieties of mixed Shimura varieties, which are not defined over~$\overline{\mathbb Q}$ in a strong sense. We prove similar results for general variations of mixed Hodge structure of…

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

We call an order $O$ in a quadratic field $K$ odd (resp. even) if its discriminant is an odd (resp. even) integer. We call an elliptic curve $E$ over the field $C$ of complex numbers with CM odd (resp. even) if its endomorphism ring…

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…