Related papers: Greedy approximations by signed harmonic sums and …

A 2-matching of a graph $G$ is a spanning subgraph with maximum degree two. The size of a 2-matching $U$ is the number of edges in $U$ and this is at least $n-\k(U)$ where $n$ is the number of vertices of $G$ and $\k$ denotes the number of…

A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\pi$ over $V$, the other player imposes a permutation $\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in…

Consider the following stochastic differential equation driven by multiplicative noise on $\mathbb{R}^d$ with a superlinearly growing drift coefficient, \begin{align*} \mathrm{d} X_t = b (X_t) \, \mathrm{d} t + \sigma (X_t) \, \mathrm{d}…

We establish some properties of $\tau$-exceptional sequences for finite-dimensional algebras. In an earlier paper we established a bijection between the set of ordered support $\tau$-tilting modules and the set of complete signed…

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

In this paper, we study the non-monotone adaptive submodular maximization problem subject to a cardinality constraint. We first revisit the adaptive random greedy algorithm proposed in \citep{gotovos2015non}, where they show that this…

In this paper, we derive a new method for optimal $\ell^{1}$- and $\ell^2$-approximation of discrete signals on ${\mathbb N}_{0}$ whose entries can be represented as an exponential sum of finite length. Our approach employs Prony's method…

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy…

This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal matching pursuit and thresholding algorithms are analyzed under…

We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group $S_n$ and are consistent as $n$ varies. The extreme infinitely spherically symmetric permutation-valued processes are identified…

The Koml\'os$\unicode{x2013}$Major$\unicode{x2013}$Tusn\'ady (KMT) inequality for partial sums is one of the most celebrated results in probability theory. Yet its practical application has been hindered by a lack of practical constants.…

I show how one can use lattice methods to calculate various continuum properties of SU(N) gauge theories; in part to explore old ideas that N=3 might be close to N=infinity. I describe calculations of the low-lying `glueball' mass spectrum,…

The approximation of a discrete probability distribution $\mathbf{t}$ by an $M$-type distribution $\mathbf{p}$ is considered. The approximation error is measured by the informational divergence $\mathbb{D}(\mathbf{t}\Vert\mathbf{p})$, which…

The approximation of invariant measures for nonlinear ergodic stochastic differential equations (SDEs) is a central problem in scientific computing, with important applications in stochastic sampling, physics, and ecology. We first propose…

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

This paper focuses on explicit approximations for nonlinear stochastic delay differential equations (SDDEs). Under the weakly local Lipschitz and some suitable conditions, a generic truncated Euler-Maruyama (TEM) scheme for SDDEs is…

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…

Approximations to sums of stationary and ergodic sequences by martingales are investigated. Necessary and sufficient conditions for such sums to be asymptotically normal conditionally given the past up to time 0 are obtained. It is first…

Given a graph G, the domination number gamma(G) of G is the minimum order of a set S of vertices such that each vertex not in S is adjacent to some vertex in S. Equivalently, label the vertices from {0, 1} so that the sum over each closed…