Related papers: Bias and dessins
A graphical design is a subset of graph vertices such that the weighted averages of certain graph eigenvectors over the design agree with their global averages. We use Gale duality to show that positively weighted graphical designs in…
In this paper, we associate a finite dimensional algebra, called a Brauer graph algebra, to every clean dessin d'enfant by constructing a quiver based on the monodromy of the dessin. We show that Galois conjugate dessins d'enfants give rise…
Much work has gone into matrix representations of Galois groups, but there is a whole new class of naturally occurring representations that have as yet gone almost unnoticed. In fact, it is well-known in various areas of mathematics that…
A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph which preserves the colouring of the vertices and extends to…
We give an account of the theory of dessins d'enfants which is both elementary and self-contained. We describe the equivalence of many categories (graphs embedded nicely on surfaces, finite sets with certain permutations, certain field…
To a given gene tree topology $G$ and species tree topology $S$ with leaves labeled bijectively from a fixed set $X$, one can associate a set of ancestral configurations, each of which encodes a set of gene lineages that can be found at a…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
The classical Galois theory deals with certain finite algebraic extensions and establishes a bijective order reversing correspondence between the intermediate fields and the subgroups of a group of permutations called the Galois group of…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
We give and study a construction of pre-Lie algebra structures on rooted trees whose edges and vertices are decorated, with a grafting product acting, through a map $\phi$, both on the decoration of the created edge and on the vertex that…
We study Grothendieck's dessins d'enfants in the context of the $\mathcal{N}=2$ supersymmetric gauge theories in $\left(3+1\right)$ dimensions with product $SU\left(2\right)$ gauge groups which have recently been considered by Gaiotto et…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
Many interesting classes of maps from homotopical algebra can be characterised as those maps with the right lifting property against certain sets of maps (such classes are sometimes referred to as cofibrantly generated). In a more…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
Graphical models provide a powerful methodology for learning the conditional independence structure in multivariate data. Inference is often focused on estimating individual edges in the latent graph. Nonetheless, there is increasing…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…