Displaying similar documents to “Interpolating sequences in the unit ball of C n

Piatetski-Shapiro sequences via Beatty sequences

Lukas Spiegelhofer (2014)

Acta Arithmetica

Similarity:

Integer sequences of the form n c , where 1 < c < 2, can be locally approximated by sequences of the form ⌊nα+β⌋ in a very good way. Following this approach, we are led to an estimate of the difference n x φ ( n c ) - 1 / c n x c φ ( n ) n 1 / c - 1 , which measures the deviation of the mean value of φ on the subsequence n c from the expected value, by an expression involving exponential sums. As an application we prove that for 1 < c ≤ 1.42 the subsequence of the Thue-Morse sequence indexed by n c attains both of its values with...

Primefree shifted Lucas sequences

Lenny Jones (2015)

Acta Arithmetica

Similarity:

We say a sequence = ( s ) n 0 is primefree if |sₙ| is not prime for all n ≥ 0, and to rule out trivial situations, we require that no single prime divides all terms of . In this article, we focus on the particular Lucas sequences of the first kind, a = ( u ) n 0 , defined by u₀ = 0, u₁ = 1, and uₙ = aun-1 + un-2 for n≥2, where a is a fixed integer. More precisely, we show that for any integer a, there exist infinitely many integers k such that both of the shifted sequences a ± k are simultaneously primefree. This...

On linear extension for interpolating sequences

Eric Amar (2008)

Studia Mathematica

Similarity:

Let A be a uniform algebra on X and σ a probability measure on X. We define the Hardy spaces H p ( σ ) and the H p ( σ ) interpolating sequences S in the p-spectrum p of σ. We prove, under some structural hypotheses on A and σ, that if S is a “dual bounded” Carleson sequence, then S is H s ( σ ) -interpolating with a linear extension operator for s < p, provided that either p = ∞ or p ≤ 2. In the case of the unit ball of ℂⁿ we find, for instance, that if S is dual bounded in H ( ) then S is H p ( ) -interpolating with...

Discrepancy estimates for some linear generalized monomials

Roswitha Hofer, Olivier Ramaré (2016)

Acta Arithmetica

Similarity:

We consider sequences modulo one that are generated using a generalized polynomial over the real numbers. Such polynomials may also involve the integer part operation [·] additionally to addition and multiplication. A well studied example is the (nα) sequence defined by the monomial αx. Their most basic sister, ( [ n α ] β ) n 0 , is less investigated. So far only the uniform distribution modulo one of these sequences is resolved. Completely new, however, are the discrepancy results proved in this paper....

On the golden number and Fibonacci type sequences

Eugeniusz Barcz (2019)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The paper presents, among others, the golden number ϕ as the limit of the quotient of neighboring terms of the Fibonacci and Fibonacci type sequence by means of a fixed point of a mapping of a certain interval with the help of Edelstein’s theorem. To demonstrate the equality  , where f n is n -th Fibonacci number also the formula from Corollary has been applied. It was obtained using some relationships between Fibonacci and Lucas numbers, which were previously justified.

On square classes in generalized Fibonacci sequences

Zafer Şiar, Refik Keskin (2016)

Acta Arithmetica

Similarity:

Let P and Q be nonzero integers. The generalized Fibonacci and Lucas sequences are defined respectively as follows: U₀ = 0, U₁ = 1, V₀ = 2, V₁ = P and U n + 1 = P U + Q U n - 1 , V n + 1 = P V + Q V n - 1 for n ≥ 1. In this paper, when w ∈ 1,2,3,6, for all odd relatively prime values of P and Q such that P ≥ 1 and P² + 4Q > 0, we determine all n and m satisfying the equation Uₙ = wUₘx². In particular, when k|P and k > 1, we solve the equations Uₙ = kx² and Uₙ = 2kx². As a result, we determine all n such that Uₙ = 6x². ...

On the structure of sequences with forbidden zero-sum subsequences

W. D. Gao, R. Thangadurai (2003)

Colloquium Mathematicae

Similarity:

We study the structure of longest sequences in d which have no zero-sum subsequence of length n (or less). We prove, among other results, that for n = 2 a and d arbitrary, or n = 3 a and d = 3, every sequence of c(n,d)(n-1) elements in d which has no zero-sum subsequence of length n consists of c(n,d) distinct elements each appearing n-1 times, where c ( 2 a , d ) = 2 d and c ( 3 a , 3 ) = 9 .

Equicontinuity and Convergent Sequences in the Spaces C ' and M

Jan Kisyński (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Characterizations of equicontinuity and convergent sequences are given for the space C ' ( ) of rapidly decreasing distributions and the space M ( ) of slowly increasing infinitely differentiable functions.

Universal Jamison spaces and Jamison sequences for C₀-semigroups

Vincent Devinck (2013)

Studia Mathematica

Similarity:

An increasing sequence ( n k ) k 0 of positive integers is said to be a Jamison sequence if for every separable complex Banach space X and every T ∈ ℬ(X) which is partially power-bounded with respect to ( n k ) k 0 , the set σ p ( T ) is at most countable. We prove that for every separable infinite-dimensional complex Banach space X which admits an unconditional Schauder decomposition, and for any sequence ( n k ) k 0 which is not a Jamison sequence, there exists T ∈ ℬ(X) which is partially power-bounded with respect to ( n k ) k 0 ...

On a generalization of the Pell sequence

Jhon J. Bravo, Jose L. Herrera, Florian Luca (2021)

Mathematica Bohemica

Similarity:

The Pell sequence ( P n ) n = 0 is the second order linear recurrence defined by P n = 2 P n - 1 + P n - 2 with initial conditions P 0 = 0 and P 1 = 1 . In this paper, we investigate a generalization of the Pell sequence called the k -generalized Pell sequence which is generated by a recurrence relation of a higher order. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences. Some interesting identities involving the Fibonacci and generalized Pell numbers...

On the intersection of two distinct k -generalized Fibonacci sequences

Diego Marques (2012)

Mathematica Bohemica

Similarity:

Let k 2 and define F ( k ) : = ( F n ( k ) ) n 0 , the k -generalized Fibonacci sequence whose terms satisfy the recurrence relation F n ( k ) = F n - 1 ( k ) + F n - 2 ( k ) + + F n - k ( k ) , with initial conditions 0 , 0 , , 0 , 1 ( k terms) and such that the first nonzero term is F 1 ( k ) = 1 . The sequences F : = F ( 2 ) and T : = F ( 3 ) are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation F n ( k ) = F m ( ) . In this note, we use transcendental tools to provide a general method for finding the intersections F ( k ) F ( m ) which gives...

On the Kaczmarz algorithm of approximation in infinite-dimensional spaces

Stanisław Kwapień, Jan Mycielski (2001)

Studia Mathematica

Similarity:

The Kaczmarz algorithm of successive projections suggests the following concept. A sequence ( e k ) of unit vectors in a Hilbert space is said to be effective if for each vector x in the space the sequence (xₙ) converges to x where (xₙ) is defined inductively: x₀ = 0 and x = x n - 1 + α e , where α = x - x n - 1 , e . We prove the effectivity of some sequences in Hilbert spaces. We generalize the concept of effectivity to sequences of vectors in Banach spaces and we prove some results for this more general concept.