Gotowa bibliografia na temat „Perfect tiling problem”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Perfect tiling problem”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Perfect tiling problem"
MOSSERI, RÉMY, i FRANCIS BAILLY. "CONFIGURATIONAL ENTROPY IN OCTAGONAL TILING MODELS". International Journal of Modern Physics B 07, nr 06n07 (marzec 1993): 1427–36. http://dx.doi.org/10.1142/s0217979293002419.
Pełny tekst źródłaSadeghi Bigham, Bahram, Mansoor Davoodi Monfared, Samaneh Mazaheri i Jalal Kheyrabadi. "Tiling Rectangles and the Plane Using Squares of Integral Sides". Mathematics 12, nr 7 (29.03.2024): 1027. http://dx.doi.org/10.3390/math12071027.
Pełny tekst źródłaSchauer, Lucas, Michael J. Schmidt, Nicholas B. Engdahl, Stephen D. Pankavich, David A. Benson i Diogo Bolster. "Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes". Geoscientific Model Development 16, nr 3 (3.02.2023): 833–49. http://dx.doi.org/10.5194/gmd-16-833-2023.
Pełny tekst źródłaLeclercq, F., B. Faure, G. Lavaux, B. D. Wandelt, A. H. Jaffe, A. F. Heavens i W. J. Percival. "Perfectly parallel cosmological simulations using spatial comoving Lagrangian acceleration". Astronomy & Astrophysics 639 (lipiec 2020): A91. http://dx.doi.org/10.1051/0004-6361/202037995.
Pełny tekst źródłaEtzion, Tuvi, i Alexander Vardy. "On Perfect Codes and Tilings: Problems and Solutions". SIAM Journal on Discrete Mathematics 11, nr 2 (maj 1998): 205–23. http://dx.doi.org/10.1137/s0895480196309171.
Pełny tekst źródłaMiltsios, G. K., D. J. Patterson i T. C. Papanastasiou. "Solution of the Lubrication Problem and Calculation of the Friction Force on the Piston Rings". Journal of Tribology 111, nr 4 (1.10.1989): 635–41. http://dx.doi.org/10.1115/1.3261988.
Pełny tekst źródłaGutzwiller, Les, i Mark A. Corbo. "Vibration and Stability of 3000-hp, Titanium Chemical Process Blower". International Journal of Rotating Machinery 9, nr 3 (2003): 197–217. http://dx.doi.org/10.1155/s1023621x03000186.
Pełny tekst źródłaAraujo, Igor, Simón Piga, Andrew Treglown i Zimu Xiang. "Tiling problems in edge-ordered graphs". European Conference on Combinatorics, Graph Theory and Applications, nr 12 (28.08.2023). http://dx.doi.org/10.5817/cz.muni.eurocomb23-010.
Pełny tekst źródłaAamand, Anders, Mikkel Abrahamsen, Peter M. R. Rasmussen i Thomas D. Ahle. "Tiling with Squares and Packing Dominos in Polynomial Time". ACM Transactions on Algorithms, 23.05.2023. http://dx.doi.org/10.1145/3597932.
Pełny tekst źródłaRindang, Dhana Dharu, i Pramukhtiko Suryo. "Implementasi E-Tilang Bagi Pelanggar Lalu Lintas di Kabupaten Jember Berdasarkan Peraturan Pemerintah Nomor 80 Tahun 2012 Tentang Tata Cara Pemeriksaan Kendaraan Bermotor di Jalan dan Penindakan Pelanggaran Lalu Lintas dan Angkutan Jalan". Journal of Contemporary Law Studies 1, nr 1 (16.11.2023). http://dx.doi.org/10.47134/lawstudies.v1i1.1950.
Pełny tekst źródłaRozprawy doktorskie na temat "Perfect tiling problem"
Zhou, Wenling. "Embedding problems in uniformly dense hypergraphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG092.
Pełny tekst źródłaGiven 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