999 resultados para Latin letters.


Relevância:

20.00% 20.00%

Publicador:

Resumo:

[EN] Progress in methodology in specific fields is usually very closely linked to the technological progress in other areas of knowledge. This justifies the fact that lexicographical techniques have had to wait for the arrival of the IT era of the last decades of the 20th century in order to be able to create specialised electronic dictionaries which can house and systemise enormous amounts of information which can later be dealt with quickly and efficiently. This study proposes a practical-methodological model which aims to solve the grammatical treatment of adverbs in Ancient Latin. We have suggested a list of 5 types, in a decreasing order from a greater to lesser degree of specialisation; technical (T), semi-technical (S-T), instrumental-valued (I-V), instrumental- descriptive (I-D), instrumental-expository (I-E).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Compõe-se de trechos selecionados da obra de Sêneca e traz uma pequena biografia do filósofo, além de partes das cento e vinte quatro "epístolas" dirigidas a seu amigo Lucílio. Constituem, na realidade, ensaios morais sobre vários aspectos da vida. Foi editado pelo célebre impressor francês Critóvão Plantin (ou Plantino), radicado na Bélgica, que notabilizou-se pela preciosidade de seu trabalho tipográfico, o que lhe valeu o título de "Grande Impressor", atribuído por Filipe II, rei da Espanha (Filipe I de Portugal).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A classical question in combinatorics is the following: given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of textbf{$epsilon$-dense partial Latin squares}: partial Latin squares in which each symbol, row, and column contains no more than $epsilon n$-many nonblank cells. Based on a conjecture of Nash-Williams, Daykin and H"aggkvist conjectured that all $frac{1}{4}$-dense partial Latin squares are completable. In this paper, we will discuss the proof methods and results used in previous attempts to resolve this conjecture, introduce a novel technique derived from a paper by Jacobson and Matthews on generating random Latin squares, and use this novel technique to study $ epsilon$-dense partial Latin squares that contain no more than $delta n^2$ filled cells in total.

In Chapter 2, we construct completions for all $ epsilon$-dense partial Latin squares containing no more than $delta n^2$ filled cells in total, given that $epsilon < frac{1}{12}, delta < frac{ left(1-12epsilonright)^{2}}{10409}$. In particular, we show that all $9.8 cdot 10^{-5}$-dense partial Latin squares are completable. In Chapter 4, we augment these results by roughly a factor of two using some probabilistic techniques. These results improve prior work by Gustavsson, which required $epsilon = delta leq 10^{-7}$, as well as Chetwynd and H"aggkvist, which required $epsilon = delta = 10^{-5}$, $n$ even and greater than $10^7$.

If we omit the probabilistic techniques noted above, we further show that such completions can always be found in polynomial time. This contrasts a result of Colbourn, which states that completing arbitrary partial Latin squares is an NP-complete task. In Chapter 3, we strengthen Colbourn's result to the claim that completing an arbitrary $left(frac{1}{2} + epsilonright)$-dense partial Latin square is NP-complete, for any $epsilon > 0$.

Colbourn's result hinges heavily on a connection between triangulations of tripartite graphs and Latin squares. Motivated by this, we use our results on Latin squares to prove that any tripartite graph $G = (V_1, V_2, V_3)$ such that begin{itemize} item $|V_1| = |V_2| = |V_3| = n$, item For every vertex $v in V_i$, $deg_+(v) = deg_-(v) geq (1- epsilon)n,$ and item $|E(G)| > (1 - delta)cdot 3n^2$ end{itemize} admits a triangulation, if $epsilon < frac{1}{132}$, $delta < frac{(1 -132epsilon)^2 }{83272}$. In particular, this holds when $epsilon = delta=1.197 cdot 10^{-5}$.

This strengthens results of Gustavsson, which requires $epsilon = delta = 10^{-7}$.

In an unrelated vein, Chapter 6 explores the class of textbf{quasirandom graphs}, a notion first introduced by Chung, Graham and Wilson cite{chung1989quasi} in 1989. Roughly speaking, a sequence of graphs is called "quasirandom"' if it has a number of properties possessed by the random graph, all of which turn out to be equivalent. In this chapter, we study possible extensions of these results to random $k$-edge colorings, and create an analogue of Chung, Graham and Wilson's result for such colorings.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[EN] We try to prove, with arguments taken from the texts, that the person named "Fruinianus", to whom Braulio de Saragossa addresses his letters XIII and XIV in his epistolary, is the same Frunimianus as the one from the introductory letter to 'Vita Emiliani', that is, Braulio's brother.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[EN] In this article we explain the etymology of the surnames of Basque origin that some presidents of Latin American countries have or have had in the past. These family names were created in the language called Euskara, in the Basque Country (Europe), and then, when some of the people who bore them emigrated to America, they brought their surnames with them. Most of the family names studied here are either oiconymic or toponymic, but it must be kept in mind that the oiconymic ones are, very often, based on house-nicknames, that is, they are anthroponymic in the first place. As far as possible, we have related the surname, when its origin is oiconymic or toponymic, to its source, i.e. to the house or place where it was created.

Relevância:

20.00% 20.00%

Publicador: