scholarly journals Subsums of conditionally convergent series in finite dimensional spaces

Filomat ◽  
2018 ◽  
Vol 32 (15) ◽  
pp. 5471-5479
Author(s):  
Jacek Marchwicki ◽  
Václav Vlasák

An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems formulated in [10]. We obtain general result for series with harmonic-like coordinates, that is A((-1)n+1n-?1,..., (-1)n+1n-?d) = Rd for pairwise distinct numbers ?1,..., ?d ? (0,1]. For d = 2, ?1 = 1, ?2 = 1/2 this problem was stated in [10].

2010 ◽  
Vol 148 (3) ◽  
pp. 519-529 ◽  
Author(s):  
S. J. DILWORTH ◽  
E. ODELL ◽  
TH. SCHLUMPRECHT ◽  
ANDRÁS ZSÁK

AbstractWe consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in Lp[0, 1] (1 < p < ∞) then the algorithms terminate after finitely many iterations and that the number of iterations is bounded by a function of the length of the initial segment. We also prove a more general result for a class of strictly monotone bases.


Author(s):  
Alexey Bolsinov ◽  
Vladimir S. Matveev ◽  
Eva Miranda ◽  
Serge Tabachnikov

The paper surveys open problems and questions related to different aspects of integrable systems with finitely many degrees of freedom. Many of the open problems were suggested by the participants of the conference ‘Finite-dimensional Integrable Systems, FDIS 2017’ held at CRM, Barcelona in July 2017. This article is part of the theme issue ‘Finite dimensional integrable systems: new trends and methods’.


Sign in / Sign up

Export Citation Format

Share Document