• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.517-521
• /
• 2011

In this paper, we introduce the concepts of m-convex set, mcconvex function and $m^*c$-convex function. We study basic properties for m-convex sets and characterization for such functions.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.853-868
• /
• 2015

Let G be a complex semisimple simply connected linear algebraic group. The main result of this note is to give several equivalent criteria for the untwistedness of the twisted cubes introduced by Grossberg and Karshon. In certain cases arising from representation theory, Grossberg and Karshon obtained a Demazure-type character formula for irreducible G-representations as a sum over lattice points (counted with sign according to a density function) of these twisted cubes. A twisted cube is untwisted when it is a "true" (i.e., closed, convex) polytope; in this case, Grossberg and Karshon's character formula becomes a purely positive formula with no multiplicities, i.e., each lattice point appears precisely once in the formula, with coefficient +1. One of our equivalent conditions for untwistedness is that a certain divisor on the special fiber of a toric degeneration of a Bott-Samelson variety, as constructed by Pasquier, is basepoint-free. We also show that the strict positivity of some of the defining constants for the twisted cube, together with convexity (of its support), is enough to guarantee untwistedness. Finally, in the special case when the twisted cube arises from the representation-theoretic data of $\lambda$ an integral weight and $\underline{w}$ a choice of word decomposition of a Weyl group element, we give two simple necessary conditions for untwistedness which is stated in terms of $\lambda$ and $\underline{w}$.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.