English
Related papers

Related papers: Quasi-greedy bases for sequences with gaps

200 papers

We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prove that in the context Markushevich bases in infinite…

Functional Analysis · Mathematics 2021-10-15 Miguel Berasategui , Silvia Lassalle

We introduce a notion of variable quasi-Bregman monotone sequence which unifies the notion of variable metric quasi-Fej\'er monotone sequences and that of Bregman monotone sequences. The results are applied to analyze the asymptotic…

Optimization and Control · Mathematics 2015-05-19 Quang Van Nguyen

Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become one of the most significant counterexamples in the theory. Its structure broke the ideal pattern that analysts had conceived for a generic…

Functional Analysis · Mathematics 2022-11-22 Fernando Albiac , José L. Ansorena

It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…

Functional Analysis · Mathematics 2018-03-23 Fernando Albiac , Jose L. Ansorena , Stephen Dilworth , Denka Kutzarova

We prove that if $\mathcal{X}$ is a quasi-greedy Markushevich basis of a Banach space $\mathbb{X}$, its dual basis $\mathcal{X}^*$ spans a norming subspace of $\mathbb{X}^*$. We also prove this result for weaker forms of quasi-greediness,…

Functional Analysis · Mathematics 2025-10-09 Miguel Berasategui

A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are…

Data Structures and Algorithms · Computer Science 2015-03-19 Wei Ren , Qing Zhao

We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level…

Number Theory · Mathematics 2015-09-07 Jens Marklof , Andreas Strömbergsson

We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To…

Functional Analysis · Mathematics 2018-06-19 P. M. Berná , S. J. Dilworth , D. Kutzarova , T. Oikhberg , B. Wallis

We extend some rate of convergence results of greedy quantization sequences already investigated in arXiv:1409.0732 [math.PR]. We show, for a more general class of distributions satisfying a certain control, that the quantization error of…

Probability · Mathematics 2020-04-01 Rancy El Nmeir , Harald Luschgy , Gilles Pagès

We investigate properties of the $m$-th error of approximation by polynomials with constant coefficients $\mathcal{D}_{m}(x)$ and with modulus-constant coefficients $\mathcal{D}_{m}^{\ast}(x)$ introduced by Bern\'a and Blasco (2016) to…

Functional Analysis · Mathematics 2019-03-06 Pablo M. Berná , Antonio Pérez

We use new methods, specific of non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$-Banach space for $0<p<1$ are democratic. The novel techniques we obtain permit to show in particular that all…

Functional Analysis · Mathematics 2022-08-22 Fernando Albiac , José L. Ansorena , Glenier Bello

Quasi-median graphs have been introduced by Mulder in 1980 as a generalisation of median graphs, known in geometric group theory to naturally coincide with the class of CAT(0) cube complexes. In his PhD thesis, the author showed that…

Group Theory · Mathematics 2017-12-06 Anthony Genevois

S. B. Rao conjectured that graphic sequences are well-quasi-ordered under an inclusion based on induced subgraphs. This conjecture has now been proved by Chudnovsky and Seymour. We give an independent short proof of the labelled version of…

Combinatorics · Mathematics 2013-06-18 Vaidy Sivaraman

Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In…

Functional Analysis · Mathematics 2017-05-12 Fernado Albiac , José L. Ansorena , Ben Wallis

To solve nonlinear problems, we construct two kinds of greedy capped nonlinear Kaczmarz methods by setting a capped threshold and introducing an effective probability criterion for selecting a row of the Jacobian matrix. The capped…

Numerical Analysis · Mathematics 2022-10-04 Yanjun Zhang , Hanyu Li

We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.

Group Theory · Mathematics 2007-05-23 Yu. I. Krasilnikova , B. V. Novikov

In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non superreflexive mixed-norm sequence space. As a by-product of our…

Functional Analysis · Mathematics 2018-09-11 Fernando Albiac , Jose L. Ansorena , Stephen J. Dilworth , Denka Kutzarova

We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors.…

Statistical Mechanics · Physics 2015-05-18 Jie Sun , Daniel ben-Avraham

We establish the existence of a quantum lift of the greedy basis.

Quantum Algebra · Mathematics 2018-06-06 Kyungyong Lee , Li Li , Dylan Rupel , Andrei Zelevinsky

In this paper, we bring the terminology of the Kunz coordinates of numerical semigroups to gapsets and we generalize this concept to $m$-extensions. It allows us to identify gapsets and, in general, $m$-extensions with tilings of boards. As…

Combinatorics · Mathematics 2022-08-17 Gilberto B. Almeida Filho , Matheus Bernardini