English
Related papers

Related papers: On the refined counting of graphs on surfaces

200 papers

Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in…

Machine Learning · Computer Science 2015-05-21 Mehrtash Harandi , Richard Hartley , Chunhua Shen , Brian Lovell , Conrad Sanderson

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

Combinatorics · Mathematics 2022-05-04 Dominic van der Zypen

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Geometric Topology · Mathematics 2018-10-23 Sunrose T. Shrestha

A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…

Geometric Topology · Mathematics 2021-10-12 Ivan Dynnikov

Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann…

Algebraic Geometry · Mathematics 2009-10-31 An-Min Li , Guosong Zhao , Quan Zheng

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

Logic in Computer Science · Computer Science 2021-11-24 Jendrik Brachter , Pascal Schweitzer

We use the tropical geometry approach to compute absolute and relative Gromov-Witten invariants of complex surfaces which are $\CC P^1$-bundles over an elliptic curve. We also show that the tropical multiplicity used to count curves can be…

Algebraic Geometry · Mathematics 2022-12-14 Thomas Blomme

We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists…

Combinatorics · Mathematics 2011-12-01 Madhusudan Manjunath

In theories like SM or MSSM with a complex gauge group structure the complete set of Feynman diagrams contributed to a particular physics process can be splited to exact gauge invariant subsets. Arguments and examples given in the review…

High Energy Physics - Phenomenology · Physics 2009-11-07 E. E. Boos

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

Discrete Mathematics · Computer Science 2017-03-23 Glencora Borradaile , Jeff Erickson , Hung Le , Robbie Weber

$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…

Mathematical Physics · Physics 2022-11-15 Remi C. Avohou , Joseph Ben Geloun , Nicolas Dub

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

Discrete Mathematics · Computer Science 2017-09-15 Atsushi Yokoyama

Graph transformers typically embed every node in a single Euclidean space, blurring heterogeneous topologies. We prepend a lightweight Riemannian mixture-of-experts layer that routes each node to various kinds of manifold, mixture of…

Machine Learning · Computer Science 2025-07-11 Ankit Jyothish , Ali Jannesari

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

Combinatorics · Mathematics 2023-02-14 Valentin Bonzom

Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful…

Artificial Intelligence · Computer Science 2018-02-05 Hongyun Cai , Vincent W. Zheng , Kevin Chen-Chuan Chang

This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The…

Representation Theory · Mathematics 2013-12-31 Roger A. Horn , Vladimir V. Sergeichuk

We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…

Geometric Topology · Mathematics 2020-11-05 Ariadna Fossas , Hugo Parlier

Grafting is a surgery on Riemann surfaces introduced by Thurston which connects hyperbolic geometry and the theory of projective structures on surfaces. We will discuss the space of projective structures in terms of the Thurston's geometric…

Differential Geometry · Mathematics 2008-02-03 Harumi Tanigawa

The method of regions, which provides a systematic approach for computing Feynman integrals involving multiple kinematic scales, proposes that a Feynman integral can be approximated and even reproduced by summing over integrals expanded in…

High Energy Physics - Phenomenology · Physics 2024-10-01 Yao Ma

We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction.…

Strongly Correlated Electrons · Physics 2018-08-27 Fabian B. Kugler