814 research outputs found
Separation of variables for quantum integrable models related to
In this paper we construct separated variables for quantum integrable models
related to the algebra . This generalizes the results by
Sklyanin for .Comment: 12 pages, Latex, AMS font
Solutions to Knizhnik-Zamolodchikov equations with coefficients in non-bounded modules
We explicitly write dowm integral formulas for solutions to
Knizhnik-Zamolodchikov equations with coefficients in non-bounded -- neither
highest nor lowest weight -- \gtsl_{n+1}-modules. The formulas are closely
related to WZNW model at a rational level.Comment: 13 page
KINEMATICS OF MATERIAL REMOVAL AND FORMING OF SURFACE AT GRINDING
The mathematical model of kinematics of material removal and a forming of surfaces isdeveloped at grinding. Conditions of increase of productivity of processing are defined and newkinematic schemes of high-performance grinding are offere
Slimness of graphs
Slimness of a graph measures the local deviation of its metric from a tree
metric. In a graph , a geodesic triangle with
is the union of three shortest
paths connecting these vertices. A geodesic triangle is
called -slim if for any vertex on any side the
distance from to is at most , i.e. each path
is contained in the union of the -neighborhoods of two others. A graph
is called -slim, if all geodesic triangles in are
-slim. The smallest value for which is -slim is
called the slimness of . In this paper, using the layering partition
technique, we obtain sharp bounds on slimness of such families of graphs as (1)
graphs with cluster-diameter of a layering partition of , (2)
graphs with tree-length , (3) graphs with tree-breadth , (4)
-chordal graphs, AT-free graphs and HHD-free graphs. Additionally, we show
that the slimness of every 4-chordal graph is at most 2 and characterize those
4-chordal graphs for which the slimness of every of its induced subgraph is at
most 1
- …