Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Let V be a 3-dimensional vector space over a finite field. We show that any irreducible subgroup of GL(V ) that arises as the automorphism group of an regular polytope preserves a...
In this note we analyze the linearized equations of forced elongation. We prove that solutions of these equations are given by a quasicontraction C0-semigroup on the physically co...
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...