English
Related papers

Related papers: Provably $\Delta^0_2$ and weakly descending chains

200 papers

In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable iff it is in the second ambiguous class (boldface Delta^0_2), iff it is…

Logic · Mathematics 2016-06-08 Samuel Alexander

Weakly locally finite division rings were considered in \cite{dbh}, where it was mentioned that the class of weakly locally finite division rings properly contains the class of locally finite division rings. In this paper, for any integer…

Rings and Algebras · Mathematics 2019-02-21 Trinh Thanh Deo , Mai Hoang Bien , Bui Xuan Hai

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

Probability · Mathematics 2012-03-27 Charles Bordenave , Pietro Caputo , Djalil Chafai

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

Number Theory · Mathematics 2024-04-11 Naser Talebizadeh Sardari , Bryce Joseph Orloski

Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned a dimension dim(A) in [0,1] and a strong dimension Dim(A) in…

Logic in Computer Science · Computer Science 2007-05-23 John M. Hitchcock , Jack H. Lutz , Sebastiaan A. Terwijn

Let $\Sigma$ be a (reduced) root system. Let $\mathsf{k}$ be an algebraically closed field of zero characteristic, and consider the corresponding semisimple Lie algebra $\mathfrak{g}_{\mathsf{k}, \Sigma}$. Then there is a first-order…

Rings and Algebras · Mathematics 2024-12-03 Hugo Luiz Mariano , João Schwarz

We show that in a scale of weighted Dirichlet spaces $D_{\alpha}$, including the Bergman space, given any finite Blaschke product $B$ there exists an equivalent norm in $D_{\alpha}$ such that $B$ satisfies the wandering subspace property…

Complex Variables · Mathematics 2019-04-08 Eva Gallardo-Gutiérrez , Jonathan Partington , Daniel Seco

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…

Logic · Mathematics 2020-02-19 Rupert Hölzl , Christopher P. Porter

We study the existence of a directed Hamilton cycle in random digraphs with $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $D_{n,m}^{(\delta\geq1)}$. We prove that if $m=\tfrac n2(\log…

Combinatorics · Mathematics 2025-06-17 Colin Cooper , Alan Frieze

Let $\Sigma$ be a countable alphabet. For $r\geq 1$, an infinite sequence $s$ with characters from $\Sigma$ is called $r$-quasi-regular, if for each $\sigma\in\Sigma$ the ratio of the longest to shortest interval between consecutive…

Combinatorics · Mathematics 2019-10-01 Joshua Frisch , Wade Hann-Caruthers , Pooya Vahidi Ferdowsi

Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems $(X,\Sigma)$, where each element $x \in X$ lies in $t$ randomly selected sets of $\Sigma$, where $t$ is an…

Combinatorics · Mathematics 2015-11-03 Esther Ezra , Shachar Lovett

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

We consider the constructive ordinal notation system for the ordinal ${\epsilon_0}$ that were introduced by L.D. Beklemishev. There are fragments of this system that are ordinal notation systems for the smaller ordinals ${\omega_n}$ (towers…

Logic · Mathematics 2013-12-12 Fedor Pakhomov

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Classical Analysis and ODEs · Mathematics 2025-11-19 András Máthé , William O'Regan

Given a class of graphs G closed under taking minors, we study the maximum degree \Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find…

Combinatorics · Mathematics 2013-04-19 Omer Gimenez , Dieter Mitsche , Marc Noy

In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…

Logic · Mathematics 2024-01-23 Jakub Tomaszewski

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

Combinatorics · Mathematics 2020-06-23 Michael Anastos , Alan Frieze

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Vassily Lyubetsky

The $\gamma_2$ norm of a real $m\times n$ matrix $A$ is the minimum number $t$ such that the column vectors of $A$ are contained in a $0$-centered ellipsoid $E\subseteq\mathbb{R}^m$ which in turn is contained in the hypercube $[-t, t]^m$.…

Combinatorics · Mathematics 2015-04-13 Jiri Matousek , Aleksandar Nikolov , Kunal Talwar
‹ Prev 1 3 4 5 6 7 10 Next ›