相关论文: Enlarge Greedy Sums in Greedy-Type Properties by D…
We derive new results for the performance of a simple greedy algorithm for finding large independent sets and matchings in constant degree regular graphs. We show that for $r$-regular graphs with $n$ nodes and girth at least $g$, the…
A base for a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a sequence of elements of $\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for…
We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…
We demonstrate that from an algorithm guaranteeing an approximation factor for the ratio of submodular (RS) optimization problem, we can build another algorithm having a different kind of approximation guarantee -- weaker than the classical…
We provide a Maz'ya type characterization for a fractional Hardy inequality. As an application, we show that a bounded open set $G$ admits a fractional Hardy inequality if and only if the associated fractional capacity is quasiadditive with…
In this paper, we give a precise definition of an analytic $\gamma$-factor of an irreducible representation of a classical group over a local function field of odd characteristic so that it satisfies some notable properties which are enough…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.
For any countable group $\Gamma$ satisfying the ``weak Rohlin property'', and for any dynamical property, the set of $\Gamma$-actions with that property is either residual or meager. The class of groups with the weak Rohlin property…
Consider the problem of choosing a set of actions to optimize an objective function that is a real-valued polymatroid function subject to matroid constraints. The greedy strategy provides an approximate solution to the optimization problem,…
We consider interactive learning and covering problems, in a setting where actions may incur different costs, depending on the response to the action. We propose a natural greedy algorithm for response-dependent costs. We bound the…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have…
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
The algebraic connectivity $a(G)$ of a graph $G$ is defined as the second smallest eigenvalue of its Laplacian matrix $L(G)$. It also admits a variational characterization as the minimum of a quadratic form associated with $L(G)$, subject…
The greedy spanner is arguably the simplest and most well-studied spanner construction. Experimental results demonstrate that it is at least as good as any other spanner construction, in terms of both the size and weight parameters.…
We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…
We introduce and study the notion of weak weight-semi-greedy Markushevich bases - which extends the concepts of weight semi-greedy and weak semi-greedy Markushevich bases. In particular, we study conditions under which such bases are weight…
Let $N$ be a large prime and let $c > 1/4$. We prove that if $f$ is a $\pm 1$-valued completely multiplicative function, such that the exponential sums $$ S_f(a) := \sum_{1 \leq n < N} f(n) e(na/N), \quad a \pmod{N} $$ satisfy the ``Gauss…
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…