Sökning: "linear graph invariant"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden linear graph invariant.

  1. 1. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion

    Författare :Oliver Krüger; Jörgen Backelin; Alexander Engström; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Ramsey number; edge number; minimal Ramsey graph; independence number; clique number; Turán s theorem; crochet pattern; H13-pattern; linear graph invariant; triangle-free graph; Mathematics; matematik;

    Sammanfattning : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. LÄS MER

  3. 2. Taut Strings and Real Interpolation

    Författare :Eric Setterqvist; Natan Kruglyak; Irina Asekritova; Javier Soria; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The taut string problem concerns finding the function with the shortest graph length, i.e. the taut string, in a certain set  of continuous piecewise linear functions. It has appeared in a broad range of applications including statistics, image processing and economics. LÄS MER

  4. 3. Topological and Shifting Theoretic Methods in Combinatorics and Algebra

    Författare :Afshin Goodarzi; Anders Björner; Volkmar Welker; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Sammanfattning : This thesis consists of six papers related to combinatorics and commutative algebra.In Paper A, we use tools from topological combinatorics to describe the minimal free resolution of ideals with a so called regular linear quotient. Our result generalises the pervious results by Mermin and by Novik, Postnikov & Sturmfels. LÄS MER

  5. 4. Combinatorial Methods in Complex Analysis

    Författare :Per Alexandersson; Boris Shapiro; Alexandre Eremenko; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; combinatorics; Schrödinger equation; Toeplitz matrix; sums of squares; Schur polynomials; Mathematics; matematik;

    Sammanfattning : The theme of this thesis is combinatorics, complex analysis and algebraic geometry. The thesis consists of six articles divided into four parts.Part A: Spectral properties of the Schrödinger equationThis part consists of Papers I-II, where we study a univariate Schrödinger equation with a complex polynomial potential. LÄS MER

  7. 5. Consensus and Pursuit-Evasion in Nonlinear Multi-Agent Systems

    Författare :Johan Thunberg; Xiaoming Hu; Zhong-Ping Jiang; KTH; []
    Nyckelord :Multi-agent systems; consensus; attitude synchronization; nonlinear control; optimization; pursuit-evasion;

    Sammanfattning : Within the field of multi-agent systems theory, we study the problems of consensus and pursuit-evasion. In our study of the consensus problem, we first provide some theoretical results and then consider the problem of consensus on SO(3) or attitude synchronization. LÄS MER