Related papers: Information-Geometric Equivalence of Transportatio…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the…

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$…

We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of…

The aim of these lectures is the study of bifurcations within holomorphic families of polynomials or rational maps by mean of ergodic and pluripotential theoretic tools.

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

Coincidences of maps between smooth manifolds are studied via a geometric approach which involves (nonstabilized) normal bordism theory and pathspaces.

This introductory text arises from a lecture given in G\"oteborg, Sweden, given by the first author and is intended for undergraduate students, as well as for any mathematically inclined reader wishing to explore a synthesis of ideas…

In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions…

This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…

Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…

In this paper we study the set of projective maps between compact proper convex real projective manifolds. We show that this set contains only finitely many distinct homotopy classes and each homotopy class has the structure of a real…

The hypergeometric distributions have many important applications, but they have not had sufficient attention in information theory. Hypergeometric distributions can be approximated by binomial distributions or Poisson distributions. In…

We propose models and algorithms for learning about random directions in simplex-valued data. The models are applied to the study of income level proportions and their changes over time in a geostatistical area. There are several notable…

We study the polytopes of affine maps between two polytopes -- the hom-polytopes. The hom-polytope functor has a left adjoint -- tensor product polytopes. The analogy with the category of vector spaces is limited, as we illustrate by a…

This work has two main purposes. The first aim is to study isotropic Riemannian maps as a generalization of isotropic immersions. For this purpose, the concept of isotropic Riemannian map is presented, an example is given and a…

Graphs (1-skeletons) of Traveling-Salesman-related polytopes have attracted a lot of attention. Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes (Arthanari 2000) whose graphs contain the TSP…

We study the set of no-signalling empirical models on a measurement scenario, and show that the combinatorial structure of the no-signalling polytope is completely determined by the possibilistic information given by the support of the…

Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…