Quinto Flávio Mésio Cornélio Egnácio Severo Loliano




Quinto Flávio Mésio Cornélio Egnácio Severo Loliano Mavórcio, o Jovem (em latim: Quintus Flavius Maesius Cornelius Egnatius Severus Lollianus signo Mavortius Iunior) foi um oficial romano de meados do século IV. Era filho de Loliano Mavórcio e irmão de Quinto Flávio Egnácio Plácido Severo. Em duas inscrições, a primeira de Putéolos (X 1697=D 1226) e outra num tablete de bronze (VI 32010=XV 7160), aparece como homem claríssimo e pretor triunfal. Na primeira inscrição é dito que era patrono do Colégio Decatrênsio (collegium decatrensium).[1]



Bibliografia |



  • Martindale, J. R.; A. H. M. Jones (1971). «Q. Flavius Maesius Egnatius Lollianus signo Mavortius 5». The Prosopography of the Later Roman Empire, Vol. I AD 260-395. Cambridge e Nova Iorque: Cambridge University Press  A referência emprega parâmetros obsoletos |coautor= (ajuda)



  • ↑ Martindale 1971, p. 514.








    • -

    Popular posts from this blog

    Contact image not getting when fetch all contact list from iPhone by CNContact

    Image
    up vote 0 down vote favorite I know this question already asked but not getting solution. From this code I will get all the information from the contact but image not found when open vcf files on mac os, also not getting when share this file. I use this stackoverflow link here but It's not help full. var contacts = [CNContact]() let keys = [CNContactVCardSerialization.descriptorForRequiredKeys() ] as [Any] let request = CNContactFetchRequest(keysToFetch: keys as! [CNKeyDescriptor]) do { try self.contactStore.enumerateContacts(with: request) { (contact, stop) in // Array containing all unified contacts from everywhere contacts.append(contact) } } catch { print("unable to fetch contacts") } do { let data = try
    Read more

    count number of partitions of a set with n elements into k subsets

    Image
    up vote 6 down vote favorite 1 This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k? NOTE->I know this is not the best way to calculate number of partitions that would be DP // A C++ program to count number of partitions // of a set with n elements into k subsets #include<iostream> using namespace std; // Returns count of different partitions of n // elements in k subsets int countP(int n, int k) { // Base cases if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; // S(n+1, k) = k*S(n, k) + S(n, k-1) return k*countP(n-1, k) + countP(n-1, k-1); } // Driver program int ma
    Read more

    A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

    Image
    0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{
    Read more