Related papers: Dessins, their delta-matroids and partial duals
We consider N=2 supersymmetric gauge theories perturbed by tree level superpotential terms near isolated singular points in the Coulomb moduli space. We identify the Seiberg-Witten curve at these points with polynomial equations used to…
Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…
A domain exchange map (DEM) is a dynamical system defined on a smooth Jordan domain which is a piecewise translation. We explain how to use cut-and-project sets to construct minimal DEMs. Specializing to the case in which the domain is a…
We study the absolute Galois group by looking for invariants and orbits of its faithful action on Grothendieck's dessins d'enfants. We define a class of functions called Belyi-extending maps, which we use to construct new Galois invariants…
In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…
We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…
In this work all the dessins d'enfant with no more than 4 edges are listed and their Belyi pairs are computed. In order to enumerate all dessins the technique of matrix model computations was used. The total number of dessins is 134; among…
We study Dressians of matroids using the initial matroids of Dress and Wenzel. These correspond to cells in regular matroid subdivisions of matroid polytopes. An efficient algorithm for computing Dressians is presented, and its…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
Demoulin surfaces in real projective $3$-space are investigated. Our result enable us to establish a generalized Weierstrass type representation for definite Demoulin surfaces by virtue of primitive maps into a certain semi-Riemannian…
The logarithmic connections studied in the paper are direct images of regular connections on line bundles over genus-2 double covers of the elliptic curve. We give an explicit parametrization of all such connections, determine their…
We introduce a natural generalization of twisted maps, called \emph{warped maps}. While twisted maps play an important role in the study of Deligne--Mumford stacks, warped maps are better suited for studying Artin stacks. Heuristically,…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Every finite simple group P can be generated by two of its elements. Pairs of generators for P are available in the Atlas of finite group representations as (not neccessarily minimal) permutation representations P. It is unusual but…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
A dessin is an embedding of connected bipartite graph into an oriented closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts transitively on the edges. In the present paper regular dessins…
B\'ar\'any's colorful generalization of Carath\'eodory's Theorem combines geometrical and combinatorial constraints. Kalai-Meshulam (2005) and Holmsen (2016) generalized B\'ar\'any's theorem by replacing color classes with matroid…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…