نتایج جستجو برای: extra regularity

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

Journal: :world journal of plastic surgery 0
muhammad humayun mohmand cosmetic plastic surgeon, la chirurgie, islamabad cosmetic surgery centre, islamabad, pakistan muhammad ahmad plastic, reconstructive surgeon, la chirurgie, islamabad cosmetic surgery centre, islamabad, pakistan

background breast augmentation is the most frequent procedure performed according to the 2009 quick facts report of the american society of plastic surgeons. this study presents the periareolar extra-glandular breast augmentation. methods from 2004 to 2010 among 32 female patients, peri-areolar incision was performed for breast augmentation. dissection was performed in subcutaneous plane toward...

Journal: :JPMA. The Journal of the Pakistan Medical Association 1988
N Moghal N A Jafarey

Journal: :Journal of Mathematical Analysis and Applications 2021

We consider a stochastic perturbation of the phase field alpha-Navier-Stokes model with vesicle-fluid interaction. It consists in system nonlinear evolution partial differential equations modeling fluid-structure interaction associated to dynamics an elastic vesicle immersed moving incompressible viscous fluid. This couples phase-field equation -for interface between fluid and vesicle- fluid- e...

2008

This does not make it look any easier to use; it makes it look even more foreboding. However, it is useful for the following reason. To use the pumping lemma to show that L is not regular, you have to show it does not satisfy the pumping lemma. Therefore you have to show that the NEGATION of the conclusion of the lemma is true. If you can intuitively understand how to form the negation of a log...

Journal: :علوم 0
کاظم حق نژاد آذر kazem haghnejad azar university of mohghegh ardabilدانشگاه محقق اردبیلی

in this paper, we study the arens regularity properties of module actions and we extend some proposition from baker, dales, lau and others into general situations. we establish some relationships between the topological centers of module actions and factorization properties of them with some results in group algebras. in 1951 arens shows that the second dual of banach algebra endowed with the e...

Journal: :Random Struct. Algorithms 2011
József Balogh Béla Csaba Wojciech Samotij

We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically almost surely contains a copy of every tree with maximum degree at most D and at most (1− α)n vertices, even after we delete a (1/2− γ)-fraction of the edges incident to each vertex. The proof uses Szemerédi’s regularity lem...

Journal: :Combinatorics, Probability & Computing 2011
Hoi H. Nguyen

We give a short proof for the following result on the distribution of three-term arithmetic progressions in sparse subsets of Fp : for every α > 0 there exists a constant C = C(α) such that the following holds for all r ≥ Cp and for almost all sets R of size r of Fp . Let A be any subset of R of size at least αr, then A contains a non-trivial three-term arithmetic progression. This is an analog...

2011
Boris Haspot

This paper is dedicated to the study of viscous compressible barotropic fluids in dimension N ≥ 2. We address the question of the global existence of strong solutions for initial data close to a constant state having critical Besov regularity. First, this article shows the recent results of [7] and [11] with a new proof. Our result relies on a new a priori estimate for the velocity that we deri...

Journal: :Electr. J. Comb. 2002
Yuejian Peng Vojtech Rödl Andrzej Rucinski

The celebrated Regularity Lemma of Szemerédi asserts that every sufficiently large graph G can be partitioned in such a way that most pairs of the partition sets span -regular subgraphs. In applications, however, the graph G has to be dense and the partition sets are typically very small. If only one -regular pair is needed, a much bigger one can be found, even if the original graph is sparse. ...

Journal: :J. Comb. Theory, Ser. B 2013
Stephen G. Hartke Tyler Seacrest

Nash-Williams [21] proved that every graph with n vertices and minimum degree n/2 has at least b5n/224c edge-disjoint Hamiltonian cycles. In [20], he raised the question of determining the maximum number of edge-disjoint Hamiltonian cycles, showing an upper bound of b(n+ 4)/8c. Let α(δ, n) = (δ + √ 2δn− n2)/2. Christofides, Kühn, and Osthus [7] proved that for every > 0, every graph G on a suff...

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

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