English
Related papers

Related papers: Weakly 2-randoms and 1-generics in Scott sets

200 papers

We introduce the notion of weak decreasing stochastic (WDS) ordering for real-valued processes with negative means, which, to our knowledge, has not been studied before. Thanks to Madan-Yor's argument, it follows that the WDS ordering is a…

Probability · Mathematics 2025-09-10 Antoine-Marie Bogso , Patrice Takam Soh

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

Combinatorics · Mathematics 2015-02-02 Salvatore Tringali

New weak and strong existence and weak and strong uniqueness results for multi-dimensional stochastic McKean--Vlasov equations are established under relaxed regularity conditions. Weak existence is a variation of Krylov's weak existence for…

Probability · Mathematics 2024-05-29 Yuliya S. Mishura , Alexander Yu. Veretennikov

In this paper, the averaging principle is studied for a class of multiscale stochastic partial differential equations driven by $\alpha$-stable process, where $\alpha\in(1,2)$. Using the technique of Poisson equation, the orders of strong…

Probability · Mathematics 2021-06-08 Xiaobin Sun , Yingchao Xie

Stochastic wave equations appear in several models for evolutionary processes subject to random forces, such as the motion of a strand of DNA in a liquid or heat flow around a ring. Semilinear stochastic wave equations can typically not be…

Probability · Mathematics 2021-11-09 Ladislas Jacobe de Naurois , Arnulf Jentzen , Timo Welti

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

Computational Complexity · Computer Science 2012-10-24 Bruno Grenet , Erich Kaltofen , Pascal Koiran , Natacha Portier

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

Logic · Mathematics 2021-10-14 Denis R. Hirschfeldt , Asher M. Kach , Antonio Montalbán

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…

Logic · Mathematics 2025-11-07 Rachael Alvir , Barbara Csima , Matthew Harrison-Trainor

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

Combinatorics · Mathematics 2013-11-08 Kok Bin Wong , Cheng Yeaw Ku

Let $k$ be a field and let $G$ be an affine algebraic group over $k$. Call a $G$-torsor weakly versal for a class of $k$-schemes $\cal C$ if it specializes to every $G$-torsor over a scheme in $\cal C$. A recent result of the first author,…

Algebraic Geometry · Mathematics 2025-12-17 Uriya A. First , Mathieu Florence , Zev Rosengarten

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Logic · Mathematics 2013-07-02 Rodney G. Downey , Carl G. Jockusch , Paul E. Schupp

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

Number Theory · Mathematics 2020-04-23 D. Dakota Blair , Joel David Hamkins , Kevin O'Bryant

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…

Formal Languages and Automata Theory · Computer Science 2009-03-09 Mikolaj Bojanczyk

In the algebra $\Cal A=\Cal L(PSL(2,\Bbb Z)\otimes B(H)=\Cal L(F_N)\otimes B(H)$, $N$ finite, there exists a bounded subnormal operator $Z$, such that $\Cal A$ is the weak closure of linear span of the set ${(Z^*)^n Z^m| n,m=0,1,2...}$.

Operator Algebras · Mathematics 2007-05-23 Florin G. Radulescu

A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that ``strange'' weak values for projection operators (such as values less than zero) always…

Quantum Physics · Physics 2007-05-23 R. E. Kastner

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

Let $G$ be a graph of girth $g$ and circumference $c.$ A vertex $v$ of $G$ is called weakly pancyclic if $v$ lies on an $\ell$-cycle for every integer $\ell$ with $g\le \ell\le c.$ We prove that if $G$ is a nonbipartite graph of order $n\ge…

Combinatorics · Mathematics 2026-01-23 Yurui Tang , Xingzhi Zhan

Let $X/\mathbb{F}_{q}$ be a smooth, geometrically connected, quasiprojective variety. Let $\mathcal{E}$ be a semisimple overconvergent $F$-isocrystal on $X$. Suppose that irreducible summands $\mathcal{E}_i$ of $\mathcal E$ have rank 2,…

Algebraic Geometry · Mathematics 2022-06-17 Raju Krishnamoorthy , Ambrus Pál

For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…

Combinatorics · Mathematics 2025-12-08 Eva Philippe , Vincent Pilaud

In the first part of our note we prove that every Weakly Lindel\"of Determined (WLD) (in particular, every reflexive) non-separable Banach $X$ space contains two dense linear subspaces $Y$ and $Z$ that are not densely isomorphic. This means…

Functional Analysis · Mathematics 2020-06-08 Petr Hájek , Tommaso Russo