Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 117 for “"Erdos"”.

  1. Variations on the Erdos Discrepancy Problem

    The Erdős discrepancy problem asks, "Does there exist a sequence t = {t_i}_{1≤i<∞} with each t_i ∈ {-1,1} and a constant c such that |∑_{1≤i≤n} t_{id}| ≤ c for all n,c ∈ ℕ = {1,2,3,...}?" The discrepancy of t equals sup_{n≥1} |∑_{1≤i≤n} t_{id}|. Erdős conjectured in 1957 that no such sequence …

    waterloo Repository record for Variations on the Erdos Discrepancy Problem (opens in a new tab)

  2. Erdos-Posa theorems for undirected group-labelled graphs

    Erdős and Pósa proved in 1965 that cycles satisfy an approximate packing-covering duality. Finding analogous approximate dualities for other families of graphs has since become a highly active area of research due in part to its algorithmic applications. In this thesis we investigate the Erdős-Pósa …

    gatech Repository record for Erdos-Posa theorems for undirected group-labelled graphs (opens in a new tab)

  3. On a Generalization of the de Bruijn-Erdos Theorem

    The de Bruijn-Erdos Theorem from combinatorial geometry states that every set of $n$ noncollinear points in the plane determine at least $n$ distinct lines. Chen and Chvatal conjecture that this theorem can be generalized from the Euclidean metric to all finite metric spaces with appropriately …

    concordia Download PDF for On a Generalization of the de Bruijn-Erdos Theorem (opens in a new tab)

  4. Designs with an Intersection Property inspired by the Erdos-Ko-Rado Problem.

    Katona’s proof of the Erdos-Ko-Rado Theorem (EKR) relies on the existence of a family of v k-subsets of a set of size v with no subfamily of k+1 sets that are pairwise 1-intersecting. Herein, we consider a generalization of these families: collections of size λ {v \choose t}/{k \choose t} of …

    concordia Download PDF for Designs with an Intersection Property inspired by the Erdos-Ko-Rado Problem. (opens in a new tab)

  5. Properties of Shortest Length Curves inside Semi-Algebraic Sets and Problems related to an Erdos Conjecture concerning Lattice Cubes

    Part I: Properties of Shortest Length Curves inside Semi-algebraic Sets The first part of the paper concerns an analytical stratification question of real algebraic and semi-algebraic sets. An algebraic set is defined by finitely many polynomial equations and the definition of the more general …

    rice Repository record for Properties of Shortest Length Curves inside Semi-Algebraic Sets and Problems related to an Erdos Conjecture concerning Lattice Cubes (opens in a new tab)

  6. Το Τυχαίο Γράφημα Erdοs-Renyi

    Το τυχαίο γράφημα Erdos-Renyi με μια δεύτερη ματιά. Mετάβαση φάσης για το τυχαίο γράφημα Erdos-Renyi. Συγκρίσεις με δίκτυα πραγματικού κόσμου.

    athens Repository record for Το Τυχαίο Γράφημα Erdοs-Renyi (opens in a new tab)

  7. The Effect Of Watts-Strogatz And Barabási-Albert Graphs On Memory Formation

    … done assuming that the network of neurons was an Erdos-Renyi random graph. However the network of neurons in the brain has been shown to exhibit small-world properties, which are not present in Erdos-Renyi graphs. In this research we explore replacing Erdos-Renyi graphs with Watts-Strogatz and …

    calpoly Repository record for The Effect Of Watts-Strogatz And Barabási-Albert Graphs On Memory Formation (opens in a new tab)

  8. Προσομοίωση τυχαίων γραφημάτων με περιορισμούς στην ακολουθία βαθμών

    … οποίο δεν είναι δυνατό στο κλασικό μοντέλο των Erdos-Renyi,καθώς αυτό επιτρέπει καλύτερη προσαρμογή σε πραγματικές εφαρμογές και β) να σχεδιάσουμε αποτελεσματικά ένα τυχαίο γράφο με αυτούς τους περιορισμούς.Προηγούμενοι αλγόριθμοι συχνά βρίσκονται σε αδιέξοδο ή σε ατέρμονο βρόχο 'η παράγουν …

    athens Repository record for Προσομοίωση τυχαίων γραφημάτων με περιορισμούς στην ακολουθία βαθμών (opens in a new tab)

  9. Extremal graph theory: supersaturation and enumeration

    … 2, with Balogh, we disprove a conjecture of Erdos and Tuza concerning the number of different ways one can create a copy of K_4, a complete graph on 4 vertices, in a K_4-free graph. In Chapter 3, we extend a classical result of Kolaitis, Promel and Rothschild on the typical structure of …

    uiuc Repository record for Extremal graph theory: supersaturation and enumeration (opens in a new tab)

  10. Topics in multiplicative number theory

    … and Tao.</p> <p>We study primitive sets. The Erdos primitive set conjecture, posed in 1986, asserts that the set of primes is maximal among all primitive sets, in a precise sense. We explore variations of this problem in multiple directions, where many open questions remain. We disprove a …

    oxford Repository record for Topics in multiplicative number theory (opens in a new tab)

  11. Enumeration Results On Leaf Labeled Trees

    … of categories of phylogenetic trees. P.L. Erdos and L.A. Szekely [Adv. Appl. Math.series 10,1989, 488--496] gave a bijection between rooted semilabeled trees and set partitions. L.H. Harper's results [Ann. Math.Stat.series 38, 1967, 410--414] on the asymptotic normality of the Stirling …

    south-carolina Repository record for Enumeration Results On Leaf Labeled Trees (opens in a new tab)

  12. The sum-product problem

    The sum-product problem of Erdos and Szemeredi asserts that any subset of the integers has many products or many sums. We explore quantitative aspects of the problem over both the real numbers and finite fields of prime order.

    uiuc Repository record for The sum-product problem (opens in a new tab)

  13. Special values of L-series, periodic coefficients and related themes

    … Motivated by the conjectures of S. Chowla and P. Erdos, we first study the L-series L(s,f) attached to a periodic arithmetical function f. Utilizing tools from transcendental number theory, we investigate the non-vanishing and the arithmetic nature of the values L(1,f) and L'(1,f). We introduce a …

    queens Repository record for Special values of L-series, periodic coefficients and related themes (opens in a new tab)

  14. Cardinal numbers with partition properties

    … k — (nl)n and k — (n)v<w extensively studied by Erdos and his collaborators (see [5] and [6] for further references).

    anu Repository record for Cardinal numbers with partition properties (opens in a new tab)

  15. The Non-Existence of a Covering System with all Moduli Distinct, Large and Square-Free

    … This thesis addresses the conjecture posed by Erdos that the least modulus for a covering system can be arbitrarily large. Hough proves the least modulus cannot be arbitrarily large. In this thesis, we present Hough’s proof for the case of square-free moduli.

    south-carolina Repository record for The Non-Existence of a Covering System with all Moduli Distinct, Large and Square-Free (opens in a new tab)

  16. Extremal problems for cycles in graphs and hypergraphs

    … or long paths, extending famous results of Erdos and Gallai. Results include bounds on the size of such objects as well as stability theorems about the structure of extremal and almost extremal objects.

    uiuc Repository record for Extremal problems for cycles in graphs and hypergraphs (opens in a new tab)

  17. Extension theorems in vector spaces over finite fields

    … between extension theorems for spheres and the Erdos-Falconer distance problems in the finite field setting. Using the sharp extension theorem for circles, we improve upon the best known result, due to A. Iosevich and M. Rudnev ([17]), for the Erdos-Falconer distance problems in two dimensional …

    missouri Repository record for Extension theorems in vector spaces over finite fields (opens in a new tab)

  18. Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs

    … that graphs with the property exist. In 1963, Erdos and Rényi gave a non-explicit, randomized construction of such graphs. Until recently, only a few explicit families of n-e.c. graphs were known such as Paley graphs. Furthermore, n-e.c. graphs of minimum order have received much attention due …

    wilfrid-laurier Repository record for Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs (opens in a new tab) Download PDF for Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs (opens in a new tab)

Page 1 of 6