Related papers: Strong Jump Inversion
The notion of a strongly summing sequence is introduced. Such a sequence is weak-Cauchy, a basis for its closed linear span, and has the crucial property that the dual of this span is not weakly sequentially complete. The main result is:…
We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…
This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if $E$ is strongly ergodic with respect to $\mu$ then…
A strong invariance principle is established for random fields which satisfy dependence conditions more general than positive or negative association. We use the approach of Cs\"{o}rg\H{o} and R\'{e}v\'{e}sz applied recently by Balan to…
In this paper, we prove the strong Feller property for stochastic delay (or functional) differential equations with singular drift. We extend an approach of Maslowski and Seidler to derive the strong Feller property of those equations. The…
Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…
The famous Jacobian Conjecture asks if a morphism $f:K[x,y]\to K[x,y]$ with invertible Jacobian, is invertible ($K$ is a characteristic zero field). A known result says that if $K[f(x),f(y)] \subseteq K[x,y]$ is an integral extension, then…
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…
We show the strong well-posedness of SDEs driven by general multiplicative L\'evy noises with Sobolev diffusion and jump coefficients and integrable drift. Moreover, we also study the strong Feller property, irreducibility as well as the…
We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…
We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…
We study new relations of the following statements with weak choice principles in ZF and ZFA. 1. There does not exist an infinite Hausdorff space X such that every infinite subset of X contains an infinite compact subset. 2. If a field has…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
In this paper we analyze the classification performance of neural network structures without parametric inference. Making use of neural architecture search, we empirically demonstrate that it is possible to find random weight architectures,…
Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms; known as a characteristic measure. We give…
The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…
In this paper, we study arithmetic dynamics in arbitrary characteristic, in particular in positive characteristic. We generalise some basic facts on arithmetic degree and canonical height in positive characteristic. As applications, we…
We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and…
In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…
The following strong form of density of definable types is introduced for theories T admitting a fibered dimension function d: given a model M of T and a definable subset X of M^n, there is a definable type p in X, definable over a code for…