English
Related papers

Related papers: Strong Jump Inversion

200 papers

By using lower bound conditions of the L\'evy measure w.r.t. a nice reference measure, the coupling and strong Feller properties are investigated for the Markov semigroup associated with a class of linear SDEs driven by (non-cylindrical)…

Probability · Mathematics 2013-01-09 Feng-Yu Wang , Jian Wang

The proliferation of agentic systems has thrust the reasoning capabilities of AI into the forefront of contemporary machine learning. While it is known that there \emph{exist} neural networks which can reason through any Boolean task…

Computational Complexity · Computer Science 2026-02-06 Wenhao Li , Anastasis Kratsios , Hrad Ghoukasian , Dennis Zvigelsky

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

Logic · Mathematics 2015-06-10 Barbara Csima , Matthew Harrison-Trainor

We derive moment estimates and a strong limit theorem for space inverses of stochastic flows generated by jump SDEs with adapted coefficients in weighted H\"older norms using the Sobolev embedding theorem and the change of variable formula.…

Probability · Mathematics 2014-11-25 James-Michael Leahy , Remigijus Mikulevicius

The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…

Combinatorics · Mathematics 2009-05-05 Yair Glasner

Previous work has shown that DNNs with large depth $L$ and $L_{2}$-regularization are biased towards learning low-dimensional representations of the inputs, which can be interpreted as minimizing a notion of rank $R^{(0)}(f)$ of the learned…

Machine Learning · Computer Science 2024-08-16 Arthur Jacot

Analysability of finite $U$-rank types are explored both in general and in the theory $\mathrm{DCF}_0$. The well-known fact that the equation $\delta(\mathrm{log}\delta x)=0$ is analysable in but not almost internal to the constants is…

Logic · Mathematics 2017-08-08 Ruizhang Jin

Let K be an algebraically closed field of prime characteristic p, let X be a semiabelian variety defined over a finite subfield of K, let f be a regular self-map on X defined over K, let V be a subvariety of X defined over K, and let x be a…

Number Theory · Mathematics 2018-02-16 Pietro Corvaja , Dragos Ghioca , Thomas Scanlon , Umberto Zannier

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

Rings and Algebras · Mathematics 2023-03-03 Clément de Seguins Pazzis

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

Logic · Mathematics 2020-03-11 Mohammad Golshani , Saharon Shelah

We prove a quantitative partial result in support of the Dynamical Mordell-Lang Conjecture (also known as the DML conjecture) in positive characteristic. More precisely, we show the following: given a field $K$ of characteristic $p$, given…

Number Theory · Mathematics 2020-12-29 Dragos Ghioca , Alina Ostafe , Sina Saleh , Igor E. Shparlinski

A result of A.M. Davie [Int. Math. Res. Not. 2007] states that a multidimensional stochastic equation $dX_t = b(t, X_t)\,dt + dW_t$, $X_0=x$, driven by a Wiener process $W= (W_t)$ with a coefficient $b$ which is only bounded and measurable…

Probability · Mathematics 2016-12-19 Enrico Priola

A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

Logic · Mathematics 2023-05-12 Barbara F. Csima , Dino Rossegger

We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which…

Logic · Mathematics 2018-10-08 Menachem Magidor , Grzegorz Plebanek

For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…

Combinatorics · Mathematics 2022-06-15 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

Stochastic symmetries and related invariance properties of finite dimensional SDEs driven by general cadlag semimartingales taking values in Lie groups are defined and investigated. The considered set of SDEs, first introduced by S. Cohen,…

Probability · Mathematics 2020-08-04 Sergio Albeverio , Francesco C. De Vecchi , Paola Morando , Stefania Ugolini

Although deep learning has shown great success in recent years, researchers have discovered a critical flaw where small, imperceptible changes in the input to the system can drastically change the output classification. These attacks are…

Machine Learning · Computer Science 2018-11-21 Jacob M. Springer , Charles S. Strauss , Austin M. Thresher , Edward Kim , Garrett T. Kenyon

Let $\mathbb{K}$ be an algebraically closed field, $X$ a smooth projective variety over $\mathbb{K}$ and $f:X\rightarrow X$ a dominant regular morphism. Let $N^i(X)$ be the group of algebraic cycles modulo numerical equivalence. Let $\chi…

Algebraic Geometry · Mathematics 2016-11-11 Tuyen Trung Truong

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Logic · Mathematics 2025-06-09 Nicolás Cuervo Ovalle , Isaac Goldbring