Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Problème de pavage parfait“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Problème de pavage parfait" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Problème de pavage parfait"
Da Ronch, Michaël. „problème de pavage“. Revue de Mathématiques pour l’école 231 (01.03.2019): 46–55. http://dx.doi.org/10.26034/vd.rm.2019.1765.
Der volle Inhalt der QuelleKarray, Mourad, und Guy Lefebvre. „Détection des cavités sous les pavages par l’analyse modal des ondes de Rayleigh (MASW)“. Canadian Geotechnical Journal 46, Nr. 4 (April 2009): 424–37. http://dx.doi.org/10.1139/t09-009.
Der volle Inhalt der QuelleKlarsfeld, Serge. „Juillet-septembre 1942. Les divergences dans l'appareil policier nazi et la réalisation de la Solution finale en France“. Annales. Histoire, Sciences Sociales 48, Nr. 3 (Juni 1993): 545–55. http://dx.doi.org/10.3406/ahess.1993.279151.
Der volle Inhalt der QuelleKeating, Norah. „Herbert C. Northcott Aging in Alberta: Rhetoric and Reality. Calgary, AB: Detselig Enterprises Ltd., 1992, pp. 117.“ Canadian Journal on Aging / La Revue canadienne du vieillissement 15, Nr. 1 (1996): 145–47. http://dx.doi.org/10.1017/s0714980800013349.
Der volle Inhalt der QuelleMeyer, Bernard, und Monique Dubucs. „Antonomases du Nom Commun“. Lingvisticæ Investigationes. International Journal of Linguistics and Language Resources 11, Nr. 1 (01.01.1987): 49–80. http://dx.doi.org/10.1075/li.11.1.03mey.
Der volle Inhalt der QuelleNeveu, Emilie, Laurent Debreu und François-Xavier Le Dimet. „Multigrid methods and data assimilation ― Convergence study and first experiments on non-linear equations“. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées Volume 14 - 2011 - Special... (21.08.2011). http://dx.doi.org/10.46298/arima.1944.
Der volle Inhalt der QuelleGervilla Castillo, Enrique. „La tiranía de la belleza, un problema educativo hoy. La estética del cuerpo como valor y como problema“. Teoría de la Educación. Revista Interuniversitaria 14 (13.11.2009). http://dx.doi.org/10.14201/2990.
Der volle Inhalt der QuelleSingleton, Michael. „Culte des ancêtres“. Anthropen, 2019. http://dx.doi.org/10.17184/eac.anthropen.092.
Der volle Inhalt der QuelleDissertationen zum Thema "Problème de pavage parfait"
Thiant, Nicolas. „Constructions et reconstructions de pavages de dominos“. Paris 6, 2006. http://www.theses.fr/2006PA066418.
Der volle Inhalt der QuelleZhou, Wenling. „Embedding problems in uniformly dense hypergraphs“. Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG092.
Der volle Inhalt der QuelleGiven 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
Houot, Jean Gabriel. „Analyse mathématique des mouvements des rigides dans un fluide parfait“. Thesis, Nancy 1, 2008. http://www.theses.fr/2008NAN10146/document.
Der volle Inhalt der QuelleIn this thesis we study the motion of rigid bodies in an incompressible perfect fluid. In the first part we study the potential fluids. The model problem is the motion of a disc in a half plan where we study the shocks between the disc and the wall. This problem is linked to the study of Neumann problems which depend on the trajectory of the disc. We generalize our results to the case of several bodies. We prove that the equations reduce to a system of ordinary differential equations on a finite dimensional manifold. The second part is devoted to the study of general case. We use the results developed in the previous part to transform the system of partial differential equations into a system of ordinary differential equations on a infinite dimensional manifold. So we obtain the local existence and uniqueness of the solution
Moutot, Etienne. „Autour du problème du Domino - Structures combinatoires et outils algébriques“. Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN027.
Der volle Inhalt der QuelleGiven a finite set of square tiles, the domino problem is the question of whether is it possible ta tile the plane using these tiles.This problem is known to be undecidable in the planar case, and is strongly linked ta the question of the periodicity of the tiling.ln this thesis we look at this problem in two different ways: we look at the particular case of low complexity tilings and we generalize it to more general structures than the plane: groups.A tiling of the plane is sa id of low complexity if there are at most mn rectangles of size m x n appearing in it. Nivat conjectured in 1997 that any such tiling must be periodic, with the consequence that the domino problem would be decidable for low complexity tilings. Using algebraic tools introduced by Kari and Szabados, we prove a generalized version of Nivat's conjecture for a particular class of tilings (a subclass of what is called of algebraic subshifts). We also manage to prove that Nivat's conjecture holds for uniformly recurrent tilings, with the consequence that the domino problem is indeed decidable for low-complexity tilings.The domino problem can be formulated in the more general context of Cayley graphs of groups. ln this thesis, we develop new techniques allowing to relate the Cayley graph of some groups with graphs of substitutions on words.A first technique allows us to show that there exists bath strongly periodic and weakly-but-not strongly a periodic tilings of the Baumslag-Solitar groups BS(l,n).A second technique is used to show that the domino problem is undecidable for surface groups. Which provides yet another class of groups verifying the conjecture saying that the domino problem of a group is decidable if and only if the group is virtually free
Kiwan, Rola. „Problèmes d'optimisation liés aux valeurs propres du Laplacien et aux pavages du plan [et] problèmes d'évolutions semi-linéaires“. Tours, 2007. http://www.theses.fr/2007TOUR4001.
Der volle Inhalt der QuelleIn this thesis, we consider first the optimal placement problem for the first Dirichlet Laplacian eingenvalue for plane domains with dihidral symetry, we then consider the same problem for the second eigenvalue of spherical shells. We solve the isoperimetric problem for plane domains who tile the plane by the action of a given lattice. Finally we study sufficient conditions for explosion in finite time for the solution of a non local parabolic problem as well as hyperbolic inequality
Hadjar, Ahmed. „Composition de polyèdres associés aux problèmes d'optimisation combinatoire“. Phd thesis, Grenoble INPG, 1996. http://tel.archives-ouvertes.fr/tel-00345405.
Der volle Inhalt der QuelleLe, Gloannec Bastien. „Coloriage du plan discret par jeux de tuiles déterministes“. Thesis, Orléans, 2014. http://www.theses.fr/2014ORLE2069/document.
Der volle Inhalt der QuelleIn this thesis, we study some properties of the sets of tilings generated by Wang tilesets that exhibit one or more directions of local determinism, focusing in particular on tilesets that are simultaneously deterministic in the four diagonal directions, referred to as 4-way deterministic. After having exposed an alternative construction of a 4-way deterministic aperiodic tileset, we study several decision problems on these objects and complete in particular Lukkarila’s result of undecidability of the Domino Problem in the 4-way deterministic setting proving the undecidability of the 4-way deterministic periodic Domino Problem. We also prove that some complex families of colorings of the plane such that those generated by substitutions remain sofic in the 4-way deterministic setting. We propose a bi-determinization of the constructions by Durand, Romashchenko and Shen of fixed-point tilesets and give some first applications. Finally, we investigate the idea of extending the radius of the local rule of determinism in order to reduce the set of directions of expansiveness and thus allow the local realization of non-trivial particles and collisions systems. We introduce a new and convenient syntactic model to deal with radius two and revisit some of Lukkarila’s problems in this setting
Nicolas, Dimitri. „Couplage de méthodes d'échantillonnage et de méthodes d'optimisation de formes pour des problèmes de diffraction inverse“. Phd thesis, Ecole Polytechnique X, 2012. http://pastel.archives-ouvertes.fr/pastel-00761675.
Der volle Inhalt der QuelleSalas, Donoso Ignacio Antonio. „Packing curved objects with interval methods“. Thesis, Nantes, Ecole des Mines, 2016. http://www.theses.fr/2016EMNA0277/document.
Der volle Inhalt der QuelleA common problem in logistic, warehousing, industrial manufacture, newspaper paging or energy management in data centers is to allocate items in a given enclosing space or container. This is called a packing problem. Many works in the literature handle the packing problem by considering specific shapes or using polygonal approximations. The goal of this thesis is to allow arbitrary shapes, as long as they can be described mathematically (by an algebraic equation or a parametric function). In particular, the shapes can be curved and non-convex. This is what we call the generic packing problem. We propose a framework for solving this generic packing problem, based on interval techniques. The main ingredients of this framework are: An evolutionary algorithm to place the objects, an over lapping function to be minimized by the evolutionary algorithm (violation cost), and an overlapping region that represents a pre-calculated set of all the relative configurations of one object (with respect to the other one) that creates an overlapping. This overlapping region is calculated numerically and distinctly for each pair of objects. The underlying algorithm also depends whether objects are described by inequalities or parametric curves. Preliminary experiments validate the approach and show the potential of this framework
Pasca, Bogdan Mihai. „Calcul flottant haute performance sur circuits reconfigurables“. Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2011. http://tel.archives-ouvertes.fr/tel-00654121.
Der volle Inhalt der Quelle