Related papers: Joining dessins together
We introduce some new higher dimensional generalizations of the Dedekind sums associated with the Bernoulli functions and of those Hardy sums which are defined by the sawtooth function. We generalize a variant of Parseval's formula for the…
Elementary complex analysis and Hilbert space methods show that a union of at most n arcs on the circle is uniquely determined by the nth Fourier partial sum of its characteristic function. The endpoints of the arcs can be recovered from…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
In this work we will construct bipartite graphs, famously known as Dessin d'enfant, corresponding to finite index subgroups of Hecke triangle groups $(2, q, \infty )$. Then using a results of \cite{ll} we shall show the correspondences…
The diagrammatic coaction encodes the analytic structure of Feynman integrals by mapping any given Feynman diagram into a tensor product of diagrams defined by contractions and cuts of the original diagram. Feynman integrals evaluate to…
On a finite graph, we prove that trace of holonomies determine an intertwining relation between merge-and-split generators on collections of geodesic loops ensembles and Casimir operators on unitary connections. By adding a deformation part…
Using the connections among almost complete intersection schemes, arithmetically Gorenstein schemes and schemes that are union of complete intersections we give a structure theorem for arithmetically Cohen-Macaulay union of two complete…
A unicellular collection on a surface is a collection of curves whose complement is a single disk. There is a natural surgery operation on unicellular collections, endowing the set of such with a graph structure where the edge relation is…
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…
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopscotch, is new, although specialised…
This paper gives a key definition, for a new approach to dessins and algebraic numbers. The distant goal is to construct from each dessin $D$ an algebraic number $\eta_D$, in a systematic and useful way. The algebra of balanced dessins is…
The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…
This paper extends the univariate Theory of Connections, introduced in (Mortari,2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface,…
The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…
G\"ottsche and Soergel gave formulas for the Hodge numbers of Hilbert schemes of points on a smooth algebraic surface and the Hodge numbers of generalized Kummer varieties. When a smooth projective surface $S$ admits an action by a finite…
This is an account of a series of lectures of Graham Higman on "januarials", namely coset graphs for actions of triangle groups which become 2-face maps when embedded in orientable surfaces.
The notion of sofic equivalence relation was introduced by Gabor Elek and Gabor Lippner. Their technics employ some graph theory. Here we define this notion in a more operator algebraic context, starting from Connes' embedding problem, and…
Placing regular 4n-sided polygons correctly, equations between sine and sums of sines show up -- exactly these equations are used in B\"urgi's method to approximate sines.
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…