Kaimanovich (2003) [9] introduced the concept of augmented tree on the symbolic space of a selfsimilar set. It is hyperbolic in the sense of Gromov, and it was shown by Lau and Wang (2009) [12] that under the open set condition, a self-similar set can be identified with the hyperbolic boundary of the tree. In the paper, we investigate in detail a class of simple augmented trees and the Lipschitz equivalence of such trees. The main purpose is to use this to study the Lipschitz equivalence problem of the totally disconnected self-similar sets which has been undergoing some extensive development recently.

Nonconvex reformulations via low-rank factorization for stochastic convex semidefinite optimization problem have attracted arising attention due to their empirical efficiency and scalability. Compared with the original convex formulations, the nonconvex ones typically involve much fewer variables, allowing them to scale to scenarios with millions of variables. However, it opens a new challenge that under what conditions the nonconvex stochastic algorithms may find the population minimizer within the optimal statistical precision despite their empirical success in applications. In this paper, we provide an answer that the stochastic gradient descent (SGD) method can be adapted to solve the nonconvex reformulation of the original convex problem, with a global linear convergence when using a fixed step size, i.e., converging exponentially fast to the population minimizer within an optimal statistical precision in the restricted strongly convex case. If a diminishing step size is adopted, the bad effect caused by the variance of gradients on the optimization error can be eliminated but the rate is dropped to be sublinear. The core of our treatment relies on a novel second-order descent lemma, which is more general than the existing best result in the literature and improves the analysis on both online and batch algorithms. The developed theoretical results and effectiveness of the suggested SGD are also verified by a series of experiments.

No abstract uploaded!

We establish the existence of infinitely many$polynomial$progressions in the primes; more precisely, given any integer-valued polynomials$P$_{1}, …,$P$_{$k$}∈$Z$[$m$] in one unknown$m$with$P$_{1}(0) = … =$P$_{$k$}(0) = 0, and given any$ε$> 0, we show that there are infinitely many integers$x$and$m$, with $1 \leqslant m \leqslant x^\varepsilon$ , such that$x$+$P$_{1}($m$), …,$x$+$P$_{$k$}($m$) are simultaneously prime. The arguments are based on those in [18], which treated the linear case$P$_{$j$}= ($j$− 1)$m$and$ε$= 1; the main new features are a localization of the shift parameters (and the attendant Gowers norm objects) to both coarse and fine scales, the use of PET induction to linearize the polynomial averaging, and some elementary estimates for the number of points over finite fields in certain algebraic varieties.

This paper gives a new and direct construction of the multi-prime big de Rham–Witt complex, which is defined for every commutative and unital ring; the original construction by Madsen and myself relied on the adjoint functor theorem and accordingly was very indirect. The construction given here also corrects the 2-torsion which was not quite correct in the original version. The new construction is based on the theory of modules and derivations over a$λ$-ring which is developed first. The main result in this first part of the paper is that the universal derivation of a$λ$-ring is given by the universal derivation of the underlying ring together with an additional structure depending directly on the$λ$-ring structure in question. In the case of the ring of big Witt vectors, this additional structure gives rise to divided Frobenius operators on the module of Kähler differentials. It is the existence of these divided Frobenius operators that makes the new construction of the big de Rham–Witt complex possible. It is further shown that the big de Rham–Witt complex behaves well with respect to étale maps, and finally, the big de Rham–Witt complex of the ring of integers is explicitly evaluated.