Related papers: Quasi-greedy bases for sequences with gaps
The quasi-redirecting (QR) boundary, introduced by Qing and Rafi, generalizes the Gromov boundary for studying the large-scale geometry of finitely generated groups. Although it is not known to exist for all such groups, its existence has…
The three gap theorem was originally a conjecture by Steinhaus, who asserted that there are at most three distinct gap lengths in the fractional parts of the sequence {\alpha},{2}{\alpha},{\cdots},{N}{\alpha} for any integer {N} and real…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
The notion of mid $p$-summable sequences was introduced by Karn and Sinha in 2014 and recently explored and expanded by Botelho, Campos and Santos in 2017. In this paper we design a theory of mid summable sequences in the anisotropic…
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is {\em graphical}…
The gaps in the sequence $\{\sqrt{n}\}$ were shown by Elkies-McMullen (2004) to have a limiting distribution which is not the exponential distribution. However it is conjectured that the distribution of gaps in the sequence…
The classical Farey sequence of height $Q$ is the set of rational numbers in reduced form with denominator less than $Q$. In this paper we introduce the concept of a generalized Farey sequence. While these sequences arise naturally in the…
A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…
In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…
We investigate the convergence of a nonlinear approximation method introduced by Ammar et al. (J. Non-Newtonian Fluid Mech. 139:153-176, 2006) for the numerical solution of high-dimensional Fokker-Planck equations featuring in…
The bounded gaps property of the prime numbers, as proven by Yitang Zhang, is considered for sequences of lengths of closed geodesics, which by the theory of Selberg zeta functions are the geometric analogue of the prime numbers. It turns…
We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…
The quasidegeneracy approximation [V. A. Yurovsky, A. Ben-Reuven, P. S. Julienne, and Y. B. Band, J. Phys. B {\bf 32}, 1845 (1999)] is used here to evaluate transition amplitudes for the problem of curve crossing in linear potential grids…
The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy…
Pseudo-Hermitian Hamiltonians have recently become a field of wide investigation. Originally, the Generalized Riesz Systems (GRS) have been introduced as an auxiliary tool in this theory. In contrast, the current paper, GRSs are analysed in…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
Though quasi-Newton methods have been extensively studied in the literature, they either suffer from local convergence or use a series of line searches for global convergence which is not acceptable in the distributed setting. In this work,…
We study the splitting behaviour of quasilinear $p$-forms in the spirit of the theory of nondegenerate quadratic forms over fields of characteristic different from 2 using an analogue of M. Knebusch's generic splitting tower. Several new…
We propose a new method for learning deep neural network models that is based on a greedy learning approach: we add one basis function at a time, and a new basis function is generated as a non-linear activation function applied to a linear…
Considering the set cover problem, by modifying the approach that gives a logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algorithm's accuracy for a particular input. We compare the…