General iterative algorithm for nonexpansive semigroups and variational inequalities in Hilbert spaces.
Modified hybrid algorithm for a family of quasi--asymptotically nonexpansive mappings.
Second moment convergence rates for uniform empirical processes.
A note on the invariance principle of the product of sums of random variables.
The structure of plane graphs with independent crossings and its applications to coloring problems
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity of G is...
Symmetries in connected graded algebras and their PBW-deformations
We focus on connected graded algebras and their PBW-deformations endowed with additional symmetric structures. Many well-known algebras such as negative parts of Drinfeld-Jimbo’s quantum groups, cubic Artin-Schelter algebras and three-dimensional Sklyanin algebras appear in our research framework. As an application, we investigate a algebra which was introduced to compute the cohomology ring of the Fomin-Kirillov algebra , and explicitly construct all the (self-)symmetric and sign-(self-)symmetric...
On (p, 1)-total labelling of 1-planar graphs
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ(G) ≥ 8p+4 or Δ(G) ≥ 6p+2 and g(G) ≥ 4. As a consequence, the well-known (p, 1)-total labelling conjecture has been confirmed for some 1-planar graphs.
Page 1