Related papers: A framework for generalizing toric inequalities fo…

Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We show how to equip the cone complexes of toroidal embeddings with additional structure that allows to define a balancing condition for weighted subcomplexes. We then proceed to develop the foundations of an intersection theory on cone…

The operational Chow cohomology classes of a complete toric variety are identified with certain functions, called Minkowski weights, on the corresponding fan. The natural product of Chow cohomology classes makes the Minkowski weights into a…

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…

We study a generalized ergodic problem (E), which is a Hamilton-Jacobi equation of contact type, in the flat $n$-dimensional torus. We first obtain existence of solutions to this problem under quite general assumptions. Various examples are…

We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at…

In this paper we prove several inequalities by means of diagrammatic expansions, a technique already used in [BG13]. This time we show that iterations of the folding of a probability leads to the proof of some in- equalities by means of a…

In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…

We present a simple derivation of the entanglement entropy for a region made up of a union of disjoint intervals in 1+1 dimensional quantum field theories using holographic techniques. This generalizes the results for 1+1 dimensional…

Using elementary equalities between various cables of the unknot and the Hopf link, we prove the Wheels and Wheeling conjectures of [Bar-Natan, Garoufalidis, Rozansky and Thurston, arXiv:q-alg/9703025] and [Deligne, letter to Bar-Natan,…

We explain a general construction through which concave elliptic operators on complex manifolds give rise to concave functions on cohomology. In particular, this leads to generalized versions of the Khovanskii-Teissier inequalities.

We establish an equivariant generalization of the Novikov inequalities which allow to estimate the topology of the set of critical points of a closed basic invariant form by means of twisted equivariant cohomology of the manifold. We apply…

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

Using Dwork's theory, we prove a broad generalisation of his famous p-adic formal congruences theorem. This enables us to prove certain p-adic congruences for the generalized hypergeometric series with rational parameters; in particular,…

We show that, in discrete models of quantum gravity, emergent geometric space can be viewed as the entanglement pattern in a mixed quantum state of the "universe", characterized by a universal topological network entanglement. As a concrete…