Related papers: Strong Jump Inversion
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups…
In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…
The two dimensional Jacobian Conjecture says that a morphism $f:\mathbb{C}[x,y]\to \mathbb{C}[x,y]$ having an invertible Jacobian, is invertible. We show that a morphism $f$ having an invertible Jacobian is invertible, in each of the…
In this paper, we present a relative proof for Goldbach's strong conjecture. To this end, we first present a heuristic model for representing even numbers called Semi-continuous Model for Even Numbers or briefly S.C.E Model, and then by…
This paper grew as a continuation of [Sh462] but in the present form it can serve as a motivation for it as well. We deal with the same notions, and use just one simple lemma from there. Originally entangledness was introduced in order to…
We explore an analogue of the Andr\'e-Oort conjecture for subvarieties of Drinfeld modular varieties. The conjecture states that a subvariety $X$ of a Drinfeld modular variety contains a Zariski-dense set of complex multiplication (CM)…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
We establish the condition $(\Omega)$ for smooth kernels of various types of convolution and differential operators. By the $(DN)$-$(\Omega)$ splitting theorem of Vogt and Wagner, this implies that these operators are surjective on the…
In this paper, we prove the converse of the dynamical Mordell--Lang conjecture in positive characteristic: For every subset $S \subseteq \mathbb{N}_0$ which is a union of finitely many arithmetic progressions along with finitely many…
A prevailing assumption in machine learning is that model correctness must be enforced after the fact. We observe that the properties determining whether an AI model is numerically stable, computationally correct, or consistent with a…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
The famous Jacobian conjecture asks if an endomorphism $f$ of $K[x,y]$ ($K$ is a characteristic zero field) having a non-zero scalar Jacobian is invertible. Let $\alpha$ be the exchange involution on $K[x,y]$: $\alpha(x)= y$ and $\alpha(y)=…
We investigate the sequential topology $\tau_s$ on a complete Boolean algebra $B$ determined by algebraically convergent sequences in $B$. We show the role of weak distributivity of $B$ in separation axioms for the sequential topology. The…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
The problem of inferring an inductive invariant for verifying program safety can be formulated in terms of binary classification. This is a standard problem in machine learning: given a sample of good and bad points, one is asked to find a…
We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…