Log in

Relevant bibliographies by topics / 05C80 / Dissertations / Theses

To see the other types of publications on this topic, follow the link: 05C80.

Dissertations / Theses on the topic '05C80'

Author: Grafiati

Published: 1 June 2024

Last updated: 31 July 2025

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

Select a source type:

Consult the top 38 dissertations / theses for your research on the topic '05C80.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Circuit Bases of Strongly Connected Digraphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/178/1/document.pdf.

Full text

Abstract:

The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

2

Yang, Joyce C. "Interval Graphs." Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/83.

Full text

Abstract:

We examine the problem of counting interval graphs. We answer the question posed by Hanlon, of whether the formal power series generating function of the number of interval graphs on n vertices has a positive radius of convergence. We have found that it is zero. We have obtained a lower bound and an upper bound on the number of interval graphs on n vertices. We also study the application of interval graphs to the dynamic storage allocation problem. Dynamic storage allocation has been shown to be NP-complete by Stockmeyer. Coloring interval graphs on-line has applications to dynamic storage all

APA, Harvard, Vancouver, ISO, and other styles

3

Sigalla, Suzanne. "Contributions to structured high-dimensional inference." Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAG013.

Full text

Abstract:

Dans cette thèse, nous considérons les trois problèmes suivants : le problème de clustering dans le Bipartite Stochastic Block Model, le problème de classification de documents dans le cadre des topic models, et le problème de benign overfitting dans le cadre de régression non paramétrique. Tout d'abord, nous considérons le problème de clustering dans le Bipartite Stochastic Block Model (BSBM). Le BSBM est une généralisation non symétrique du Stochastic Block Model, avec deux ensembles de sommets. Nous introduisons un algorithme appelé le Hollowed Lloyd's algorithm, qui permet de classer les s

APA, Harvard, Vancouver, ISO, and other styles

4

Ferré, Michel. "Cassiodore." Saint-Etienne, 1999. http://www.theses.fr/1999STET2053.

Full text

Abstract:

Cassiodore (485 7-585 ?) fut au service des Ostrogoths jusqu'en 538 en 540, il dut partir en exil a Byzance d'où il revint en 554 pour se retirer dans le monastère de Vivanum qu'il avait fondé sur ses terres, dans les environs de factuel Squillace en Calabre. En 562, il rédige les institutions, dont le second livre enseigne à ses mornes, l'essentiel de la science humaine (grammaire, rhétorique, dialectique, arithmétique musique, géometrie, astronomie). L'objet de la recherche est la traduction de ce livre. Elle est précédée d'une introduction historique, et accompagnée de notes explicatives et

APA, Harvard, Vancouver, ISO, and other styles

5

Eschenfeldt, Patrick. "Approval Voting in Box Societies." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/36.

Full text

Abstract:

Under approval voting, every voter may vote for any number of canditates. To model approval voting, we let a political spectrum be the set of all possible political positions, and let each voter have a subset of the spectrum that they approve, called an approval region. The fraction of all voters who approve the most popular position is the agreement proportion for the society. We consider voting in societies whose political spectrum is modeled by $d$-dimensional space ($\mathbb{R}^d$) with approval regions defined by axis-parallel boxes. For such societies, we first consider a Tur&#aacute

APA, Harvard, Vancouver, ISO, and other styles

6

Boudignon, Christian. "La "mystagogie", : ou traité sur les symboles de la liturgie de Maxime le Confesseur (580-660). Edition, traduction, commentaire." Aix-Marseille 1, 2000. http://www.theses.fr/2000AIX10004.

Full text

Abstract:

Maxime le confesseur, moine palestinien et marque par la philosophie d'origene selon la source syriaque, a compose sans doute a carthage dans les annees 630, un traite sur les symboles de la liturgie, ou << mystagogie >> qu'il destine a theochariste, un proche de l'eparque d'arique georges, et a l'elite chretienne hellenophone d'afrique. Il s'agit d'un traite philosophique qui suit l'ordre et la rhetorique du genre, notamment la division que nous avons decouverte en une partie theorique tripartite (l'eglise image de dieu, du monde et de l'homme) et une partie analytique (commentaire sur les ac

APA, Harvard, Vancouver, ISO, and other styles

7

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Interchangeability of Relevant Cycles in Graphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/898/1/document.pdf.

Full text

Abstract:

The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of other cycles in W and shorter cycles. It is shown that each minimum cycle basis contains the same number of representatives of a given class W. This result is used to derive upper and lower bounds on the number of distinct minimum cycle bases. Finally, we give a polynomial-time algorithm to compute this partition. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

8

Périllié, Jean-Luc. "Symmetria et commensurabilité : principes pythagoriciens de la rationalité harmonique dans les sciences et dans les arts." Grenoble 2, 2000. http://www.theses.fr/2000GRE29038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Podar, Ovidiu-Sorin. "Une lecture phénoménologique matérielle du commentaire du "Pater" de saint Maxime le Confesseur (580-662)." Strasbourg, 2011. http://www.theses.fr/2011STRA1029.

Full text

Abstract:

We proposed the project of a new reading of the theological work of saint Maximus the Confessor (580-662) when we had the intuition of the convergence and the congruence, in spite of their chronological distance, with the phenomenology of Michel Henry (1922-2002). Neither historic comment, nor interpretation, nor comparatism or instrumentalization of the phenomenology to the advantage of the theology, our material phenomenological reading of the Commentary on the “Pater” is concerned only by the cogeneration of two thoughts, in and from the same and the unique transcendentality of Life. This r

APA, Harvard, Vancouver, ISO, and other styles

10

Koo, Cheng Wai. "A Bound on the Number of Spanning Trees in Bipartite Graphs." Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/73.

Full text

Abstract:

Richard Ehrenborg conjectured that in a bipartite graph G with parts X and Y, the number of spanning trees is at most the product of the vertex degrees divided by |X|⋅|Y|. We make two main contributions. First, using techniques from spectral graph theory, we show that the conjecture holds for sufficiently dense graphs containing a cut vertex of degree 2. Second, using electrical network analysis, we show that the conjecture holds under the operation of removing an edge whose endpoints have sufficiently large degrees. Our other results are combinatorial proofs that the conjecture holds for grap

APA, Harvard, Vancouver, ISO, and other styles

11

Mo, Yuet-Ha. "Interpersonal trust and business relationships." Thesis, University of Oxford, 2004. http://ora.ox.ac.uk/objects/uuid:1004afdd-05c8-48ca-b6ac-c9bfa671640b.

Full text

Abstract:

The research was multi-method as it combined qualitative semi-structured interviews with quantitative surveys. The thesis concludes by discussing cultural implications for the formation of trust among business people in the UK and China, and future research directions.

APA, Harvard, Vancouver, ISO, and other styles

12

Macris, Constantinos. "Le Pythagore des néoplatoniciens : recherches et commentaires sur le mode de vie pythagoricien de Jamblique." Paris, EPHE, 2004. http://www.theses.fr/2004EPHE5073.

Full text

Abstract:

A la fin du IIIe siècle, le philosophe syrien Jamblique (J. ) écrit en grec un « Décalogue » sur la secte pythagoricienne, qui s’ouvre sur un traité où sont exposés la biographie paradigmatique de Pythagore (P. ) et le mode de vie pratiqué par ses adeptes. Les recherches réunies dans la présente thèse ont pour but de mettre en évidence comment J. « néoplatonise » les matériaux traditionnels au sujet de P. , tout en restant fidèle à ceux-ci. L’analyse critique du contenu du traité montre l’importance accordée par J. Aux « voies de la Paideia » introduites par P. Et aux six vertus constitutives

APA, Harvard, Vancouver, ISO, and other styles

13

Biyikoglu, Türker, and Josef Leydold. "Semiregular Trees with Minimal Index." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/1338/1/document.pdf.

Full text

Abstract:

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with index is caterpillar. In this technical report we provide a different proof for this theorem. Furthermore, we give counter examples that show that this result cannot be generalized to the class of trees with a given (non-constant) degree sequence.<br>Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO, and other styles

14

Burkhart, Craig. "Approval Voting Theory with Multiple Levels of Approval." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/26.

Full text

Abstract:

Approval voting is an election method in which voters may cast votes for as many candidates as they desire. This can be modeled mathematically by associating to each voter an approval region: a set of potential candidates they approve. In this thesis we add another level of approval somewhere in between complete approval and complete disapproval. More than one level of approval may be a better model for a real-life voter's complex decision making. We provide a new definition for intersection that supports multiple levels of approval. The case of pairwise intersection is studied, and the level

APA, Harvard, Vancouver, ISO, and other styles

15

Iglesias, Jennifer. "Searching Stars for a Moving Hider." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/38.

Full text

Abstract:

In a search game, a seeker searches for a hider in some space. The seeker wishes to find the hider as quickly as possible, and the hider wishes to avoid capture as long as possible. In this paper, I will focus on the case where the search space is a star, and the only information the seeker has is the speed of the hider. I will provide algorithms for some cases where the seeker is guaranteed to find the hider and prove optimality for some of these cases. Also, I will look at some cases where the hider can avoid capture indefinitely. I will also present some results for searching on trees.

APA, Harvard, Vancouver, ISO, and other styles

16

Purvinis, Julius. "Žiniatinklio informacinių sistemų regresinio testavimo algoritmo realizavimas ir tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2012~D_20131105_093025-05980.

Full text

Abstract:

Kasdieninis žiniatinklio informacinių sistemų (toliau – IS) naudojimas paprastų vartotojų, verslo ir vyriausybinių organizacijų tarpe, reikalauja vis aukštesnės tokių IS kokybės. Žiniatinklio IS dažniausiai yra tokia programinė įranga, kurios sudėtingumas, dėl keleto apjungiamų technologijų, yra aukštas, o pokyčių greitis yra didelis. Vykdant palaikymo ir priežiūros darbus, gali atsirasti begalė klaidų, kurias iššaukia atlikti pakeitimai. Regresinio testavimo paskirtis yra užtikrinti, jog įdiegus programinės įrangos pakeitimus, tokius kaip naujo funkcionalumo pridėjimas ar jau egzistuojančio t

APA, Harvard, Vancouver, ISO, and other styles

17

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Minimum Path Bases and Relevant Paths." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1214/1/document.pdf.

Full text

Abstract:

Given an undirected graph G(V,E) and a vertex subset U\subseteq V the U-space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U-space. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

18

Hellmuth, Marc, Josef Leydold, and Peter F. Stadler. "Convex Cycle Bases." DMFA Slovenije, 2014. http://epub.wu.ac.at/6468/1/226%2D2089%2D1%2DPB.pdf.

Full text

Abstract:

Convex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and describe a polynomial-time algorithm that recognizes whether a given graph has a convex cycle basis and provides an explicit construction in the positive case. Relations between convex cycles bases and other types of cycles bases are discussed. In particular we show that if G has a unique minimal cycle bases, this basis is convex. Furthermore, we characterize a class of graphs with convex cycles bases that includes partial cubes and hence median graphs.

APA, Harvard, Vancouver, ISO, and other styles

19

Biyikoglu, Türker, and Josef Leydold. "Semiregular Trees with Minimal Laplacian Spectral Radius." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/986/1/document.pdf.

Full text

Abstract:

A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency / Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.<br>Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO, and other styles

20

Biyikoglu, Türker, and Josef Leydold. "Algebraic Connectivity and Degree Sequences of Trees." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2008. http://epub.wu.ac.at/782/1/document.pdf.

Full text

Abstract:

We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on non-pendant vertices starting at the characteristic set of the Fiedler vector. (author´s abstract)<br>Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO, and other styles

21

Biyikoglu, Türker, Marc Hellmuth, and Josef Leydold. "Largest Laplacian Eigenvalue and Degree Sequences of Trees." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2008. http://epub.wu.ac.at/350/1/document.pdf.

Full text

Abstract:

We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization. (author´s abstract)<br>Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO, and other styles

22

Choi, John. "Counting Vertices in Isohedral Tilings." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/28.

Full text

Abstract:

An isohedral tiling is a tiling of congruent polygons that are also transitive, which is to say the configuration of degrees of vertices around each face is identical. Regular tessellations, or tilings of congruent regular polygons, are a special case of isohedral tilings. Viewing these tilings as graphs in planes, both Euclidean and non-Euclidean, it is possible to pose various problems of enumeration on the respective graphs. In this paper, we investigate some near-regular isohedral tilings of triangles and quadrilaterals in the hyperbolic plane. For these tilings we enumerate vertices as cl

APA, Harvard, Vancouver, ISO, and other styles

23

Peebles, John Lee Thompson Jr. "Hypergraph Capacity with Applications to Matrix Multiplication." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/hmc_theses/48.

Full text

Abstract:

The capacity of a directed hypergraph is a particular numerical quantity associated with a hypergraph. It is of interest because of certain important connections to longstanding conjectures in theoretical computer science related to fast matrix multiplication and perfect hashing as well as various longstanding conjectures in extremal combinatorics. We give an overview of the concept of the capacity of a hypergraph and survey a few basic results regarding this quantity. Furthermore, we discuss the Lovász number of an undirected graph, which is known to upper bound the capacity of the graph (and

APA, Harvard, Vancouver, ISO, and other styles

24

Biyikoglu, Türker, and Josef Leydold. "Faber-Krahn Type Inequalities for Trees." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2003. http://epub.wu.ac.at/826/1/document.pdf.

Full text

Abstract:

The Faber-Krahn theorem states that among all bounded domains with the same volume in Rn (with the standard Euclidean metric), a ball that has lowest first Dirichlet eigenvalue. Recently it has been shown that a similar result holds for (semi-)regular trees. In this article we show that such a theorem also hold for other classes of (not necessarily non-regular) trees. However, for these new results no couterparts in the world of the Laplace-Beltrami-operator on manifolds are known.<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

25

Vinel, Nicolas. "L' "In Nicomachi arithmeticam" de Jamblique." Clermont-Ferrand 2, 2008. http://www.theses.fr/2008CLF20001.

Full text

Abstract:

Cette thèse de doctorat vise à réhabiliter un texte marqué au fer rouge par la philologie du XIXe siècle : l'"In Nicomachi arithmeticam" du philosophe syrien Jamblique de Chalcis (IIIe-IVe s. ), que les néoplatoniciens postérieurs n'hésitaient pas à qualifier de "divin", à l'égal de Platon, mais dont le traité sur l'arithmétique pythagoricienne est injustement connu comme une piètre paraphrase de la fameuse "Introduction arithmétique" de Nicomaque de Gérase (Ie-IIe s. ). En réalité, Jamblique a composé une nouvelle "Introduction à l'arithmétique". Ce projet engageait non seulement le souci de

APA, Harvard, Vancouver, ISO, and other styles

26

Biyikoglu, Türker, Josef Leydold, and Peter F. Stadler. "Nodal Domain Theorems and Bipartite Subgraphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2005. http://epub.wu.ac.at/626/1/document.pdf.

Full text

Abstract:

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

27

Ostermeier, Philipp-Jens, Marc Hellmuth, Konstantin Klemm, Josef Leydold, and Peter F. Stadler. "A note on quasi-robust cycle bases." DMFA Slovenije, 2009. http://epub.wu.ac.at/6469/1/80.pdf.

Full text

Abstract:

We investigate here some aspects of cycle bases of undirected graphs that allow the iterative construction of all elementary cycles. We introduce the concept of quasi-robust bases as a generalization of the notion of robust bases and demonstrate that a certain class of bases of the complete bipartite graphs K m,n with m,n _> 5 is quasi-robust but not robust. We furthermore disprove a conjecture for cycle bases of Cartesian product graphs.

APA, Harvard, Vancouver, ISO, and other styles

28

Figari, Joël. "La philosophie pythagoricienne de la musique." Paris 4, 2002. http://www.theses.fr/2002PA040168.

Full text

Abstract:

La philosophie de la musique attribuée aux premiers Pythagoriciens est habituellement considérée comme une doctrine des nombres. De nombreux témoignages le confirment en effet. Mais à cette interprétation peut être opposée une antithèse : car la musique apparaît aussi, de Pythagore à Archytas, comme une phénomène sonore. Comment faut-il donc comprendre la relation entre le modèle mathématique de l'harmonie et la réalisation sonore de la musique ? Ce problème philosophique remet en question l'interprétation du pythagorisme présocratique. Il nous révèle une figure inhabituelle des premiers Pytha

APA, Harvard, Vancouver, ISO, and other styles

29

Fauvinet-Ranson, Valérie. "Les cités d'Italie dans le premier tiers du VIe siècle : patrimoine monumental romain et spectacles d'après les Variae de Cassiodore." Paris 10, 2000. http://www.theses.fr/2000PA100164.

Full text

Abstract:

Cette these porte sur le devenir des cites d'italie dans les decennies qui suivent la fin officielle de l'empire romain d'occident (476). Notre principale source sur le sujet et l'epoque etant constituee par les variae de cassiodore, l'etude est centree sur elle. La periode consideree (493-537) correspond a la duree du royaume ostrogothique d'italie, de la victoire de theodoric sur son predecesseur odoacre jusqu'a la guerre de reconquete ordonnee par justinien qui marque une forte rupture. Le contexte est celui de l'appropriation du pouvoir par des peuples barbares dans differents royaumes qui

APA, Harvard, Vancouver, ISO, and other styles

30

Loeb, Sarah. "Extending List Colorings of Planar Graphs." Scholarship @ Claremont, 2011. http://scholarship.claremont.edu/hmc_theses/6.

Full text

Abstract:

In the study of list colorings of graphs, we assume each vertex of a graph has a specified list of colors from which it may be colored. For planar graphs, it is known that there is a coloring for any list assignment where each list contains five colors. If we have some vertices that are precolored, can we extend this to a coloring of the entire graph? We explore distance constraints when we allow the lists to contain an extra color. For lists of length five, we fix $W$ as a subset of $V(G)$ such that all vertices in $W$ have been assigned colors from their respective lists. We give a new, simp

APA, Harvard, Vancouver, ISO, and other styles

31

Renczes, Philipp Gabriel. "L'agir de Dieu et la liberté de l'homme : les concepts d'"energeia-énergie" et d'"hexis-habitus" dans l'anthropologie théologique de Saint Maxime le Confesseur." Paris 4, 1999. http://www.theses.fr/1999PA040085.

Full text

Abstract:

Maxime le Confesseur, moine byzantin (580-662) célèbre en son temps, est resté presqu'inconnu, puis a été redécouvert depuis un demi-siècle comme un penseur philosophique et théologique, proposant une doctrine de la divinisation de l'homme qu'il envisage comme progression de l' « être » vers l' « être-bien » , puis vers l' « être-toujours ». Cette dynamique se réalise par l'articulation d'energeia (actualisation) et d'hexis (habitus) dont notre travail étudie la relation. L'energeia, examinée jusqu'à Maxime dans la tradition philosophique (notamment Aristote, le néoplatonisme), puis dans l'écr

APA, Harvard, Vancouver, ISO, and other styles

32

Weinstein, Madeleine. "Adinkras and Arithmetical Graphs." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/hmc_theses/85.

Full text

Abstract:

Adinkras and arithmetical graphs have divergent origins. In the spirit of Feynman diagrams, adinkras encode representations of supersymmetry algebras as graphs with additional structures. Arithmetical graphs, on the other hand, arise in algebraic geometry, and give an arithmetical structure to a graph. In this thesis, we will interpret adinkras as arithmetical graphs and see what can be learned. Our work consists of three main strands. First, we investigate arithmetical structures on the underlying graph of an adinkra in the specific case where the underlying graph is a hypercube. We classify

APA, Harvard, Vancouver, ISO, and other styles

33

Hedde, d'Entremont Henri. "Principes mathématiques de philosophie politique." Paris 4, 2007. http://www.theses.fr/2007PA040323.

Full text

Abstract:

Quel rapport intrinsèque existe-t-il entre mathématiques et politique ? Hors des liens de pure logistique, tout semble séparer, sinon même radicalement opposer, a priori, la politique - art suprême de gouverner les sociétés - et les mathématiques, science exacte qui régit l’ordre et la quantité. Ces deux sommets de l’esprit humain semblent aux antipodes l’un de l’autre avec, d’un côté, la volonté politique de l’homme et de l’autre le déterminisme mathématique du nombre. Compte tenu de la distance séparant, a priori, l’homme et le nombre, la volonté et le déterminisme, quel rapport essentiel -

APA, Harvard, Vancouver, ISO, and other styles

34

Biyikoglu, Türker, Marc Hellmuth, and Josef Leydold. "Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/390/1/document.pdf.

Full text

Abstract:

We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.<br>Series: Research Report Series / Department of Statistics and Mathematics

APA, Harvard, Vancouver, ISO, and other styles

35

Skliris, Dionysios. "Le concept de tropos chez Maxime le Confesseur." Thesis, Paris 4, 2015. http://www.theses.fr/2015PA040206.

Full text

Abstract:

Les termes logos (raison) et tropos forment un couple qui est très significatif pour la pensée de Maxime le Confesseur (c. 580-662). Dans notre thèse, nous examinons les contextes dans lesquels Maxime le Confesseur emploie le terme tropos (mode) soit à l’intérieur du couple logos-tropos, soit de façon autonome. Nous ne traitons pas le concept de tropos comme un terme invariant intégré à une doctrine uniforme, mais plutôt comme un moyen ou un «outil» conceptuel qui aide Maxime à résoudre des problèmes très différents dans plusieurs domaines de sa pensée. Nous examinons les différents contextes

APA, Harvard, Vancouver, ISO, and other styles

36

Charpin, Ploix Marie Lucie. "Union et différence : une lecture de la mystagogie de Maxime le Confesseur." Paris 4, 2000. http://www.theses.fr/2000PA040158.

Full text

Abstract:

Maxime le confesseur (580-662) a pris part aux controverses christologiques de son temps en exploitant les virtualités de la « définition » du concile de Chalcedoine (451), qui confesse « un seul et même christ. . . Reconnu en deux natures, sans confusion, sans changement, sans division, sans séparation ». L'utilisation massive du vocabulaire de la « définition » par Maxime donne à penser que cette dernière constitue une clé pour interpréter son oeuvre, et, plus spécialement, pour comprendre un thème qui y tient une place importante : le thème de la divinisation. Celle-ci fera l'objet de notre

APA, Harvard, Vancouver, ISO, and other styles

37

Kyriazópoulos, Athanásios. "Les épiphanies des dieux dans la poésie lyrique grecque (7e - 5e siècle avant notre ère)." Paris 4, 1989. http://www.theses.fr/1989PA040034.

Full text

Abstract:

En Grèce archaïque, l'organisation de la vie religieuse dans le cadre de la cite favorise le développement d'un modèle de communication entre les dieux et les hommes fondé sur les rites périodiques du culte officiel. L'épiphanie divine, très fréquente dans Homère, devient désormais un procédé exceptionnel, et pour cela très significatif. Dans la poésie lyrique, qui est l'expression littéraire la plus importante de l'époque archaïque, nous distinguons trois types d'épiphanie : 1 a) épiphanie mythique de justice : Pindare, pe. 6. 73-89; ibid. 98-120; p. 3. 24-46; Bacchylide 3. 26-63; 1 b) épipha

APA, Harvard, Vancouver, ISO, and other styles

38

Gévaudan, Amand. "Cassiodore, De Anima : introduction, traduction,et notes." Thesis, Montpellier 3, 2015. http://www.theses.fr/2015MON30054/document.

Full text

Abstract:

Le De anima marque un tournant dans la vie de Cassiodore, aristocrate romain, né vers 484, dont la famille s'était mise au service des rois Goths. Ayant terminé son parcours politique, il a fait ce qu' il a appelé sa« conversion » qui l'amènera à fonder le monastère de Vivarium et à s'y retirer. C'est au moment de ce changement de vie qu'il écrivit un traité sur l'âme et ses vertus, réflexion anthropologique, psychologique et morale, qui s'appuyait sur des écrits philosophiques, des écrits physiologiques empruntés à la tradition médicale, mais aussi sur les écrits scripturaires et l'œuvre de s

APA, Harvard, Vancouver, ISO, and other styles

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!