Related papers: Weight-partially greedy bases and weight-Property …
The Adjusted Winner (AW) method is a fundamental procedure for the fair division of indivisible resources between two agents. However, its reliance on splitting resources can lead to practical complications. To address this limitation, we…
The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…
We consider weighted norm inequalities for the Riesz potentials $I_\alpha$, also referred to as fractional integral operators. First we prove mixed $A_p$-$A_\infty$ type estimates in the spirit of [13, 15, 17]. Then we prove strong and weak…
Several different fairness notions have been introduced in the context of fair allocation of goods. In this manuscript, we compare between some fairness notions that are used in settings in which agents have arbitrary (perhaps unequal)…
We construct a basis for free Lie algebras via a ``left-greedy'' bracketing algorithm on Lyndon-Shirshov words. We use a new tool -- the configuration pairing between Lie brackets and graphs of Sinha-Walter -- to show that the left-greedy…
We introduce a new test for conditional independence which is based on what we call the weighted generalised covariance measure (WGCM). It is an extension of the recently introduced generalised covariance measure (GCM). To test the null…
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach…
The method of using rearrangements to give sufficient conditions for Fourier inequalities between weighted Lebesgue spaces is revisited. New results in the case q < p are established and a comparison between two known sufficient conditions…
The induction and reduction precesses of an O*-vector space $\M$ obtained by means of a projection taken, respectively, in $\M$ itself or in its weak bounded commutant $\M'_\w$ are studied. In the case where $\M$ is a partial GW*-algebra,…
We establish statistical properties of random-weighting methods in LASSO regression under different regularization parameters $\lambda_n$ and suitable regularity conditions. The random-weighting methods in view concern repeated optimization…
In this paper we study two different weighted isoperimetric inequalities. In the first part of the paper we prove a sharp stability result for the isoperimetric inequality with a log-convex weight. In the second part we analize the behavior…
Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
The principle characteristics of biased greedy random walks (BGRWs) on two-dimensional lattices with real-valued quenched disorder on the lattice edges are studied. Here, the disorder allows for negative edge-weights. In previous studies,…
Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacking or re-ranking of…
Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, Bern\'a and Blasco gave a characterization of these…
We study online weighted bipartite matching of reusable resources where an adversarial sequence of requests for resources arrive over time. A resource that is matched is 'used' for a random duration, drawn independently from a…
In this paper, we establish new advances in the theory started by T. Oikhberg in [15] where the author joins greedy approximation theory with the use of sequences with gaps. Concretely, we address and partially answer three open questions…
The aim of the present paper is to define and study a new class of groups, namely Wm-groups with a single binary operation based on axioms of semi commutativity, right identity and left inverse. Moreover, we introduce the notions of right…