Related papers: A filtration question on Belyi pairs and dessins
We study generalized filters that are associated to multiplicity functions and homomorphisms of the dual of an abelian group. These notions are based on the structure of generalized multiresolution analyses. We investigate when the Ruelle…
Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship between lifted digraphs of voltage digraphs and line…
Rayleigh-L\'evy flights are simplified cosmological tools which capture certain essential statistical properties of the cosmic density field, including hierarchical structures in higher-order correlations, making them a valuable reference…
In this paper we construct arithmetic analogs of the Riemann-Roch theorem and Serre's duality for line bundles. This improves on the works of Tate and van der Geer - Schoof. We define $H^0(L)$ and $H^1(L)$ as some convolution of measures…
We prove an analog of Belyi's theorem for the algebraic surfaces. Namely, any non-singular algebraic surface can be defined over a number field if and only it covers the complex projective plane with ramification at three knotted…
We present the viewpoint of treating one-dimensional band structures as Riemann surfaces, linking the unique properties of non-Hermiticity to the geometry and topology of the Riemann surface. Branch cuts and branch points play a significant…
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
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…
The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
A result of Belyi can be stated as follows. Every curve defined over a number field can be expressed as a cover of the projective line with branch locus contained in a rigid divisor. We define the notion of geometrically rigid divisors in…
A map between manifolds which matches up families of complete vector fields is a fiber bundle mapping on each orbit of those vector fields.
In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with…
A relative Picard theory in the context of graded manifolds is introduced. A Berezinian calculus and a theory of connections over SUSY-curves are systematically developed, and used to prove a Gauss-Bonnet theorem for line bundles in that…
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic…
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…
A ballean is a set $X$ endowed with some family $\F$ of its subsets, called the balls, in such a way that $(X,\F)$ can be considered as an asymptotic counterpart of a uniform topological space. Given a cardinal $\kappa$, we define $\F$…