Browsing Pure Mathematics by Title
Now showing items 120 of 52

An ninarow type game
(201607) 
Areawidth scaling in generalised Motzkin paths
(201605)We consider a generalised version of Motzkin paths, where horizontal steps have length $\ell$, with $\ell$ being a fixed positive integer. We first give the general functional equation for the arealength generating function ... 
Combinatorial representations
(20110906)This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via ... 
Continuous orbit equivalence rigidity
(Cambridge University Press (CUP): STM Journals, 201608) 
Cosmological constant from quantum spacetime
(20150609)© 2015 American Physical Society.We show that a hypothesis that spacetime is quantum with coordinate algebra [xi,t]=λPxi, and spherical symmetry under rotations of the xi, essentially requires in the classical limit that ... 
Duality in the homology of 5manifolds
(International Press, 20161007)We show that the homological properties of a 5manifold M with fundamental group G are encapsulated in a G invariant stable form on the dual of the third syzygy of Z. In this notation one may express an even stronger version ... 
"Graph Entropy, Network Coding and Guessing games"
(ArXiv, 200711)We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be ... 
Graph Guessing Games and nonShannon Information Inequalities
(201411)Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on ... 
Gravity induced from quantum spacetime
(20140207) 
Guessing Games on Trianglefree Graphs
(20141009)The guessing game introduced by Riis is a variant of the "guessing your own hats" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing ... 
Joint spectral radius, Sturmian measures, and the finiteness conjecture
(Cambridge University Press, 20170215)