Related papers: Weight-partially greedy bases and weight-Property …
In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal Greedy Algorithms that contains a wide range of greedy algorithms. In particular, we…
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…
In this note we study some basic properties of general fractional derivatives induced by weighted Bergman kernels. As an application we demonstrate a method for generating pre-images of analytic functions under weighted Bergman projections.…
We study $(\alpha,\beta)$-spanners for weighted graphs. We propose a simple greedy completion procedure which starts from a sparse initial graph, and repeatedly fixes pairs of vertices with a bad stretch, generalizing Kunedsen's additive…
Several resource allocation settings involve agents with unequal entitlements represented by weights. We analyze weighted fair division from an asymptotic perspective: if $m$ items are divided among $n$ agents whose utilities are…
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative…
We consider the sparse contextual bandit problem where arm feature affects reward through the inner product of sparse parameters. Recent studies have developed sparsity-agnostic algorithms based on the greedy arm selection policy. However,…
In this paper, we introduce a strong property $(A)$ and we study the transfer of property $(A)$ and strong property $(A)$ in trivial ring extensions and amalgamated duplication of a ring along an ideal. We also exhibit a class of rings…
I provide a novel approach to characterizing the set of interim realizable allocations, in the spirit of Matthews (1984) and Border (1991). The approach allows me to identify precisely why exact characterizations are difficult to obtain in…
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…
This paper analyzes new classes of preradicals defined as weak forms of left exact and idempotent preradicals. We introduce prehereditary preradicals to generalize the hereditary property, and essentially idempotent and weakly idempotent…
We characterize Pareto optimality via "near" weighted utilitarian welfare maximization. One characterization sequentially maximizes utilitarian welfare functions using a finite sequence of nonnegative and eventually positive welfare…
We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…
For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…
Weighted gradual semantics provide an acceptability degree to each argument representing the strength of the argument, computed based on factors including background evidence for the argument, and taking into account interactions between…
Let $\mathcal{F}$ be a hereditary collection of finite subsets of $\mathbb{N}$. In this paper, we introduce and characterize $\mathcal{F}$-(almost) greedy bases. Given such a family $\mathcal{F}$, a basis $(e_n)_n$ for a Banach space $X$ is…
Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…
In this note, we derive non trivial sharp bounds related to the weighted harmonic-geometric-arithmetic means inequalities, when two out of the three terms are known. As application, we give an explicit bound for the trace of the inverse of…
We provide an essentially complete dictionary of all implications among the basic and fundamental conditions in weighted theory such as the doubling, one weight A_p(w), A_\infty and C_p conditions as well as the two weight A_p and the…