Related papers: Higher genus modular graph functions, string invar…

The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…

We consider a two-dimensional diffusion process in a two-layered plane, governed by distinct covariance matrices in the upper and lower half-planes and by two drift vectors pointed away from the $x$-axis. We first analyze the case where the…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

A homogeneous two-dimensional metric including the degrees of freedom of Teichm\"uller deformation is developed. The Teichm\"uller deformation is incorporated by affine stretching of complex structure. According to Yamada's investigation by…

With this work we initiate a study of the representations of a unipotent group over a field of characteristic zero from the modular point of view. Let $G$ be such a group. The stack of all representations of a fixed finite dimension $n$ is…

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…

Let $f$ be a nonnegative integer valued function on the vertex set of a graph. A graph is \textbf{strictly $f$-degenerate} if each nonempty subgraph $\Gamma$ has a vertex $v$ such that $\mathrm{deg}_{\Gamma}(v) < f(v)$. In this paper, we…

Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…

Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…

We conjecture a formula for the spectral form factor of a double-scaled matrix integral in the limit of large time, large density of states, and fixed temperature. The formula has a genus expansion with a nonzero radius of convergence. To…

Here we continue to list the differential operators invariant with respect to the 15 exceptional simple Lie superalgebras of polynomial vector fields. A part of the list (for operators acting on tensors with finite dimensional fibers) was…

Recently we introduced the hypergraph matrix model (HMM), a Hermitian matrix model generalizing the classical Gaussian Unitary Ensemble (GUE). In this model the Gaussians of the GUE, whose moments count partitions of finite sets into pairs,…

The electromagnetic Green's function is expressed from the inverse Helmholtz operator, where a second frequency has been introduced as a new degree of freedom. The first frequency results from the frequency decomposition of the…

Archdeacon (1987) proved that graphs embeddable on a fixed surface can be $3$-coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, Oum and Seymour (2015) proved that graphs with no…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

The determinants of modular Collatz graphs and the modular Conway amusical permutation graph are determined, and some interesting number theoretic properties are described.

In this paper we study the degeneration behavior of the norm of the Riemann $\theta$-function in a family of principally polarized abelian varieties over the punctured complex unit disc in terms of the associated polarized real torus. As an…