scholarly journals Ultrafilter extensions of asymptotic density

2019 ◽  
Vol 60 (1) ◽  
pp. 25-37
Author(s):  
 Grebík Jan
2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.


2001 ◽  
Vol 28 (6) ◽  
pp. 367-373 ◽  
Author(s):  
C. Ganatsiou

We investigate some properties connected with the alternating Lüroth-type series representations for real numbers, in terms of the integer digits involved. In particular, we establish the analogous concept of the asymptotic density and the distribution of the maximum of the firstndenominators, by applying appropriate limit theorems.


2018 ◽  
Vol 167 (3) ◽  
pp. 531-547
Author(s):  
MICHAEL FILASETA ◽  
ROBERT WILCOX

AbstractWe provide the first explicit example of a universal Hilbert set ${\Ncal S}$ having asymptotic density 1 in the set of integers. More precisely, the number of integers not in ${\Ncal S}$ with absolute value ≤ X is bounded by X/(log X)δ, where δ = 1 − (1 + loglog 2)/(log 2) = 0.086071. . ..


2018 ◽  
Vol 14 (08) ◽  
pp. 2219-2223
Author(s):  
Paolo Leonetti ◽  
Carlo Sanna

Given positive integers [Formula: see text], we prove that the set of primes [Formula: see text] such that [Formula: see text] for [Formula: see text] admits asymptotic density relative to the set of all primes which is at least [Formula: see text], where [Formula: see text] is the Euler totient function. This result is similar to the one of Heilbronn and Rohrbach, which says that the set of positive integer [Formula: see text] such that [Formula: see text] for [Formula: see text] admits asymptotic density which is at least [Formula: see text].


2008 ◽  
Vol 78 (3) ◽  
pp. 431-436 ◽  
Author(s):  
XUE-GONG SUN ◽  
JIN-HUI FANG

AbstractErdős and Odlyzko proved that odd integers k such that k2n+1 is prime for some positive integer n have a positive lower density. In this paper, we characterize all arithmetic progressions in which natural numbers that can be expressed in the form (p−1)2−n (where p is a prime number) have a positive proportion. We also prove that an arithmetic progression consisting of odd numbers can be obtained from a covering system if and only if those integers in such a progression which can be expressed in the form (p−1)2−n have an asymptotic density of zero.


Author(s):  
David Griffeath ◽  
Dean Hickerson

We solve a problem posed recently by Gravner and Griffeath [4]: to find a finite seed A0 of 1s for a simple {0, l}-valued cellular automaton growth model on Z2 such that the occupied crystal An after n updates spreads with a two-dimensional asymptotic shape and a provably irrational density. Our solution exhibits an initial A0 of 2,392 cells for Conway’s Game Of Life from which An cover nT with asymptotic density (3 - √5/90, where T is the triangle with vertices (0,0), (-1/4,-1/4), and (1/6,0). In “Cellular Automaton Growth on Z2: Theorems, Examples, and Problems” [4], Gravner and Griffeath recently presented a mathematical framework for the study of Cellular Automata (CA) crystal growth and asymptotic shape, focusing on two-dimensional dynamics. For simplicity, at any discrete time n, each lattice site is assumed to be either empty (0) or occupied (1). Occupied sites after n updates grows linearly in each dimension, attaining an asymptotic density p within a limit shape L: . . . n-1 A → p • 1L • (1) . . . This phenomenology is developed rigorously in Gravner and Griffeath [4] for Threshold Growth, a class of monotone solidification automata (in which case p = 1), and for various nonmonotone CA which evolve recursively. The coarse-grain crystal geometry of models which do not fill the lattice completely is captured by their asymptotic density, as precisely formulated in Gravner and Griffeath [4]. It may happen that a varying “hydrodynamic” profile p(x) emerges over the normalized support L of the crystal. The most common scenario, however, would appear to be eq. (1), with some constant density p throughout L. All the asymptotic densities identified by Gravner and Griffeath are rational, corresponding to growth which is either exactly periodic in space and time, or nearly so. For instance, it is shown that Exactly 1 Solidification, in which an empty cell permanently joins the crystal if exactly one of its eight nearest (Moore) neighbors is occupied, fills the plane with density 4/9 starting from a singleton.


Sign in / Sign up

Export Citation Format

Share Document