Dijkstra’s algorithm is a well-known algorithm for the single-source shortest path problem in a directed graph with nonnegative edge length. We discuss Dijkstra’s algorithm from the viewpoint of discrete convex analysis, where the concept of discrete convexity called L-convexity plays a central role. We observe first that the dual of the linear programming (LP) formulation of the shortest path ...

We establish a sharp maximal function estimate for some vector-valued multilinear singular integral operators. As an application, we obtain the $(L^p, L^q)$-norm inequality for vector-valued multilinear operators.

To the memory of my grandfather, Harold H. Hensold, Jr. In these notes we give a construction for a certain L-function attached to a globally generic automorphic representation of the quasi-split unitary group in 3 variables associated to a quadratic extension E/F of number fields. Recall that the finite Galois form of the L-group of this group is a semidirect product of GL3(C) and Gal(E/F ). T...

a topoframe, denoted by $l_{ tau}$,  is a pair $(l, tau)$ consisting of a frame $l$ and a subframe $ tau $ all of whose elements are complementary elements in$l$. in this paper, we define and study the notions of a$tau $-real-continuous function on a frame $l$ and the set of realcontinuous functions $mathcal{r}l_tau $ as an $f$-ring.we show that $mathcal{r}l_{ tau}$is actually a generalization ...

we establish a sharp maximal function estimate for some vector-valued multilinear singular integral operators. as an application, we obtain the $(l^p, l^q)$-norm inequality for vector-valued multilinear operators.

 A topoframe, denoted by $L_{ tau}$,  is a pair $(L, tau)$ consisting of a frame $L$ and a subframe $ tau $ all of whose elements are complementary elements in $L$. In this paper, we define and study the notions of a $tau $-real-continuous function on a frame $L$ and the set of real continuous functions $mathcal{R}L_tau $ as an $f$-ring. We show that $mathcal{R}L_{ tau}$ is actually a generali...