Sökning: "fully discrete"

Visar resultat 1 - 5 av 76 avhandlingar innehållade orden fully discrete.

  1. 1. Combinatorial Considerations on Two Models from Statistical Mechanics

    Författare :Johan Thapper; Svante Linusson; Peter Jonsson; Jakob Jonsson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; fully packed loop model; rhombus tilings; hard particle model; independence complex; discrete morse theory; Discrete mathematics; Diskret matematik;

    Sammanfattning : Interactions between combinatorics and statistical mechanics have provided many fruitful insights in both fields. A compelling example is Kuperberg’s solution to the alternating sign matrix conjecture, and its following generalisations. LÄS MER

  3. 2. Digital lines, Sturmian words, and continued fractions

    Författare :Hanna Uscka-Wehlou; Christer Oscar Kiselman; Maciej Klimek; Gunilla Borgefors; Mikael Passare; Damien Jamet; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; digital geometry; digital line; hierarchy of runs; combinatorics on words; Sturmian word; upper mechanical word; characteristic word; irrational slope; continued fraction; Gauss map; fixed point; Discrete mathematics; Diskret matematik; matematik; Mathematics;

    Sammanfattning : In this thesis we present and solve selected problems arising from digital geometry and combinatorics on words. We consider digital straight lines and, equivalently, upper mechanical words with positive irrational slopes a... LÄS MER

  4. 3. Impartial Games and Recursive Functions

    Författare :Urban Larsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algorithmically undecidable; Beatty sequences; Blocking maneuver; Cellular automaton; Comply maneuver; Complementary sequences; Dictionary process; Dual game; Game complexity; Game convergence; Game reflexivity; Heap game; Impartial game; Invariant subtraction game; Move-size dynamic; Nim; P-equivalence; Rule 110; Splitting sequences; *-operator; Subtraction game; Take-away game; Turing complete; Wythoff Nim; Turing complete;

    Sammanfattning : Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games. LÄS MER

  5. 4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

  7. 5. On the discretization in time and space of parabolic integro-differential equations

    Författare :Nai-Ying Zhang; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; initial-boundary value problem; parabolic; partial; integro-differential equation; regularity; nonsmooth initial data; finite element method; fully discrete; Galerkin approximation; stability; error estimate; quadrature; stability;

    Sammanfattning : .... LÄS MER