Relevant bibliographies by topics / Problème de Turán

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Problème de Turán'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Problème de Turán.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Problème de Turán"

1

KEEVASH, PETER, DHRUV MUBAYI, BENNY SUDAKOV, and JACQUES VERSTRAËTE. "Rainbow Turán Problems." Combinatorics, Probability and Computing 16, no. 01 (September 4, 2006): 109. http://dx.doi.org/10.1017/s0963548306007760.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bollobás, Béla. "Turán-Ramsey problems." Discrete Mathematics 156, no. 1-3 (September 1996): 257–62. http://dx.doi.org/10.1016/0012-365x(96)00024-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Keevash, Peter, Mike Saks, Benny Sudakov, and Jacques Verstraëte. "Multicolour Turán problems." Advances in Applied Mathematics 33, no. 2 (August 2004): 238–62. http://dx.doi.org/10.1016/j.aam.2003.08.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Frankl, Peter, Hao Huang, and Vojtěch Rödl. "On local Turán problems." Journal of Combinatorial Theory, Series A 177 (January 2021): 105329. http://dx.doi.org/10.1016/j.jcta.2020.105329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

BOLLOBÁS, BÉLA, IMRE LEADER, and CLAUDIA MALVENUTO. "Daisies and Other Turán Problems." Combinatorics, Probability and Computing 20, no. 5 (August 18, 2011): 743–47. http://dx.doi.org/10.1017/s0963548311000319.

Full text
Abstract:
Our aim in this note is to make some conjectures about extremal densities of daisy-free families, where a ‘daisy’ is a certain hypergraph. These questions turn out to be related to some Turán problems in the hypercube, but they are also natural in their own right. We start by giving the daisy conjectures, and some related problems, and shall then go on to describe the connection with vertex-Turán problems in the hypercube.
APA, Harvard, Vancouver, ISO, and other styles
6

Mubayi*, Dhruv, and Vojtěch Rödl†. "Supersaturation For Ramsey-Turán Problems." Combinatorica 26, no. 3 (June 2006): 315–32. http://dx.doi.org/10.1007/s00493-006-0018-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mubayi, Dhruv, and Yi Zhao. "Non-uniform Turán-type problems." Journal of Combinatorial Theory, Series A 111, no. 1 (July 2005): 106–10. http://dx.doi.org/10.1016/j.jcta.2004.11.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bennett, Patrick, Sean English, and Maria Talanda-Fisher. "Weighted Turán problems with applications." Discrete Mathematics 342, no. 8 (August 2019): 2165–72. http://dx.doi.org/10.1016/j.disc.2019.04.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Frankl, Peter, and Jiaxi Nie. "On asymptotic local Turán problems." Moscow Journal of Combinatorics and Number Theory 12, no. 4 (December 8, 2023): 273–86. http://dx.doi.org/10.2140/moscow.2023.12.273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mani, Nitya, and Edward Yu. "Turán problems for mixed graphs." Journal of Combinatorial Theory, Series B 167 (July 2024): 119–63. http://dx.doi.org/10.1016/j.jctb.2024.02.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Problème de Turán"

1

Zhou, Wenling. "Embedding problems in uniformly dense hypergraphs." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG092.

Full text
Abstract:
Étant donné un k-graph (hypergraphe k-uniforme) F, la densité de Turán π(F) de F est la densité maximale parmi tous les k-graphes F-libres. Déterminer π(F) pour un k-graph donné F est un problème extrémal classique. Étant donnés deux k-graphes F et H, un F-facteur de H est une collection de copies de F disjointes sur les sommets de H qui couvrent ensemble tous les sommets de H. Les problèmes de F-facteurs, en tant que renforcement du problème de Turán, visent à trouver des conditions extrémales sur H garantissant un F-facteur, ce qui a également une histoire longue et profonde. Dans cette thèse, nous utilisons de nombreux outils puissants, dont la méthode probabiliste, la méthode de régularité des hypergraphes et la méthode d'absorption, pour étudier les densités de Turán et les F-facteurs de k-graphes F donnés dans des hypergraphes uniformément denses. Contrairement aux graphes, nous savons tous qu'il existe plusieurs notions non équivalentes de quasi-aléatoire dans les k-graphes pour k ≥ 3. Par conséquent, notre travail propose également plusieurs définitions non équivalentes de k-graphes uniformément denses. En gros, un k-graphe H est (d, μ, ⋆)-dense signifie qu'il est d-dense et ⋆-quasi-aléatoire pour une petite valeur de μ > 0 par rapport à des structures aléatoires données. En se limitant aux 3-graphes (d, μ, 1)-dense, la densité de Turán d'un 3-graphe donné F est notée π1(F). La détermination de π1(F) a été suggérée par Erdős et Sós dans les années 1980. En 2018, Reiher, Rödl et Schacht ont étendu le concept de 3-graphes (d, μ, 1)-dense à des k-graphes (d, μ, k-2)-dense pour k ≥ 3, et ils ont proposé l'étude de la densité de Turán uniforme πk-2(F) pour un k-graphe donné F dans des k-graphes (d, μ, k-2)-dense. En particulier, ils ont montré que πk-2(•) saute de 0 à au moins k-à-la-moins-k-ème puissance. Dans cette thèse, nous obtenons une condition suffisante pour les 3-graphes F qui satisfont π1(F) = 1/4. De manière intéressante, actuellement, tous les 3-graphes F connus dont π1(F) est de 1/4 satisfont cette condition. De plus, nous construisons également quelques 3-graphes intrigants F avec π1(F) = 1/4. Pour les k-graphes, nous donnons un cadre pour étudier πk-2(F) pour n'importe quel k-graphe F. En utilisant ce cadre, nous donnons une condition suffisante pour les k-graphes F satisfaisant πk-2(F) est k-à-la-moins-k-ème puissance, et nous construisons une famille infinie de k-graphes avec πk-2(F) est k-à-la-moins-k-ème puissance. En 2016, Lenz et Mubayi ont posé le problème de caractériser les k-graphes F tels que chaque k-graphe H suffisamment grand (d, μ, dot)-dense avec d > 0, v(F)|v(H) et un degré minimum de sommet positif contient un F-facteur. Motivés par ce problème, nous démontrons un théorème général sur les F-facteurs qui réduit le problème des F-facteurs de Lenz et Mubayi à un sous-problème naturel, c'est-à-dire le problème de F-cover. En utilisant ce résultat, nous répondons à la question de Lenz et Mubayi pour ceux F qui sont des k-graphes k-partis et pour tous les 3-graphes F, séparément. Dans le travail de Lenz et Mubayi, ils ont également construit une séquence de 3-graphes (1/8, μ, dot)-dense avec un degré minimum de sommet positif n'ayant pas de F-facteur, où F est un 3-graph k-parti complet équilibré. Dans cette thèse, nous prouvons que 1/8 est le seuil de densité pour garantir tous les 3-graphes 3-partis facteurs dans (d, μ, dot)-dense 3-graphes avec une condition de minimum degré de sommet Ω(n). De plus, nous montrons que l'on ne peut pas remplacer la condition de minimum degré de sommet par une condition de minimum degré de sommet. En particulier, nous étudions le seuil de densité optimal des F-facteurs pour chaque 3-graph 3-parti F dans (d, μ, dot)-dense 3-graphes avec un minimum degré de sommet Ω(n). De plus, nous étudions également les problèmes de F-facteurs pour les k-graphes k-partis F avec une hypothèse quasi-aléatoire plus forte et un minimum degré de sommet positif
Given 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
APA, Harvard, Vancouver, ISO, and other styles
2

Lantz, Emilott. "What can Turán tell us about the hypercube?" Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-57789.

Full text
Abstract:
The Turán problem is a fundamental problem in extremal graph theory. It asks what the maximum number of edges a given graph G can have, not containing some forbidden graph H, and is solved using the Turán number ex(n,H), density π(H) and graph Tr(n). Turán's theorem tells us that the Turán graph Tr(n) is the largest Kr+1-free simple graph on n vertices. This paper is an overview of Turán problems for cliques Kn, hypercubes Qn and Hamming graphs H(s,d). We end it by proving a new result we call "the layer theorem", solving the Hamming-Turán problem using a method of creating layers of vertices in a graph. This theorem gives a lower bound for the Hamming-relative Turán density as follows:  where  for the forbidden graph F stretching over t layers and r = χ(F).
Turán-problemet är det fundamentala problemet inom extremal grafteori. Det ställer frågan vad det maximala antalet kanter en given graf G kan ha utan att innehålla någon förbjuden graf H, och löses med hjälp av Turán-talet ex(n,H), -densiteten π(H) and -grafen Tr(n). Turáns sats säger oss att Turán-grafen Tr(n) är den största Kr+1-fria enkla grafen på n hörn. Denna uppsats är en överblick av Turán-problem i klickar Kn, hyperkuber Qn och Hamming-grafer H(s,d). Vi avslutar den med att bevisa ett nytt resultat som vi kallar "lagersatsen", vilket löser Hamming-Turán-problemet med hjälp av en metod som skapar lager av hörnen i en graf. Lagersatsen ger en undre gräns för den Hamming-relativa Turán-densiteten enligt följande:  där  för den förbjudna grafen F som sträcker sig över t lager samt r = χ(F).
APA, Harvard, Vancouver, ISO, and other styles
3

Celik, Melih. "The Order-picking Problem In Parallel-aisle Warehouses." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12610646/index.pdf.

Full text
Abstract:
Order-picking operations constitute the costliest activities in a warehouse. The order-picking problem (OPP) aims to determine the route of the picker(s) in such a way that the total order-picking time, hence the order-picking costs are minimized. In this study, a warehouse that consists of parallel pick aisles is assumed, and various versions of the OPP are considered. Although the single-picker version of the problem has been well studied in the literature, the multiple-picker version has not received much attention in terms of algorithmic approaches. The literature also does not take into account the time taken by the number of turns during the picking route. In this thesis, a detailed discussion is made regarding the computational complexity of the OPP with a single picker. A heuristic procedure, which makes use of the exact algorithm for the OPP with no middle aisles, is proposed for the single-picker OPP with middle aisles, and computational results on randomly generated problems are given. Additionally, an evolutionary algorithm that makes use of the cluster-first, route-second and route-first, cluster-second heuristics for the VRP is provided. The parameters of the algorithm are determined based on preliminary runs and the algorithm is also tested on randomly generated problems, with different weights given to the cluster-first, route-second and route-first, cluster-second approaches. Lastly, a polynomial time algorithm is proposed for the problem of minimizing the number of turns in a parallel-aisle warehouse.
APA, Harvard, Vancouver, ISO, and other styles
4

Benvenuti, Andrea. "The end of the affair : Britain's turn to Europe as a problem in Anglo-Australian relations (1961-72)." Thesis, University of Oxford, 2003. http://ora.ox.ac.uk/objects/uuid:4cdd0762-669b-4370-9ceb-b93dfe4336b1.

Full text
Abstract:
This thesis is an historical account based on primary sources in Australia and Britain. It seeks to explain why Anglo-Australian relations underwent radical change during the 1960s and why the ties of empire which had once bound Australia and Britain, became, for all practical purposes, inconsequential by the early 1970s. It is the main contention of the thesis that this radical change can be broadly attributed to what has been described as Britain's turn to Europe. In the 1960s Britain's foreign, defence and trade policies underwent a profound revision as Britain endeavoured to redefine its emerging post-imperial role. British policy-makers gradually turned away from an imperial and global focus and their orientation became increasingly more European. This process of reorientation can be seen principally in the series of policies implemented by successive British governments during the 1960s and early 1970s: the three applications for EEC membership between 1961 and 1972 and the decision taken in 1967-68 to withdraw from east of Suez. Both the EEC applications and the withdrawal from east of Suez brought about an irreconcilable conflict of interest between the two countries. The relationship suffered under the strains imposed by Britain's reassessment of its imperial policy-making. This thesis explains how Australia perceived these challenges, the manner of its response to them and the policies successive Australian governments implemented to minimise their impact. The thesis argues that, anxious not to antagonise Britain for fear it would drift further away, Australian policy-makers avoided too confrontational a stance. They gradually accepted the developing new realities and sought to diversify their country's trading options away from its traditional markets in Britain towards the Asia-Pacific region, while also cautiously redefining its strategic priorities in Asia.
APA, Harvard, Vancouver, ISO, and other styles
5

Thompson, Damian. "The problem of the end : a sociological study of the management of apocalyptic faith at Kensington Temple, a London Pentecostal church, at the turn of the millennium." Thesis, London School of Economics and Political Science (University of London), 2003. http://etheses.lse.ac.uk/2667/.

Full text
Abstract:
This thesis is a sociological study of the management of apocalyptic belief in Kensington Temple, a Pentecostal church in London, in the years 1997-2000. Apocalyptic or millenarian beliefs, in which the supernatural end of the world lies just around the corner, have often been explained in terms of material deprivation or psychological disturbance. This study shows how members of a church with an apocalyptic tradition reconciled the doctrine of the Second Coming with their daily lives. It rejects the idea that there is a simple cause of apocalyptic beliefs, focussing instead on millenarianism as a form of rhetoric whose prophecies are constantly overtaken by events - a phenomenon referred to as "the Problem of the End". Throughout history, members of apocalyptic religions have modified millenarian theology until its social costs are outweighed by its benefits. In practice, this has often meant the replacement of risky, time-specific predictions of Doomsday (predictive millenarianism) by apocalyptic narratives whose function is to account for features of the contemporary world (explanatory millenarianism). The data from Kensington Temple, which includes the results of a survey of 2,973 worshippers, points in this direction. It shows that worshippers assigned a low priority to the concept of the "End Times", subjecting it to the same rational scrutiny that they applied to other spiritual claims. Almost none of them expected the year 2000 to bring the Second Coming of Christ, though it did serve as a deadline for an unsuccessful plan to create a network of 2,000 church groups that carried eschatological overtones. The thesis concludes that the fragmentation of religious meaning in modern society undermines the plausibility of apocalyptic prophecies, at least in the industrialised West; literal belief in millenarian doctrines is a casualty of secularisation.
APA, Harvard, Vancouver, ISO, and other styles
6

Abia, Sonny D. "Application of Reliability Analysis to Highway Design Problems: Superelevation (e) Design, Left Turn Bay Design-Safety Evaluation and Effect of Variation of Peak Hour Volumes on Intersection Signal Delay Performance." Scholarly Repository, 2010. http://scholarlyrepository.miami.edu/oa_dissertations/447.

Full text
Abstract:
This research has three parts. Part 1: The Policy on Geometric Design of Highways and Street provides 5 methods of superelevation (e) distribution. Many states use methods 2 and 5 for low speed, urban and rural high-speed facilities. Method 5 aims to address speed variations; but is complicated, computationally intractable and may violate design consistency. Design recommendation by NCHRP439 accounts for speed variation, tractable; but is cumbersome along with irregular/step-wise design curves. New reliability based e distribution method is developed that addresses the speed variation; which is simple in determining and evaluating acceptable required e rates. At 95% level of reliability, the e rate obtained is lower than that from current practice resulting in cost savings. Part 2: Current practice/research does not address safety issue of the left-turn-bay at high degree of saturation (x). Left-Turn-Bay distance has three components: clearance, breaking to a stop and queue. The variation in the queue length reduces clearance and breaking distance resulting in unsafe breaking. Failure = clearance plus breaking distance < demand. The reliability of the left-turn-bay defined as the availability of the three components for left-turning vehicles to complete clearance and breaking maneuver safely; measured as increase in the deceleration rate over limit of 11.2ft/s2, safety index and probability of failure. Results show that at 95% reliability, current design practice fails when x exceeds 50%. Part 3: Current practice uses mean traffic volumes (Vd) as input for traffic signal control at roadway intersections. Variations in traffic flows affect the performance of intersection measured by the delay per vehicle traversing the intersection in seconds. Peak hour factor (PHF), the hourly volume divided by the peak 15-min flow rate within the peak hour is adopted by Highway Capacity Manual (HCM) to control surge. HCM suggests PHF design value of 0.92 for urban and 0.88 for rural areas. Fixed PHF may lead to increase in delay. Effects of variation of peak hour volumes on intersection signal delays are examined with large data. A new model is developed for PHF and Vd and used in signal timing to minimize intersection delay. The results show that the assumption of Poisson distribution for Vd is not reliable; delay reduction of 6.2 seconds per vehicle is achieved. Annual savings in travel time, fuel consumption and emissions cost is estimated in billions of dollars.
APA, Harvard, Vancouver, ISO, and other styles
7

Cunha, Carla Maria Santana Duarte Correia da. "Minimização do número de más viragens na recolha de resíduos sólidos urbanos." Master's thesis, Instituto Superior de Economia e Gestão, 2001. http://hdl.handle.net/10400.5/18825.

Full text
Abstract:
Mestrado em Matemática Aplicada à Economia e à Gestão
O problema da determinação de percursos a efectuar por veículos afectos à remoção de resíduos sólidos urbanos pode ser visto como um problema de optimização de rotas, com procura nos arcos e restrições adicionais. Usualmente os algoritmos para determinar soluções admissíveis para este tipo de problemas não têm em conta o tipo de viragem que os veículos são obrigados a fazer. Dadas as características dos veículos envolvidos na recolha de resíduos, entende-se por má viragem uma inversão de marcha ou uma viragem à esquerda. Na prática é, em geral, exigida a minimização do número de más viragens, devendo mesmo algumas ser impossibilitadas, quer por se tornarem perigosas, quer por questões de regras de trânsito. Neste trabalho o problema da minimização do número de más viragens é definido e modelizado como um problema de redes. São desenvolvidos métodos para a determinação de soluções admissíveis. Os métodos implementados são testados num conjunto de problemas teste gerados aleatoriamente. Como se mostra, os resultados podem ser considerados bastante bons, dado permitirem obter soluções com um baixo número de más viragens sendo evitadas a quase totalidade das inversões de marcha proibidas. Muito embora a heurística se baseie na expansão da rede nos nodos onde as inversões de marcha não são permitidas, os resultados permitiram concluir que nem todos os nodos têm que ser expandidos para que as respectivas inversões de marcha sejam impossibilitadas.
Finding the optimal set of tours for vehicles dedicated to household refuse collection can be looked at as an are routing problem with additional constraints. Typically, the algorithms used in determining feasible solutions to these problems do not account for the type of turn that the vehicles actually must perform. Given the specifíc characteristics of the vehicles assigned to household refuse collection, a bad-turn translates to a U-turn or to a left-turn. In practical terms it is generally mandatory to minimize the total number of bad-turns, some of which really must be avoided either due to its intrinsic danger or to traffic regulation restrictions. Throughout this thesis the problem of minimizing the number of bad-turns is defmed and modeled as a network problem. Some methods are developed to determine feasible solutions. These methods have been tested over a set of randomly generated problems. It is shown that the overall results are to be considered pretty good since they represent feasible solutions with a very low number of bad-turns, where nearly every forbidden U-turns are avoided.
info:eu-repo/semantics/publishedVersion
APA, Harvard, Vancouver, ISO, and other styles
8

Ritucci, Raffaella. "Bambine e ragazzi bilingui nelle classi multietniche di Torino." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19485.

Full text
Abstract:
Das Schulregister des Kultusministeriums MIUR verzeichnet, dass mehr als jede/r zehnte aller Schüler/innen in Italien keine italienische Staatsbürgerschaft hat, obwohl sie mehrheitlich dort geboren wurden. Zahlreiche Erhebungen weisen für sie im Vergleich zu den italienischen Mitschülern/innen geringere Italienischkenntnisse und weniger schulischen Erfolg auf. Innerhalb dieser explorativen Feldforschung haben Einzelinterviews mit 121 Schülern/innen (5.-8. Klasse) in Turiner Schulen und mit 26 Eltern, sowie die Auswertung von 141 an 27 Italienisch- und Herkunftsprachlehrer/innen verteilten Fragebögen ergeben, dass viele Schüler/innen "zweisprachige Natives" sind, da sie mit Italienisch und einer anderen Sprache aufwachsen. Dieser Polyglottismus, den die Interviewten sehr positiv bewerteten, findet jedoch in der Schulpraxis keine Entsprechung: Gezielte Förderung im Italienischen und der Unterricht der Familiensprache sind meist Wunschdenken. In der Kohorte haben die Schüler/innen mit den besten Italienischkenntnissen einen italophonen Elternteil bzw. kamen im Vorschulalter nach Italien und besuchten dort den Kindergarten. Dagegen sind, wie auch bei den INVALSI-Tests, die in Italien geborenen und die dann die Krippe besuchten, leicht benachteiligt. Was die Familiensprache angeht, verbessert ihr Erlernen die Kompetenzen darin, ohne dem Italienischen zu schaden: Im Gegenteil. Diese Ergebnisse bestätigen die wichtige Rolle der "anderen" Sprache für einen gelungen Spracherwerb. Das MIUR sollte also sein Schulregister mit Sprachdaten ergänzen, um die Curricula im Sinn der EU-Vorgaben umzuschreiben und den sprachlich heterogenen Klassen gezielte Ressourcen und definierte Vorgehensweisen zur Verfügung zu stellen. Mit geringeren Mitteln, im Vergleich zu den jetzigen Kosten für Herunterstufung, Klassenwiederholung und Schulabbruch würde man Schulerfolg, Chancengerechtigkeit und Mehrsprachigkeit fördern, mit positiven Folgen für den Einzelnen sowie für die Volkswirtschaft.
The Italian Ministry of Education (MIUR) student register records that today in Italy more than one out of ten students is not an Italian citizen, although the majority of them were born there. Several statistical surveys indicate that "foreign" students, when compared to native students, show a poorer performance in Italian and in academic achievement. This exploratory fieldwork carried out in schools in Turin (5th to 8th grade) analyzed data obtained through semi-structured interviews with 121 students and 26 parents as well as 141 questionnaires filled in by 27 teachers of Italian and family language. It showed that many students are "bilingual natives", as they grow up acquiring both Italian and another language; however, despite the fact that the interviewees rate polyglottism positively, schools don't usually offer targeted support in either language. Within the cohort the broadest range of competences in Italian are found first among those with an Italian-speaking parent, then among those who arrived in Italy at pre-school age attending kindergarten there; this latter group shows higher competences than those born in Italy attending nursery there, as also in the INVALSI tests. As far as family language is concerned, data illustrate that its teaching increases its competences without affecting those in Italian: quite the opposite in fact. These results confirm the remarkable role played by the "other" language in successful language education. MIUR is therefore called upon to include also linguistic data in its student register, so as to redefine its curricula according to EU Guidelines, and to identify specific procedures and resources for multilingual classes. This new policy would reduce the current cost of placing students in a lower grade, grade retention and drop-outs, and would promote school success, equal opportunities and multilingualism, with positive consequences both for the individuals and for the national economy.
L'anagrafe studenti del MIUR registra come oggi in Italia più di uno studente su dieci non è cittadino italiano, pur essendo la maggioranza di loro nata in questo paese. Numerose indagini statistiche mostrano come gli allievi "stranieri" presentino, rispetto a quelli italiani, ridotte competenze in italiano e minore successo scolastico. Questa ricerca esplorativa svolta in alcune scuole di Torino (V elementare-III media) ha analizzato dati ottenuti tramite interviste semi-strutturate a 121 studenti e 26 genitori e 141 questionari compilati da 27 insegnanti di italiano e di lingua di famiglia. Da essa è emerso che molti studenti sono "nativi bilingui", poiché crescono usando l'italiano e un'altra lingua. Questo poliglottismo, valutato dagli intervistati assai positivamente, non si rispecchia però nella prassi scolastica: un supporto mirato in italiano e l'insegnamento della lingua di famiglia sono di regola una chimera. All'interno del campione le più ampie competenze in italiano si trovano fra chi ha un genitore italofono e chi è arrivato in Italia in età prescolare frequentandovi la scuola materna; come constatato anche nei test INVALSI, chi è nato in Italia e vi ha frequentato l'asilo nido è leggermente svantaggiato. Rispetto alla lingua di famiglia risulta che il suo studio porta a migliori competenze in essa, senza nuocere all'italiano: anzi. Emerge quindi il ruolo significativo della lingua "altra" per un'educazione linguistica efficace. L'invito al MIUR è quindi di integrare la propria anagrafe con dati linguistici, così da ridefinire i propri curricula secondo le Linee Guida Comunitarie, individuando procedure e risorse specifiche per le classi multilingui. Con un investimento ridotto, paragonato con il costo attuale dato da retrocessioni, ripetenze e abbandono scolastico, si riuscirebbe a sostenere il successo scolastico, le pari opportunità e il plurilinguismo, con conseguenze positive per i singoli e per l'economia nazionale.
APA, Harvard, Vancouver, ISO, and other styles
9

Tinawi, Félix. "Solution de C. Hyltén-Cavallius pour un problème de P. Turán concernant des polynômes." Thèse, 2008. http://hdl.handle.net/1866/7876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"Some Turan-type Problems in Extremal Graph Theory." Doctoral diss., 2018. http://hdl.handle.net/2286/R.I.50112.

Full text
Abstract:
abstract: Since the seminal work of Tur ́an, the forbidden subgraph problem has been among the central questions in extremal graph theory. Let ex(n;F) be the smallest number m such that any graph on n vertices with m edges contains F as a subgraph. Then the forbidden subgraph problem asks to find ex(n; F ) for various graphs F . The question can be further generalized by asking for the extreme values of other graph parameters like minimum degree, maximum degree, or connectivity. We call this type of question a Tura ́n-type problem. In this thesis, we will study Tura ́n-type problems and their variants for graphs and hypergraphs. Chapter 2 contains a Tura ́n-type problem for cycles in dense graphs. The main result in this chapter gives a tight bound for the minimum degree of a graph which guarantees existence of disjoint cycles in the case of dense graphs. This, in particular, answers in the affirmative a question of Faudree, Gould, Jacobson and Magnant in the case of dense graphs. In Chapter 3, similar problems for trees are investigated. Recently, Faudree, Gould, Jacobson and West studied the minimum degree conditions for the existence of certain spanning caterpillars. They proved certain bounds that guarantee existence of spanning caterpillars. The main result in Chapter 3 significantly improves their result and answers one of their questions by proving a tight minimum degree bound for the existence of such structures. Chapter 4 includes another Tur ́an-type problem for loose paths of length three in a 3-graph. As a corollary, an upper bound for the multi-color Ramsey number for the loose path of length three in a 3-graph is achieved.
Dissertation/Thesis
Doctoral Dissertation Mathematics 2018
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Problème de Turán"

1

How to turn computer problems into competitive advantage. Newtown Square, Pa., USA: Project Management Institute, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gagné, Antoinette. It's your turn. [Lasalle, Qubec]: Didier, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nora, Antonio. Caritas Christi urget nos: Il carisma e la spiritualità cottolenghina : aspetti ecclesiologici. Cantalupa (Torino): Effatà, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Caritas Christi urget nos: Il carisma e la spiritualità cottolenghina : aspetti ecclesiologici. Cantalupa (Torino): Effatà, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Growing through crises: How to turn problems into opportunities. Basingstoke: Marshalls, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lutz, Musner, Wuneberg Gotthart, Lutter Christina, and Internationales Forschungszentrum Kulturwissenschaften, eds. Cultural Turn: Zur Geschichte der Kulturwissenschaften. Wien: Turia + Kant, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Willan, Anne. A cook's book of quick fixes: How to turn adversity into opportunity. London: Quadrille, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

1944-, Digel Helmut, ed. Turn- und Sportvereine: Strukturen, Probleme, Trends : eine Analyse der Vereine im Deutschen Turner-Bund. Aachen: Meyer & Meyer, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Anne, Edwards. Being an expert professional practitioner: The relational turn in expertise. Dordrecht [the Netherlands]: Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Making Islam democratic: Social movements and the post-Islamist turn. Stanford, Calif: Stanford University Press, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Problème de Turán"

1

Felsner, Stefan. "Geometric Graphs: Turán Problems." In Geometric Graphs and Arrangements, 1–16. Wiesbaden: Vieweg+Teubner Verlag, 2004. http://dx.doi.org/10.1007/978-3-322-80303-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Soifer, Alexander. "E29: One Old Erdős–Turán Problem." In The Colorado Mathematical Olympiad: The Third Decade and Further Explorations, 217–20. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52861-8_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pawlak, Ralph R. "Torque-to-Turn Example." In Industrial Problem Solving Simplified, 189–95. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-6578-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mubayi, Dhruv, and Jacques Verstraëte. "A survey of Turán problems for expansions." In Recent Trends in Combinatorics, 117–43. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-24298-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Konyagin, Sergei V., and Vsevolod F. Lev. "The Erdős–Turán Problem in Infinite Groups." In Additive Number Theory, 195–202. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68361-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kent, Thomas. "14. Hermeneutics and Genre: Bakhtin and the Problem of Communicative Interaction." In The Interpretive Turn, 282–303. Ithaca, NY: Cornell University Press, 2020. http://dx.doi.org/10.7591/9781501735028-016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bonczek, Rose Burnett, Roger Manix, and David Storck. "We are the people to solve this problem." In Turn That Thing Off!, 120–36. Milton Park, Abingdon, Oxon ; New York : Routledge, 2017.: Routledge, 2018. http://dx.doi.org/10.4324/9781315559759-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gehler, Michael, and Robert Rollinger. "Imperial Turn: Challenges, Problems and Questions." In Universal- und kulturhistorische Studien. Studies in Universal and Cultural History, 3–39. Wiesbaden: Springer Fachmedien Wiesbaden, 2022. http://dx.doi.org/10.1007/978-3-658-34003-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Scherr, Albert. "Was kann Jugendforschung zur Konturierung einer sozialwissenschaftlich aufgeklärten Jugendpolitik beitragen? Probleme und Perspektiven im Verhältnis von Jugendforschung und Jugendpolitik." In Political (Re)Turn?, 43–56. Wiesbaden: VS Verlag für Sozialwissenschaften, 2012. http://dx.doi.org/10.1007/978-3-531-18963-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Berdysheva, Elena E., and Hubert Berens. "On a Discrete Turán Problem for ℓ-1 Radial Functions." In New Perspectives on Approximation and Sampling Theory, 447–68. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08801-3_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Problème de Turán"

1

Gishboliner, Lior, and Asaf Shapira. "A generalized Turán problem and its applications." In STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sudakov, Benny. "Recent Developments in Extremal Combinatorics: Ramsey and Turán Type Problems." In Proceedings of the International Congress of Mathematicians 2010 (ICM 2010). Published by Hindustan Book Agency (HBA), India. WSPC Distribute for All Markets Except in India, 2011. http://dx.doi.org/10.1142/9789814324359_0159.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fujii, Hironori A., Tomoo Tone, and Takeo Watanabe. "Turn over Problem of Tether Satellite System." In 56th International Astronautical Congress of the International Astronautical Federation, the International Academy of Astronautics, and the International Institute of Space Law. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2005. http://dx.doi.org/10.2514/6.iac-05-c1.p.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mityushov, E. A., N. E. Misyura, and A. E. Lamotkin. "Designing a program trajectory of a smooth turn." In PROCEEDINGS INTERNATIONAL CONFERENCE “PROBLEMS OF APPLIED MECHANICS”. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0048046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bielak, Halina, and Kamil Powroźnik. "An efficient algorithm for the density Turán problem of some unicyclic graphs." In 2014 Federated Conference on Computer Science and Information Systems. IEEE, 2014. http://dx.doi.org/10.15439/2014f297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Габдуллин, Салават. "VERBATIM RELATIONS IN TURN WITH COLLATERAL VALUE IN MODERN GERMAN." In GERMAN IN BASHKORTOSTAN: PROBLEMS AND PROSPECTS. Baskir State University, 2022. http://dx.doi.org/10.33184/nyvb2022-2022-04-29.2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lavrenov, Eugeniy O., Zoya S. Temlyakova, and Mikhail E. Vilberger. "Estimate of Turn-to-Turn Short Circuit Influence on an Induction Motor Operation Quality." In 2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE). IEEE, 2018. http://dx.doi.org/10.1109/apeie.2018.8546117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hu, Liru. "Turn-Taking Patterns in Dialogic Collaborative Problem Solving." In 2020 AERA Annual Meeting. Washington DC: AERA, 2020. http://dx.doi.org/10.3102/1586794.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ilyushenka, Nadzeya. "Digital learning: prospects and risks of digital turn in education." In 2nd International Conference “Futurity designing. Digital reality problems”. Keldysh Institute of Applied Mathematics, 2019. http://dx.doi.org/10.20948/future-2019-20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dai, Lei. "Cultural Turn and Chinese Literature’s Go-global: Problems and Solutions." In Proceedings of the 2019 International Conference on Management, Education Technology and Economics (ICMETE 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icmete-19.2019.68.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Problème de Turán"

1

Reddy, T., R. Ravindranath, M. Perumal, and A. Yegin. Problems with Session Traversal Utilities for NAT (STUN) Long-Term Authentication for Traversal Using Relays around NAT (TURN). RFC Editor, September 2014. http://dx.doi.org/10.17487/rfc7376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Goreczky, Péter, and Tibor Mezei. Breaking the Impasse? Chances of a Positive Turn in South Korea-Japan Relations. Külügyi és Külgazdasági Intézet, 2022. http://dx.doi.org/10.47683/kkielemzesek.ke-2022.25.

Full text
Abstract:
In the last decade, the value of bilateral trade between South Korea and Japan has shown a downward trend, and a ‘mini trade war’ and decoupling efforts to create more resilient supply chains in some economic segments have the potential to narrow trade relations further. This regression in bilateral economic cooperation is intrinsically connected to the deterioration of political relations between the two countries, and it was the re-emergence of unresolved historical differences on the political agenda that generated the tension between Japan and South Korea. On the other hand, the participation of the two nations in the Regional Comprehensive Economic Partnership (RCEP) can be evaluated as an important first step towards intensifying trade relations. In addition, corporate business relations and the private sector is the most important bridge between the two economies. The common challenges and opportunities of a new economic era and a changing geopolitical environment may induce Japan and South Korea to improve political cooperation and lay aside their differences regarding interpretations of historical problems. The paper concludes that the regression in bilateral relations during the past seven years has not taken place because the disagreement between the two sides has become intractable but due to an unfortunate series of occurrences in the political field.
APA, Harvard, Vancouver, ISO, and other styles
3

Moreno de Acevedo Sánchez, Enrique. State-owned Enterprise Management: Advantages of Centralized Models. Inter-American Development Bank, May 2016. http://dx.doi.org/10.18235/0007966.

Full text
Abstract:
This document analyzes the advantages and disadvantages of the different management models of state-owned enterprises (SOEs) in Latin America and the Caribbean. SOEs are important in the region. In many countries, they provide basic services to citizens, and their economic importance is relevant in terms of public finance. At the same time, SOEs confront political, financial, regulatory, and managerial problems, making them less efficient and transparent. In turn, governments should adopt management models to minimize these problems, while helping to ensure the quality of services and avoid the associated fiscal risks. This document argues that centralized models offer more advantages in correcting the current deficiencies of SOEs.
APA, Harvard, Vancouver, ISO, and other styles
4

Huntzinger, Hervé, Pierre Kopp, and Rémy Prud'homme. Stronger Municipalities for Stronger Cities in Argentina. Inter-American Development Bank, February 2004. http://dx.doi.org/10.18235/0008997.

Full text
Abstract:
In recent years a number of studies have been devoted to the twin issues of economic development and of decentralization in Argentina. Many papers have tried to understand the complex system of intergovernmental relations. Most of them, however, have focussed on the role of provinces, and neglected the problems raised by municipalities. This paper tries to bridge this gap, and to suggest that stronger municipalities could contribute to produce stronger cities that would in turn foster economic development.
APA, Harvard, Vancouver, ISO, and other styles
5

MIROLYUBOVA, S., D. VOROBYEV, and S. BUGROVA. SPEAKING OF OPTIMIZING THE MANAGEMENT OF CURRENT ASSETS OF ENTERPRISES IN THE DIGITAL ECONOMY. Science and Innovation Center Publishing House, 2022. http://dx.doi.org/10.12731/2070-7568-2022-11-1-4-23-31.

Full text
Abstract:
In the conditions of the digital economy, manufacturing enterprises often have problems associated with the inefficient use of sources of formation of current assets, which, in turn, leads to a loss of competitiveness of the enterprise and a decrease in its solvency in a dynamically changing market in the context of digital transformation. As part of the research, the results of which are presented in this article, the authors have developed proposals for optimizing the management of current assets of modern enterprises
APA, Harvard, Vancouver, ISO, and other styles
6

Clark, Louise, and Joe Taylor. ALRE Report on Evidence Demand on Inclusive Agricultural Commercialisation in Africa. APRA, Future Agricultures Consortium, April 2022. http://dx.doi.org/10.19088/apra.2022.038.

Full text
Abstract:
The Agricultural Policy Research in Africa (APRA) programme has generated new evidence and insights into different pathways to inclusive agricultural commercialisation. As part of APRA, the Accompanied Learning on Relevance and Effectiveness (ALRE) team worked to understand how evidence demand enabled researchers to identify and refine the most relevant and insightful policy messages; in turn encouraging them to go beyond mere analysis of the context and problem and consider how their evidence offered potential solutions to specific policy questions. Insights on evidence demand from ALRE-facilitated activities and events are outlined in this paper.
APA, Harvard, Vancouver, ISO, and other styles
7

McDonald, William, Jerry Haston, Mark Gredell, and Mark Benson. GRl-95-0455 Howell Storage Field Horizontal Well Field Experiment. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), May 1995. http://dx.doi.org/10.55274/r0011174.

Full text
Abstract:
This report summarizes results of a horizontal gas storage well field experiment at the Howell Storage Field in Howell, Ml. A new horizontal well was successfully drilled in the Niagaran formation offsetting a vertical well on the same location. TVD was 3914 ft; Measured depth was 6271ft, including 967 ft in the turn (616-ft radius) and a 2000-ft lateral. The lateral was held within a 10-ft window over the entire 2000-ft length. The horizontal well was drilled on schedule and within budget Minor problems, typical of all drilling operations, were handled without serious impact. The research objectives were to 1) address problems of planning and conducting drilling operations on a very small site in a populated area, and 2) demonstrate using horizontal well technology to increase working gas ratio. This report describes the careful planning process necessary for implementing horizontal well technology in storage fields, and presents 1) details of the actual drilling and completion operations, 2) time and component breakdown of all costi, and 3) preliminary well flow results.
APA, Harvard, Vancouver, ISO, and other styles
8

Kürsat Önder, Yasin, Mauricio Villamizar-Villegas, and Jose Villegas. Debt Moratorium: Theory and Evidence. Banco de la República, October 2023. http://dx.doi.org/10.32468/be.1253.

Full text
Abstract:
Our study analyzes the impact of debt moratorium policies, possibly the oldest approach to addressing repayment problems. Using Colombian administrative data, we compare firms that narrowly met the criteria for moratoria (eligible firms could not exceed 60 days overdue on their loans) with those that just missed it. Our findings reveal that stressed firms accessing moratoria experience more favorable loan conditions on subsequent borrowing, characterized by higher loan amounts and lower interest rates. This credit relief, in turn, contribute to substantial increases in firm investment and employment. To delve deeper into the implications, we employ a quantitative general equilibrium model of default to assess both short- and long-term effects. While these policies effectively mitigate liquidity concerns, they concurrently elevate default risks. Notably, our research underscores larger welfare gains when debt moratorium policies incorporate interest forgiveness during periods of debt standstill by reducing default risk.
APA, Harvard, Vancouver, ISO, and other styles
9

Amengual, Dante, Xinyue Bei, Marine Carrasco, and Enrique Sentana. Score-type tests for normal mixtures. CIRANO, January 2023. http://dx.doi.org/10.54932/uxsg1990.

Full text
Abstract:
Testing normality against discrete normal mixtures is complex because some parameters turn increasingly underidentified along alternative ways of approaching the null, others are inequality constrained, and several higher-order derivatives become identically 0. These problems make the maximum of the alternative model log-likelihood function numerically unreliable. We propose score-type tests asymptotically equivalent to the likelihood ratio as the largest of two simple intuitive statistics that only require estimation under the null. One novelty of our approach is that we treat symmetrically both ways of writing the null hypothesis without excluding any region of the parameter space. We derive the asymptotic distribution of our tests under the null and sequences of local alternatives. We also show that their asymptotic distribution is the same whether applied to observations or standardized residuals from heteroskedastic regression models. Finally, we study their power in simulations and apply them to the residuals of Mincer earnings functions.
APA, Harvard, Vancouver, ISO, and other styles
10

Gamba-Santamaria, Santiago, Luis Fernando Melo-Velandia, and Camilo Orozco-Vanegas. What can credit vintages tell us about non-performing loans? Banco de la República de Colombia, February 2021. http://dx.doi.org/10.32468/be.1154.

Full text
Abstract:
Using Colombian credit vintage data, we decompose the non-performing loans into one component that captures the evolution of the payment capacity of borrowers, and other component that captures changes in the credit risk taken by the financial system at the time of loan disbursement. We use intrinsic estimators and penalized regression techniques to overcome the perfect multicollinearity problem that the model entails. We find that these two type of components have evolved differently over time, and that good economic conditions and loose financial conditions improve the payment capacity of borrowers to meet their obligations, and in turn, they tend to coincide with the financial system engaging in riskier loans. Finally, we advocate the use of this methodology as a policy tool that is easy to apply by financial and economic authorities that dispose of a constant flow of credit vintage information. Through it, they will be able to identify the origin of the credit risk materialization and curb the risk taken by the financial system.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Problème de Turán' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography