English
Related papers

Related papers: Asymptotic density and the coarse computability bo…

200 papers

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

Computational Complexity · Computer Science 2018-05-08 Masaki Nakanishi , Marcos Villagra

Let $\gamma:[0,1]\rightarrow \mathbb{S}^{2}$ be a non-degenerate curve in $\mathbb{R}^3$, that is to say, $\det\big(\gamma(\theta),\gamma'(\theta),\gamma"(\theta)\big)\neq 0$. For each $\theta\in[0,1]$, let $V_\theta=\gamma(\theta)^\perp$…

Classical Analysis and ODEs · Mathematics 2024-03-27 Shengwen Gan , Shaoming Guo , Larry Guth , Terence L. J. Harris , Dominique Maldague , Hong Wang

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

Dynamical Systems · Mathematics 2023-02-21 Robert Bland , Kevin McGoff , Ronnie Pavlov

Let $G$ be a noncompact semisimple Lie group, $\Gamma$ be an irreducible cocompact lattice in $G$, and $P<G$ be a minimal parabolic subgroup. We consider the dynamics of $P$ acting on $G/\Gamma$ by left translation. For any infinite subset…

Dynamical Systems · Mathematics 2017-09-19 Changguang Dong

We study the geometry of germs of definable (semialgebraic or subanalytic) sets over a $p$-adic field from the metric, differential and measure geometric point of view. We prove that the local density of such sets at each of their points…

Logic · Mathematics 2012-10-23 R. Cluckers , G. Comte , F. Loeser

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

Dynamical Systems · Mathematics 2007-11-21 A. Fish

We give a definition of mass for conformally compactifiable initial data sets. The asymptotic conditions are compatible with existence of gravitational radiation, and the compactifications are allowed to be polyhomogeneous. We show that the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 P. T. Chrusciel , J. Jezierski , S. Leski

Let $\N$ denote the set of positive integers. The asymptotic density of the set $A \subseteq \N$ is $d(A) = \lim_{n\to\infty} |A\cap [1,n]|/n$, if this limit exists. Let $ \mathcal{AD}$ denote the set of all sets of positive integers that…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson , Rohit Parikh

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

Logic · Mathematics 2020-06-23 Sam Sanders

This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…

Logic in Computer Science · Computer Science 2025-10-15 Jorge Gallego-Hernández , Alessio Mansutti

We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $\delta n$ where $\delta>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$…

Combinatorics · Mathematics 2019-05-29 Colin Cooper , Alan Frieze , Wesley Pegden

We derive explicit asymptotic expansions of the density of the supremum of a strictly stable process when the index $\alpha$ is not rational. In the case when parameters $\alpha$ and $\rho=\p(X_1>0)$ satisfy $\rho+k=l/\alpha$ for some…

Probability · Mathematics 2010-06-15 Alexey Kuznetsov

In this m\'emoire we study quasiperiodic cocycles in semi-simple compact Lie groups. For the greatest part of our study, we will focus ourselves to one-frequency cocyles. We will prove that $C^{\infty}$ reducible cocycles are dense in the…

Dynamical Systems · Mathematics 2018-09-21 Nikolaos Karaliolios

We provide new asymptotic theory for kernel density estimators, when these are applied to autoregressive processes exhibiting moderate deviations from a unit root. This fills a gap in the existing literature, which has to date considered…

Statistics Theory · Mathematics 2019-08-19 James A. Duffy

For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…

Dynamical Systems · Mathematics 2016-09-07 Daniel J. Rudolph , Benjamin Weiss

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Logic · Mathematics 2025-12-12 Eike Neumann , Arno Pauly , Cécilia Pradic , Manlio Valenti

For integers $q\ge p\ge r\ge2$, we say that an $r$-uniform hypergraph $H$ has property $(q,p)$, if for any $q$-vertex subset $Q$ of $V(H)$, there exists a $p$-vertex subset $P$ of $Q$ spanning a clique in $H$. Let $T_{r}(n,q,p)=\min\{ e(H):…

Combinatorics · Mathematics 2023-03-02 Chunqiu Fang , Guorong Gao , Jie Ma , Ge Song

An open question in reverse mathematics is whether the cohesive principle, $\COH$, is implied by the stable form of Ramsey's theorem for pairs, $\SRT^2_2$, in $\omega$-models of $\RCA$. One typical way of establishing this implication would…

Logic · Mathematics 2012-12-05 Damir D. Dzhafarov

Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp \{ (a_1,\ldots,a_h)\in A^{h}: a_1+\cdots+a_h=n\}.$ The set $A$ is called an asymptotic basis of order $h$…

Number Theory · Mathematics 2018-10-29 Min Tang , Deng-Rong Ling

We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative…

Computational Complexity · Computer Science 2016-01-14 Hector Zenil , Jürgen Riedel