Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Avohou, Remi C."'
Publikováno v:
Adv. Theor. Math. Phys. 24 (2020) 4, 821-878
$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, usin
Externí odkaz:
http://arxiv.org/abs/1907.04668
Publikováno v:
In Discrete Applied Mathematics 15 March 2023 327:1-17
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 t
Externí odkaz:
http://arxiv.org/abs/1708.08720
We provide recipe theorems for the Bollob\`as 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
Externí odkaz:
http://arxiv.org/abs/1410.7039
In this paper, we analyze the Bollob\'as 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
Externí odkaz:
http://arxiv.org/abs/1310.3708
Publikováno v:
Combinatorics, Probability and Computing, 31 (2022) 507-549
The Bollob\'as-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 graph
Externí odkaz:
http://arxiv.org/abs/1301.1987
Publikováno v:
European Journal of Combinatorics 36, February 2014, p.348-366
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 knowledg
Externí odkaz:
http://arxiv.org/abs/1212.5961
Publikováno v:
In European Journal of Combinatorics February 2014 36:348-366
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Combinatorics, Probability & Computing; May2022, Vol. 31 Issue 3, p507-549, 43p