English
Related papers

Related papers: On the two-point function of general planar maps a…

200 papers

The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…

Machine Learning · Computer Science 2025-03-04 Vatsal Srivastava

We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…

Combinatorics · Mathematics 2017-12-15 Olivier Bernardi , Éric Fusy

Bifurcation with symmetry is considered in the case of an isotropy subgroup with a two-dimensional fixed point subspace and non-zero quadratic terms. In general, there are one or three branches of solutions, and five qualitatively different…

Dynamical Systems · Mathematics 2007-05-23 P. C. Matthews

We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic…

Number Theory · Mathematics 2018-11-13 Jeroen Sijsling , John Voight

This paper presents an analysis on the effects of floating-point arithmetic on the constructing bifurcation diagram of the quadratic map. More precisely, we are interested in showing the dependence of initial conditions to obtain some…

Signal Processing · Electrical Eng. & Systems 2017-11-29 Thalita E. Nazare , Erivelton G. Nepomuceno , Bruno P. O. Paiva

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

High Energy Physics - Theory · Physics 2023-08-23 Alonso Perez-Lona , Eric Sharpe

We discuss the bifurcation structure of homoclinic orbits in bimodal one dimensional maps. The universal structure of these bifurcations with singular bifurcation points and the web of bifurcation lines through the parameter space are…

chao-dyn · Physics 2009-10-22 Kai T. Hansen

We study the problem of calculating two-loop three-point diagrams with irreducible numerators (i.e. numerators which cannot be expressed in terms of the denominators). For the case of massless internal particles and arbitrary (off-shell)…

High Energy Physics - Phenomenology · Physics 2014-11-17 Natalia I. Ussyukina , Andrei I. Davydychev

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Combinatorics · Mathematics 2010-01-26 Thomas Zaslavsky

Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…

High Energy Physics - Theory · Physics 2009-10-31 Gerard 't Hooft

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

Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…

Numerical Analysis · Mathematics 2025-10-20 Amparo Gil , Wolfram Koepf , Javier Segura

Present and future high-precision tests of the Standard Model and beyond for the fundamental constituents and interactions in Nature are demanding complex perturbative calculations involving multi-leg and multi-loop Feynman diagrams.…

High Energy Physics - Phenomenology · Physics 2011-04-15 Luis G. Cabral-Rosetti , Miguel A. Sanchis-Lozano

We express the number of points on the Dwork hypersurface $$X_{\lambda}^d: x_1^d+x_2^d+\cdots +x_d^d=d\lambda x_1x_2\cdots x_d$$ over a finite field of order $q \not \equiv 1 \pmod{d}$ in terms of McCarthy's $p$-adic hypergeometric function…

Number Theory · Mathematics 2019-02-20 Rupam Barman , Hasanur Rahman , Neelam Saikia

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to…

Data Structures and Algorithms · Computer Science 2017-07-24 Patrizio Angelini , Michael A. Bekos

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

Discrete Mathematics · Computer Science 2018-12-12 Hoang-Oanh Le , Van Bang Le

In this work, we obtained separation results via codimension-1 maps to generalized manifolds. More specifically, we proved results that allow us to estimate the number of connected components of the complement of the image of such maps.

Algebraic Topology · Mathematics 2026-04-07 Edivaldo L. dos Santos , Telmo I. Acosta Vellozo

In $\mathcal{N}=1$ superconformal theories in four dimensions the two-point function of superconformal multiplets is known up to an overall constant. A superconformal multiplet contains several conformal primary operators, whose two-point…

High Energy Physics - Theory · Physics 2018-03-08 Daliang Li , Andreas Stergiou

We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…

Probability · Mathematics 2020-12-11 Thomas Budzinski , Baptiste Louf

Here we prove that counting maximum matchings in planar, bipartite graphs is #P-complete. This is somewhat surprising in the light that the number of perfect matchings in planar graphs can be computed in polynomial time. We also prove that…

Computational Complexity · Computer Science 2021-03-09 Istvan Miklos , Miklos Kresz