Page 1

Displaying 1 – 4 of 4

Showing per page

A metric graph satisfying [...] w 4 1 = 1 w 4 1 = 1 that cannot be lifted to a curve satisfying [...] dim ⁡   ( W 4 1 ) = 1 dim ( W 4 1 ) = 1

Marc Coppens (2016)

Open Mathematics

For all integers g ≥ 6 we prove the existence of a metric graph G with [...] w41=1 w 4 1 = 1 such that G has Clifford index 2 and there is no tropical modification G′ of G such that there exists a finite harmonic morphism of degree 2 from G′ to a metric graph of genus 1. Those examples show that not all dimension theorems on the space classifying special linear systems for curves have immediate translation to the theory of divisors on metric graphs.

A tropical view on Bruhat-Tits buildings and their compactifications

Annette Werner (2011)

Open Mathematics

We relate some features of Bruhat-Tits buildings and their compactifications to tropical geometry. If G is a semisimple group over a suitable non-Archimedean field, the stabilizers of points in the Bruhat-Tits building of G and in some of its compactifications are described by tropical linear algebra. The compactifications we consider arise from algebraic representations of G. We show that the fan which is used to compactify an apartment in this theory is given by the weight polytope of the representation...

Algèbres de polynômes tropicaux

Dominique Castella (2013)

Annales mathématiques Blaise Pascal

Nous continuons dans ce second article, l’étude des outils algébrique de l’algèbre de la caractéristique 1 : nous examinons plus spécialement ici les algèbres de polynômes sur un semi-corps idempotent. Ce travail est motivé par le développement de la géométrie tropicale qui apparaît comme étant la géométrie algébrique de l’algèbre tropicale. En fait l’objet algébrique le plus intéressant est l’image de l’algèbre de polynôme dans son semi-corps des fractions. Nous pouvons ainsi retrouver sur les...

An idempotent algorithm for a class of network-disruption games

William M. McEneaney, Amit Pandey (2016)

Kybernetika

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...

Currently displaying 1 – 4 of 4

Page 1