نتایج جستجو برای: plane problems

تعداد نتایج: 695842  

Journal: :Discrete Mathematics 1999
Bernardo M. Ábrego Jorge L. Arocha Silvia Fernández-Merchant Victor Neumann-Lara

A 3-uniform hypergraph is called tight if for any 3-coloring of its vertex set a heterochromatic edge can be found. In this paper we study tightness of 3-graphs with vertex set IR and edge sets arising from simple geometrical considerations. Basically we show that sets of triangles with \fat shadows" are tight and also that some interesting sets of triangles with \thin shadows" are tight.

Journal: :Journal of Combinatorial Theory, Series A 1978

Journal: :Discrete & Computational Geometry 1995

Journal: :Journal of the Japan Society for Aeronautical and Space Sciences 1971

Journal: :Proceedings of the American Mathematical Society 1965

Journal: :Transactions of the Japan Society of Mechanical Engineers 1960

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A 1985

Journal: :Proceedings in applied mathematics & mechanics 2021

The Lattice Boltzmann Method (LBM), e.g. in [3] and [4], can be interpreted as an alternative method for the numerical solution of partial differential equations. LBM is usually applied to solve fluid flows. However, interpretation a general tool, allows extend solid mechanics well. In this spirit, has been studied recent years. First publications [5], [6] present scheme dynamic behavior linear...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید