The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 7 of 7

Showing per page

A generalization of a theorem of Erdős-Rényi to m-fold sums and differences

Kathryn E. Hare, Shuntaro Yamagishi (2014)

Acta Arithmetica

Let m ≥ 2 be a positive integer. Given a set E(ω) ⊆ ℕ we define r N ( m ) ( ω ) to be the number of ways to represent N ∈ ℤ as a combination of sums and differences of m distinct elements of E(ω). In this paper, we prove the existence of a “thick” set E(ω) and a positive constant K such that r N ( m ) ( ω ) < K for all N ∈ ℤ. This is a generalization of a known theorem by Erdős and Rényi. We also apply our results to harmonic analysis, where we prove the existence of certain thin sets.

A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy

Henri Faure, Friedrich Pillichshammer (2013)

Acta Arithmetica

In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize the concept...

A sequence adapted from the movement of the center of mass of two planets in solar system

Jana Fialová (2018)

Communications in Mathematics

In this paper we derive a sequence from a movement of center of~mass of arbitrary two planets in some solar system, where the planets circle on concentric circles in a same plane. A trajectory of center of mass of the planets is discussed. A sequence of points on the trajectory is chosen. Distances of the points to the origin are calculated and a distribution function of a sequence of the distances is found.

Almost periodic sequences and functions with given values

Michal Veselý (2011)

Archivum Mathematicum

We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set  X in a metric space, it is proved the existence of an almost periodic sequence { ψ k } k such that { ψ k ; k } = X and ψ k = ψ k + l q ( k ) , l for all  k and some q ( k ) which depends on  k .

Currently displaying 1 – 7 of 7

Page 1