SearcharxivSearch

arXiv subjects

Remi C. Avohou

Publications and source records attributed to Remi C. Avohou.

6 recordsLinked to original sources

Universality for polynomial invariants on ribbon graphs with half-ribbons

In this paper, we analyze the Bollobás and Riordan polynomial $\mathcal{R}$ for ribbon graphs with half-ribbons introduced in [Combinatorics, Probability and Computing 31, 507-549, 2022]. We prove the universality property of a multivariate version of $\mathcal{R}$ whereas $\mathcal{R}$ itself turns out to be universal for a subclass of ribbon graphs with half-ribbons. We also show that $\mathcal{R}$ can be defined on some equivalence classes of ribbon graphs involving half-ribbons moves and that the new polynomial is universal on these classes.

math.GT

Extending the Tutte and Bollobás-Riordan Polynomials to Rank 3 Weakly-Colored Stranded Graphs

The Bollobás-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored stranded graphs. Stranded graphs arise in the study of tensor models for quantum gravity in physics, and generalize graphs and ribbon graphs. We present a seven-variable polynomial invariant of these graphs, which obeys a contraction/deletion recursion relation similar to that of the Tutte and Bollobás-Riordan polynomials. However, it is defined on a much broader class of objects, and furthermore captures properties that are not encoded by the Tutte or Bollobás-Riordan polynomials.

math.GT

On the counting of $O(N)$ tensor invariants

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular graphs, using permutation group techniques. We also list their generating functions and give (software) algorithms computing their number at an arbitrary rank and an arbitrary number of vertices. As an interesting property, we reveal that the algebraic structure which organizes these invariants differs from that of the unitary invariants. The underlying topological field theory formulation of the rank $d$ counting shows that it corresponds to counting of coverings of the $d-1$ cylinders sharing the same boundary circle and with $d$ defects. At fixed rank and fixed number of vertices, an associative semi-simple algebra with dimension the number of invariants naturally emerges from the formulation. Using the representation theory of the symmetric group, we enlighten a few crucial facts: the enumeration of $O(N)$ invariants gives a sum of constrained Kronecker coefficients; there is a representation theoretic orthogonal base of the algebra that reflects its dimension; normal ordered 2-pt correlators of the Gaussian models evaluate using permutation group language, and further, via representation theory, these functions provide other representation theoretic orthogonal bases of the algebra.

math-ph

Embedding Half-Edge Graphs in Punctured Surfaces

It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in quantum field theory in physics. On the other hand, ribbon graphs with half-edges generalize ribbon graphs and appear in a different type of field theory emanating from matrix models. We then give a sense of embeddings of half-edge graphs in punctured surfaces and determine (minimal/maximal) conditions for an equivalence between these embeddings and half-edge ribbon graphs. Given some assumptions on the embedding, the geometric dual of a cellularly embedded half-edge graph is also identified.

math.CO

Recipe theorems for polynomial invariants on ribbon graphs with half-edges

We provide recipe theorems for the Bollobàs and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this new category of ribbon graphs and establish a relationship between $Q$ and $\mathcal{R}$.

math.CO

On terminal forms for topological polynomials for ribbon graphs: The $N$-petal flower

The Bollobas-Riordan polynomial [Math. Ann. 323, 81 (2002)] extends the Tutte polynomial and its contraction/deletion rule for ordinary graphs to ribbon graphs. Given a ribbon graph $\cG$, the related polynomial should be computable from the knowledge of the terminal forms of $\cG$ namely specific induced graphs for which the contraction/deletion procedure becomes more involved. We consider some classes of terminal forms as rosette ribbon graphs with $N\ge 1$ petals and solve their associate Bollobas-Riordan polynomial. This work therefore enlarges the list of terminal forms for ribbon graphs for which the Bollobas-Riordan polynomial could be directly deduced.

math.CO