Literatura científica selecionada sobre o tema "Absorbing lemma"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Absorbing lemma".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Absorbing lemma"
Liu, Lin F., e Juan J. Nieto. "Dissipativity of Fractional Navier–Stokes Equations with Variable Delay". Mathematics 8, n.º 11 (16 de novembro de 2020): 2037. http://dx.doi.org/10.3390/math8112037.
Texto completo da fonteAbdullah, Omer, e Haibat Karim Mohammadali. "Extend Nearly Pseudo Quasi-2-Absorbing submodules(I)". Ibn AL-Haitham Journal For Pure and Applied Sciences 36, n.º 2 (20 de abril de 2023): 341–53. http://dx.doi.org/10.30526/36.2.3019.
Texto completo da fonteSun, Chunyou, e Yanbo Yuan. "Lp-type pullback attractors for a semilinear heat equation on time-varying domains". Proceedings of the Royal Society of Edinburgh: Section A Mathematics 145, n.º 5 (2 de setembro de 2015): 1029–52. http://dx.doi.org/10.1017/s0308210515000177.
Texto completo da fonteRyvak, R., T. Synyshyna e H. Harvas. "STUDY OF ABSORBENT PROPERTIES OF FRESHWATER ALGAE LEMNA MINOR ACCORDING TO THE LEVEL OF IODINE ACCUMULATION". Scientific and Technical Bulletin оf State Scientific Research Control Institute of Veterinary Medical Products and Fodder Additives аnd Institute of Animal Biology 25, n.º 1 (16 de maio de 2024): 147–53. http://dx.doi.org/10.36359/scivp.2024-25-1.20.
Texto completo da fonteHoell, J., D. E. Liebscher e W. Priester. "Confirmation of the Friedmann-Lema??tre universe by the distribution of the larger absorbing clouds". Astronomische Nachrichten 315, n.º 2 (1994): 89–96. http://dx.doi.org/10.1002/asna.2103150202.
Texto completo da fontePopescu, Sever Angel. "Absorbent property, Krasner type lemmas and spectral norms for a class of valued fields". Proceedings of the Japan Academy, Series A, Mathematical Sciences 89, n.º 10 (outubro de 2013): 138–43. http://dx.doi.org/10.3792/pjaa.89.138.
Texto completo da fontePang, Yean Ling, Yen Ying Quek, Steven Lim e Siew Hoong Shuit. "Review on Phytoremediation Potential of Floating Aquatic Plants for Heavy Metals: A Promising Approach". Sustainability 15, n.º 2 (10 de janeiro de 2023): 1290. http://dx.doi.org/10.3390/su15021290.
Texto completo da fonteRoslan, Mohd Naqib Azfar Mohd, Abentin Estim, Balu Alagar Venmathi Maran e Saleem Mustafa. "Effects of Aquatic Plants on Nutrient Concentration in Water and Growth Performance of Fantail Goldfish in an Aquaculture System". Sustainability 13, n.º 20 (12 de outubro de 2021): 11236. http://dx.doi.org/10.3390/su132011236.
Texto completo da fonteMarda, Alexander Burhani, Kukuh Nirmala, Enang Harris e Eddy Supriyono. "The effectiveness of Lemna perpusilla as phytoremediation agent in giant gourami culture media on 3 ppt". Jurnal Akuakultur Indonesia 14, n.º 2 (15 de outubro de 2015): 122. http://dx.doi.org/10.19027/jai.14.122-127.
Texto completo da fonteDAVVAZ, Bijan, Gülşen ULUCAK e Ünsal TEKİR. "weakly $ (k,n) $-absorbing (primary) hyperideals of a Krasner $ (m,n) $-hyperring". Hacettepe Journal of Mathematics and Statistics, 31 de dezembro de 2023, 1–10. http://dx.doi.org/10.15672/hujms.1199437.
Texto completo da fonteTeses / dissertações sobre o assunto "Absorbing lemma"
Zhou, Wenling. "Embedding problems in uniformly dense hypergraphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG092.
Texto completo da fonteGiven a k-graph (k-uniform hypergraph) F, the Turán density π(F) of F is the maximum density among all F-free k-graphs. Determining π(F) for a given k-graph F is a classical extremal problem. Given two k-graphs F and H, a perfect F-tiling (or F-factor) of H is a collection of vertex-disjoint copies of F in H that together cover all the vertices of H. Perfect tiling problems, as a strengthening of the Turán problem, aim to find extremal conditions on H which guarantee an F-factor, which also has a long and profound history. In this thesis, we use many powerful tools including the probabilistic method, hypergraph regularity method and absorbing method to study Turán densities and perfect tilings of given k-graphs F in uniformly dense hypergraphs. Unlike graphs, we all know that there are several non-equivalent notions of quai-randomness in k-graphs for k ≥ 3. Hence, our work also has several non-equivalent definitions of uniformly dense k-graphs. Roughly speaking, a k-graph H is (d, μ, ⋆)-dense means that it is d-dense and ⋆-quai-randomness for some small μ > 0 with respect to given random structures. Restricting to (d, μ, 1)-dense 3-graphs, the Turán density of a given 3-graph F is denoted by π1(F). Determining π1(F) was suggested by Erdős and Sós in the 1980s. In 2018, Reiher, Rödl and Schacht extended the concept of (d, μ, 1)-dense 3-graphs to (d, μ, k-2)-dense k-graphs for k ≥ 3, and they proposed the study of uniform Turán density πk-2(F) for a given k-graph F in (d, μ, k-2)-dense k-graphs. In particular, they showed that πk-2(•) “jumps” from 0 to at least k-to-the-minus-kth-power. In this thesis, we obtain a sufficient condition for 3-graphs F which satisfy π1(F)= 1/4. Interestingly, currently all known 3-graphs F whose π1(F) is 1/4 satisfy this condition. In addition, we also construct some intriguing 3-graphs F with π1(F) = 1/4. For k-graphs, we give a framework to study πk-2(F) for any k-graph F. By using this framework, we give a sufficient condition for k-graphs F satisfying πk-2(F) is k-to-the-minus-kth-power, and construct an infinite family of k-graphs with πk-2(F) is k-to-the-minus-kth-power.In 2016, Lenz and Mubayi posed the problem of characterizing the k-graphs F such that every sufficiently large (d, μ, dot)-dense k-graph H with d > 0, v(F)|v(H) and positive minimum vertex degree contains an F-factor. Motivated by this problem, we prove a general theorem on F-factors which reduces the F-factors problem of Lenz and Mubayi to a natural sub-problem, that is, the F-cover problem. By using this result, we answer the question of Lenz and Mubayi for those F which are k-partite k-graphs and for all 3-graphs F, separately. In the work of Lenz and Mubayi, they also constructed a sequence of (1/8, μ, dot)-dense 3-graphs with positive minimum vertex degree having no F-factor, where F is a balanced complete 3-partite 3-graph. In this thesis, we prove that 1/8 is the density threshold for ensuring all 3-partite 3-graphs perfect tilings in (d, μ, dot)-dense 3-graphs given a minimum codegree condition Ω(n). Moreover, we show that one can not replace the minimum codegree condition with a minimum vertex degree condition. In particular, we study the optimal density threshold of F-factors for each 3-partite 3-graph F in (d, μ, dot)-dense 3-graphs with minimum codegree Ω(n). In addition, we also study F-factor problems for k-partite k-graphs F with stronger quasi-random assumption and positive minimum 1-degree