中文
相关论文

相关论文: Relative Definability of $n$-Generics

200 篇论文

For a set-valued stochastic sequence $(G_n)_{n=0}^N$ with relatively open convex values $G_n(\omega)$ we give a criterion for the existence of an adapted sequence $(x_n)_{n=0}^N$ of selectors, admitting an equivalent martingale measure.…

概率论 · 数学 2007-05-23 Dmitry B. Rokhlin

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

组合数学 · 数学 2016-09-07 Zhi-Wei Sun

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

群论 · 数学 2018-01-26 Dengyin Wang , Shikun Ou , Haipeng Qu

In the paper we consider images of finite simple projective special linear and unitary groups under power words. In particular, we show that if $G\simeq \PSL_n^\varepsilon (q)$, then for every power words of type $x^M$ there exist constant…

群论 · 数学 2019-09-12 Alexey Galt , Amit Kulshrestha , Anupam Singh , Evgeny Vdovin

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

群论 · 数学 2012-12-05 Cristina Acciarri , Pavel Shumyatsky

A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…

逻辑 · 数学 2014-02-18 Gregory Igusa

We conjecture that every infinite group $G$ can be partitioned into countably many cells $G=\bigcup_{n\in\omega}A_n$ such that $cov(A_nA_n^{-1})=|G|$ for each $n\in\omega$. Here $cov(A)=\min\{|X|:X\subseteq G, G=XA\}$. We confirm this…

群论 · 数学 2014-08-28 Igor Protasov , Sergii Slobodianiuk

In this paper we produce a real r such that 0<r<0# in L-degree, yet R is NOT generic over L (for a forcing amenable to L). This answers a question of Beller-Jensen-Welch.

逻辑 · 数学 2008-02-03 Sy D. Friedman

Let a finite non-empty X is equipped with discrete topology. We prove that S \subseteq X^\omega is of second category if and only if for each f:\omega -> \bigcup_{n \in \omega} X^n there exists a sequence {a_n}_{n \in \omega} belonging to S…

逻辑 · 数学 2007-05-23 Apoloniusz Tyszka

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

群论 · 数学 2016-07-14 Ilya Gorshkov

We prove that a real x is 1-generic if and only if every differentiable computable function has continuous derivative at x. This provides a counterpart to recent results connecting effective notions of randomness with differentiability. We…

逻辑 · 数学 2014-08-27 Rutger Kuyper , Sebastiaan A. Terwijn

We generalize a classical theorem of Besicovitch, showing that, for any positive integers $k<n$, if $E\subset \mathbb R^n$ is a Souslin set which is not $\mathcal{H}^k$-$\sigma$-finite, then $E$ contains a purely unrectifiable closed set…

经典分析与常微分方程 · 数学 2023-08-15 Camillo De Lellis , Ian Fleschler

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

群论 · 数学 2016-10-26 Jack Button , Maurice Chiodo , Mariano Zeron-Medina Laris

We give a necessary and sufficient condition, in terms of a certain reflection principle, for every unconditionally closed subset of a group G to be algebraic. As a corollary, we prove that this is always the case when G is a direct product…

群论 · 数学 2009-04-07 Dikran Dikranjan , Dmitri Shakhmatov

Let $f_1, ..., f_n$ be homogeneous polynomials generating a generic ideal $I$ in the ring of polynomials in $n$ variables over an infinite field. Moreno-Soc\'ias conjectured that for the graded reverse lexicographic term ordering, the…

In this paper we show that it is relatively consistent with ZFC that every gamma-set is countable while not every strong measure zero set is countable. This answers a question of Paul Szeptycki. A set is a gamma-set iff every omega-cover…

逻辑 · 数学 2007-05-23 Arnold W. Miller

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

计算机科学中的逻辑 · 计算机科学 2026-02-20 Henning Urbat , Thorsten Wißmann

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

组合数学 · 数学 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

This paper investigates the Hausdorff measure of certain sets of generics in computability theory. Let $\Gamma$ be the Turing ideal in which we take the dense open sets. The set of $\Gamma$-Cohen generics has measure positive if and only if…

逻辑 · 数学 2026-03-11 Yiping Miao

In this paper, we show that certain sums of generalized $m$-gonal numbers represent every positive integer if and only if they represent every positive integer up to an explicit bound $C_m$, verifying a conjecture of Sun for sufficiently…

数论 · 数学 2021-10-01 Kathrin Bringmann , Ben Kane