2007
DOI: 10.1090/s0002-9939-07-09267-2
|View full text |Cite
|
Sign up to set email alerts
|

Invariant decomposition of functions with respect to commuting invertible transformations

Abstract: Abstract. Consider a 1 , . . . , a n ∈ R arbitrary elements. We characterize those functions f : R → R that decompose into the sum of a j -periodic functions, i.e., f = f 1 +· · ·+f n with ∆ a j f (x) := f (x+a j )−f (x) = 0. We show that f has such a decomposition if and only if for all partitions B 1 ∪B 2 ∪· · ·∪B N = {a 1 , . . . , a n } with B j consisting of commensurable elements with least common multiplesActually, we prove a more general result for periodic decompositions of functions f : A → R defined… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…Obvious. The fact that the identity in R can be expressed as the sum of two periodic functions was pointed out by Mortola and Peirone in [16], where (AC) is used to obtain periodic functions from R to R (see also [5]). …”
Section: Additive Functions First Examplesmentioning
confidence: 99%
“…Obvious. The fact that the identity in R can be expressed as the sum of two periodic functions was pointed out by Mortola and Peirone in [16], where (AC) is used to obtain periodic functions from R to R (see also [5]). …”
Section: Additive Functions First Examplesmentioning
confidence: 99%
“…The proof of the following is the same as for Theorem 4.9 with the new aspect that taking averages in Γ requires some additional care. [9]). Let A, Γ be torsion free Abelian groups and a 1 , .…”
Section: Decompositions On Groupsmentioning
confidence: 99%
“…2 Added in proof : Since in [4] a positive answer was given to Question 0.2, it turned out that the answer to Question 3.1 is also affirmative.…”
Section: Proofmentioning
confidence: 99%
“…It started in the seventies with some unpublished work of I.Z. Ruzsa and continued among others in [1,2,[4][5][6][8][9][10][11][12][13] and [14]. If f = f 1 + · · · + f n is an (a 1 , .…”
Section: Introductionmentioning
confidence: 99%