English
Related papers

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

200 papers

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

Logic · Mathematics 2015-05-08 Denis R. Hirschfeldt , Carl G. Jockusch , Rutger Kuyper , Paul E. Schupp

For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.

Logic · Mathematics 2007-05-23 Antonin Kucera , Theodore A. Slaman

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

Combinatorics · Mathematics 2022-05-25 Simone Costa , Stefano Della Fiore

Let G and G' be absolutely almost simple algebraic groups of types B and C respectively, of rank at least 3, and defined over a number field K. We determine when G and G' have the same isomorphism or isogeny classes of maximal K-tori. This…

Group Theory · Mathematics 2013-09-26 Skip Garibaldi , Andrei S. Rapinchuk

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…

Logic · Mathematics 2014-08-12 Bjørn Kjos-Hanssen

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-03-12 Simone Costa

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

Logic · Mathematics 2012-09-17 Adam R. Day , Damir D. Dzhafarov

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-02-15 Simone Costa , Stefano Della Fiore

Let $\{X, X_n, n\geq 1\}$ be a sequence of independent identically distributed non-degenerate random variables. Put $S_0=0, S_n = \sum^n_{i=1} X_i$ and $V_n^2=\sum^n_{i=1} X_i^2, n\ge 1.$ A weak convergence theorem is established for the…

Probability · Mathematics 2013-06-21 Miklós Csörgő , Zhishui Hu

Let $(X, T)$ be a weakly mixing minimal system, $p_1, \cdots, p_d$ be integer-valued generalized polynomials and $(p_1,p_2,\cdots,p_d)$ be non-degenerate. Then there exists a residual subset $X_0$ of $X$ such that for all $x\in X_0$ $$\{…

Dynamical Systems · Mathematics 2021-04-20 Ruifeng Zhang , Jianjie Zhao

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

Group Theory · Mathematics 2014-02-26 Carl G. Jockusch , Paul E. Schupp

A semigroup $S$ is called a weakly exponential semigroup if, for every couple $(a,b)\in S\times S$ and every positive integer $n$, there is a non-negative integer $m$ such that $(ab)^{n+m}=a^nb^n(ab)^m=(ab)^ma^nb^n$. A semigroup $S$ is…

Group Theory · Mathematics 2015-09-01 Attila Nagy

A weakly U abundant is a class of semigroups characterized using some generalized Green' relations. In this paper we discuss the variants of weakly U - abundant semigroups and it is shown that the idempotent variants of these semigroups are…

Group Theory · Mathematics 2021-05-10 P G Romeo , Siji Michel

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

Logic · Mathematics 2024-03-28 Gianluca Paolini

In this paper, we find weak generating sets for a classical W-algebra $\mathcal{W}^k(\mathfrak{g},f)$ when $\mathfrak{g}=\mathfrak{sl}_N$ or $\mathfrak{sl}_{N_1|N_2}$. Furthermore, observing the relation between quantum and classical…

Mathematical Physics · Physics 2025-11-11 Min Hee Park , Uhi Rinn Suh

We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…

Group Theory · Mathematics 2023-06-29 Luís Oliveira

An algebra $A$ is left weakly Gorenstein if any semi-Gorenstein-projective left $A$-modules is Gorenstein-projective. The weakly Gorensteinness of two kinds of algebras are answered. Using the method of the monomorphism category, it is…

Representation Theory · Mathematics 2025-12-19 Nan Gao , Pu Zhang , Shijie Zhu

We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…

Quantum Physics · Physics 2010-08-19 Akio Hosoya , Yutaka Shikano

This work is devoted to averaging principle of a two-time-scale stochastic partial differential equation on a bounded interval $[0, l]$, where both the fast and slow components are directly perturbed by additive noises. Under some regular…

Probability · Mathematics 2018-02-06 Hongbo Fu , Li Wan , Jicheng Liu , Xianming Liu

We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…

Logic · Mathematics 2019-09-04 André Nies , Paul Shafer
‹ Prev 1 2 3 10 Next ›