Related papers: A filtration question on Belyi pairs and dessins

A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…

A sunflower is a collection of sets $\{U_1,\ldots, U_n\}$ such that the pairwise intersection $U_i\cap U_j$ is the same for all choices of distinct $i$ and $j$. We study sunflowers of convex open sets in $\mathbb R^d$, and provide a…

We show that a natural isomorphism between the rational cohomology groups of the two zero-dimensional Hilbert schemes of $n$-points of two surfaces, the affine plane minus the axes and the cotangent bundle of an elliptic curve, exchanges…

Using Hilbert transforms, we establish two families of sum rules involving Bessel moments, which are integrals associated with Feynman diagrams in two-dimensional quantum field theory. With these linear relations among Bessel moments, we…

Tangle is a concept in graph theory that has a dual relationship with branch-width which is well-known graph width parameter. Ultrafilter, a fundamental notion in mathematics, is similarly known to have a dual relationship with branch-width…

The problem of classifying off-shell representations of the $N$-extended one-dimensional super Poincar\'{e} algebra is closely related to the study of a class of decorated $N$-regular, $N$-edge colored bipartite graphs known as {\em…

Lenses are a mathematical structure for maintaining consistency between a pair of systems. In their ongoing research program, Johnson and Rosebrugh have sought to unify the treatment of symmetric lenses with spans of asymmetric lenses. This…

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

We consider a large class of so-called dynamical Belyi maps and study the Galois groups of iterates of such maps. From the combinatorial invariants of the maps, we construct a useful presentation of their Galois groups as subgroups of…

Using a filtration on the Grothendieck ring of triangulated categories, we define the categorical dimension of a birational map between smooth projective varieties. We show that birational automorphisms of bounded categorical dimension form…

Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and…

Intuitively, the filter dimension of an algebra or a module measures how `close' standard filtrations of the algebra or the module are. In particular, for a simple algebra it also measures the growth of how `fast' one can prove that the…

In \cite{K-rig}, a map $\beta:\mathcal R\to\mathcal{B}el$ from the set $\mathcal R$ of equivalence classes of rigid germs of finite morphisms branched in germs of curves having $ADE$ singularity types onto the set $\mathcal{B}el$ of…

In this paper, we consider associative algebras equipped with derivations. A pair consisting of an associative algebra and a distinguished derivation is called an AssDer pair. We study central extensions and formal one-parameter…

We show that there exist flat surface bundles with closed leaves having non-trivial normal bundles. This leads us to compute the Abelianisation of surface diffeomorphism groups with marked points. We also extend a formula of Tsuboi that…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

We prove that the Brauer group of the generic diagonal surface of arbitrary degree is trivial. The same method is applied to surfaces whose equation can be written as the sum of two bilinear forms. This uses a general criterion for the…

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…

We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more…

Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…