相关论文: Quasi-greedy bases for sequences with gaps
We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…
The concept of quasi generalized CR-lightlike was first introduced by the authors in [18]. In this paper, we focus on ascreen and co-screen quasi generalized CR-lightlike submanifolds of indefinite nearly $\mu$-Sasakian manifold. We prove…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…
Given an imaginary quadratic number field $K$ with ring of integers $\mathcal{O}_K$, we are interested in the asymptotic \emph{distance to nearest neighbour} (or \emph{gap}) statistic of complex Farey fractions $\frac{p}{q}$, with $p,q \in…
We construct quasi-Hopf algebras associated with a semisimple Lie algebra, a complex curve and a rational differential. This generalizes our previous joint work with V. Rubtsov (Israel J. Math. (1999) and q-alg/9608005).
Inspired by the network routing literature \cite{aggarwal1996efficient}, we develop what we call a ``Pre-Emptive Greedy Algorithm" to embed bounded degree induced trees in sparse expanders. This generalises a powerful and central result of…
In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…
Recently, Chach\'olski, Neeman, Pitsch, and Scherer studied, in a series of three papers, model approximations for the unbounded category of cochain complexes over a commutative ring. These approximations allow to construct relative…
Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is…
In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t…
The guesswork problem was originally studied by Massey to quantify the number of guesses needed to ascertain a discrete random variable. It has been shown that for a large class of random processes the rescaled logarithm of the guesswork…
Herbert Gr{\"o}tzsch is the main founder of the theory of quasicon-formal mappings. We review five of his papers, written between 1928 and 1932, that show the progress of his work from conformal to quasiconformal geometry. This will give an…
In this paper, we establish the Gr\"{o}bner-Shirshov bases theory for metabelian Lie algebras. As applications, we find the Gr\"{o}bner-Shirshov bases for partial commutative metabelian Lie algebras related to circuits, trees and some…
The "classical" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimator is maximized and the snapshot corresponding to the…
We discuss optimal constants of certain projections on subsequences of weakly null sequences. Positive results yield constants arbitrarily close to $1$ for Schreier type projections, and arbitrarily close to $1$ for Elton type projections…
We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…
S.B. Rao conjectured in 1971 that graphic degree sequences are well quasi ordered by a relation defined in terms of the induced subgraph relation. In 2008, M. Chudnovsky and P. Seymour proved this long standing Rao's Conjecture by giving…
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of…