نتایج جستجو برای: for alexandr sergeyevich pushkin

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

2010
Nikolay N. Nikolaenko Maria Pachalska

Most traditional neuropsychological work concerns aspects of cognition in the most ordinary sense: how the average person perceives and represents the world, and how she acts in response to what is perceived or felt. The extraordinary perception and action of artists has been a subject of fascination for some neuropsychologists at least since Alajouanine, but little systematic work has been don...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ولی عصر (عج) - رفسنجان - دانشکده ریاضی و کامپیوتر 1389

in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...

Journal: :پژوهش ادبیات معاصر جهان 0
مهناز رهبری دانشگاه تهران علیرضا ولی پور دانشگاه تهران

alexander sergeyevich griboyedov was a russian diplomat, playwright, and composer. he is recognized in russian literature as a dramatist and writer of a book, whose fame rests on the brilliant verse comedy woe from wit (the woes of wit), a satire on russian aristocratic society which continus to be one of the most often staged plays in russia. however, in iran he is known as the great russian a...

2011
Alexandr V. Kostochka Christopher Stocker Michael Albertson

9 An acyclic coloring is a proper coloring with the additional property that the union of 10 any two color classes induces a forest. We show that every graph with maximum degree at 11 most 5 has an acyclic 7-coloring. We also show that every graph with maximum degree at 12 most r has an acyclic (1 + b (r+1) 2 4 c)-coloring. 13

2009
Alexandr Kazda

Möbius number systems represent points using sequences of Möbius transformations. Thorough the paper, we are mainly interested in representing the unit circle (which is equivalent to representing R ∪ {∞}). The main aim of the paper is to improve already known tools for proving that a given subshift–iterative system pair is in fact a Möbius number system. We also study the existence problem: How...

2009
Alexandr V. Kostochka Daniel Král Jean-Sébastien Sereni Michael Stiebitz

We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε.

2011
Alexandr Kostochka

Alexandr Kostochka In search of ways to attack Hadwiger’s Conjecture, Woodall and independently Seymour suggested to prove the weaker conjecture that Every (s + t)-chromatic graph has a Ks,t-minor. If the conjecture were true for all values of s and t, it would imply that for k ≥ 2 every (2k − 2)-chromatic graph has a Kk-minor. The conjecture is evident for s = 1. The validity of the conjecture...

2015
Shinsuke Tomita Daniel M. Parker Julia A. Jennings James Wood

This paper extends Alexandr Chayanov's model of changing household demography (specifically the ratio of food consumers to food producers) and its influence on agricultural behavior so that it includes possible adverse effects of a rising ratio on nutritional status and early childhood mortality within the household. We apply the model to 35 years' worth of longitudinal demographic and economic...

1995
M. Alexandrov

In Batalin-Vilkovisky formalism a classical mechanical system is specified by means of a solution to the classical master equation. Geometrically such a solution can be considered as a QP -manifold, i.e. a supermanifold equipped with an odd vector field Q obeying {Q,Q} = 0 and with Q-invariant odd symplectic structure. We study geometry of QP manifolds. In particular, we describe some construct...

Journal: :Известия Русского географического общества 2019

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

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