AbstractIt is shown that a collection of vertex two-colorable graphs with certain degree restrictions is intimately connected with those subgroups of the full modular group Γ of finite index. These (modular) graphs are analyzed as to structure, being shown to arise from explicit “lifts” of (modular) trees, which are then enumerated
We establish a correspondence between generalized quiver gauge theories in four dimensions and congr...
For a given graph G, modularity gives a score to each vertex partition, with higher values taken to ...
I explain a way to compute Fourier coefficients of modular forms associated to normalizer of non-spl...
Triangular modular curves are a generalization of modular curves that arise from quotients of the up...
Let G be a connected graph of order 3 or more and c:E(G)→Z k (k≥2 ) a k -edge coloring of G ...
We consider certain families of elliptic modular graphs, each of which is denoted by an arbitrary in...
Clustering algorithms for large networks typically use modularity values to test which partitions of...
Modular curves of the form X0(N) are intrinsically interesting curves to investigate. They contain a...
AbstractIt is a fairly longstanding conjecture that if G is any finite group with ¦G¦s > 2 and if X ...
AbstractWe present and prove the correctness of the program boundary, whose sources are available at...
A new general decomposition theory inspired from modular graph decomposition is presented. This help...
A part of Grothendieck's program for studying the Galois group G_ℚ of the field of all algebraic num...
AbstractGenus-one modular quotient groups have been studied in various guises, from the toroidal map...
Ordinary representation theory has been widely researched to the extent that there is a well-underst...
This thesis is about modular decomposition of graphs. The first part of the manuscript is devoted to...
We establish a correspondence between generalized quiver gauge theories in four dimensions and congr...
For a given graph G, modularity gives a score to each vertex partition, with higher values taken to ...
I explain a way to compute Fourier coefficients of modular forms associated to normalizer of non-spl...
Triangular modular curves are a generalization of modular curves that arise from quotients of the up...
Let G be a connected graph of order 3 or more and c:E(G)→Z k (k≥2 ) a k -edge coloring of G ...
We consider certain families of elliptic modular graphs, each of which is denoted by an arbitrary in...
Clustering algorithms for large networks typically use modularity values to test which partitions of...
Modular curves of the form X0(N) are intrinsically interesting curves to investigate. They contain a...
AbstractIt is a fairly longstanding conjecture that if G is any finite group with ¦G¦s > 2 and if X ...
AbstractWe present and prove the correctness of the program boundary, whose sources are available at...
A new general decomposition theory inspired from modular graph decomposition is presented. This help...
A part of Grothendieck's program for studying the Galois group G_ℚ of the field of all algebraic num...
AbstractGenus-one modular quotient groups have been studied in various guises, from the toroidal map...
Ordinary representation theory has been widely researched to the extent that there is a well-underst...
This thesis is about modular decomposition of graphs. The first part of the manuscript is devoted to...
We establish a correspondence between generalized quiver gauge theories in four dimensions and congr...
For a given graph G, modularity gives a score to each vertex partition, with higher values taken to ...
I explain a way to compute Fourier coefficients of modular forms associated to normalizer of non-spl...