相关论文: Enlarge Greedy Sums in Greedy-Type Properties by D…
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…
$G$ be a finite group and $A$ a $G$-graded algebra over a field $F$ of characteristic zero. We characterize the varieties of $G$-graded algebras such that the multiplicities $m_{\langle \lambda \rangle}$ appering in the $\langle n \rangle…
We consider the problem of optimizing lifetime consumption under a habit formation model, both with and without an exogenous pension. Unlike much of the existing literature, we apply a power utility to the ratio of consumption to habit,…
Techniques introduced by G. Pisier in his proof that finite von Neumann factors with property gamma have length at most 5 are modified to prove that the length is 3. It is proved that if such a factor is a complemented subspace of some…
Let $G$ be a subgroup of a discrete (countable) group $\Gamma$. We introduce a notion of relative inner amenability of $G$ in $\Gamma$, we prove some equivalent conditions and provide examples as well as counter-examples. We also discuss…
A greedy personality is usually accompanied by arrogance and confidence. This work investigates the cooperation success condition in the context of biased payoff allocation and self-confidence. The first component allows the organizer in a…
Many image processing applications benefited remarkably from the theory of sparsity. One model of sparsity is the cosparse analysis one. It was shown that using l_1-minimization one might stably recover a cosparse signal from a small set of…
We consider the asymptotic expansion of the functional series \[S_{\mu,\gamma}(a;\lambda)=\sum_{n=1}^\infty \frac{n^\gamma e^{-\lambda n^2/a^2}}{(n^2+a^2)^\mu}\] for real values of the parameters $\gamma$, $\lambda>0$ and $\mu\geq0$ as…
We review some aspects, especially those we can tackle analytically, of a minimal model of closed economy analogous to the kinetic theory model of ideal gases where the agents exchange wealth amongst themselves such that the total wealth is…
A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. Denote the minimum size of a base for $G$ by $b(G)$. There is a…
Consider two ordered positive real number arrays of equal size. The problem is to find such set of indices of given size that the ratio of the sums of the array elements with those indices is minimized. In this work, in order to mitigate…
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…
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.…
Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: $(1)$ reduce the…
In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…
Large Language Models (LLMs) with billions of parameters are known for their impressive predicting capabilities but require lots of resources to run. With their massive rise in popularity, even a small reduction in required resources could…
Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this graph are not known ahead of time. We can query any pair of…
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is whether an \alpha-approximation algorithm translates into an…
Submodular maximization under matroid constraints is a fundamental problem in combinatorial optimization with applications in sensing, data summarization, active learning, and resource allocation. While the Sequential Greedy (SG) algorithm…
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal'…