We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrices which have sublinear rank and nonzero entries on the main diagonal, and analyze the connection of these properties to the rigidity of matrices. In particular, we exhibit a family of matrices which shows that sublinear rank does not imply the existence of triangles. This family can also be used ...

We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrices which have sublinear rank and nonzero entries on the main diagonal, and analyze the connection between these properties and the rigidity of matrices. In particular, we exhibit a family of matrices which shows that sublinear rank does not imply the existence of triangles. This family can also be...

We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = ∑ ±τ(τ − 1) and k = ∑ ±τ(τ −1)(τ− τ −1). We prove that the number of terms in the second type is sublinear in the bit length of k, which leads to the first provably sublinear point multiplication algorithm on Koblitz curves. For the first type, we conjecture that the number of terms ...

The zero-entropy-density conjecture states that the entropy density defined as s ≔ lim N→∞ S N /N vanishes for all translation-invariant pure states on the spin chain. Or equivalently, S N , the von Neumann entropy of such a state restricted to N consecutive spins, is sublinear. In this paper it is proved that this conjecture cannot be sharpened, i.e., translation-invariant states give rise to ...

Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover siz...

A distance labeling scheme labels the n nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A D-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least D from each other. In this paper we consider distance...

In this paper we survey recent advances in the area of sublinear-time algorithms.

In this paper, we obtain bounded criteria on certain weighted Morrey spaces for the commutators generalized by some sublinear integral operators and weighted Lipschitz functions. We also present bounded criteria for commutators generalized by such sublinear integral operators and weighted BMO function on the weighted Morrey spaces. As applications, our results yield the same bounded criteria fo...

We provide a general construction of time-consistent sublinear expectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a generalization of the random Gexpectation, and an optional sampling theorem that holds without exceptional set. Our results also shed light on the inherent li...

Recently, Dimitrov et. al. [4] proposed a novel algorithm for scalar multiplication of points on elliptic Koblitz curves that requires a provably sublinear number of point additions in the size of the scalar. Following some ideas used by this article, most notably double-base expansions for integers, we generalize their methods to hyperelliptic Koblitz curves of arbitrary genus over any nite el...