Related papers: Partial duality of hypermaps
In this note we study order reversing quasi involutions and their properties. These maps are dualities (order reversing involutions) on their image. We prove that any order reversing quasi involution is induced by a cost. Invariant sets of…
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 analyze the geometry of domain Markov half planar triangulations. In \cite{AR13} it is shown that there exists a one-parameter family of measures supported on half planar triangulations satisfying translation invariance and domain Markov…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…
We describe an application of Poincar\'e duality for completed homology spaces (as defined by Emerton) to level raising for p-adic modular forms. This allows us to give a new description of the image of Chenevier's p-adic Jacquet-Langlands…
For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…
We give the definition of a duality that is applicable to arbitrary $k$-forms. The operator that defines the duality depends on a fixed form $\Omega$. Our definition extends in a very natural way the Hodge duality of $n$-forms in $2n$…
A subvariety of a complex projective space has a well-known dual variety, which is the set of its tangent hyperplanes. The purpose of this paper is to generalise this notion for a subvariety of a quite general partial flag variety. A…
An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…
We introduce a duality triads` notion. These are dual recurrences as used in dynamical data bases theory completed by a third pertinacious relation. Several representative examples of them are given. q-Gaussian triads as well as Fibonomial…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
A 3-dimensional model dual to the Rozansky-Witten topological sigma-model with a hyper-Kaehler target space is considered. It is demonstrated that a Feynman diagram calculation of the classical part of its partition function yields the…
We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…
We investigate the Ulrich complexity of certain examples of Brauer--Severi varieties, twisted flags and involution varieties and establish lower and upper bounds. Furthermore, we relate Ulrich complexity to the categorical representability…
We give precise estimates on the number of active/inactive half-edges in the configuration model used to generate random regular graphs. This is obtained by analyzing a more general urn model with negative eigenvalues.
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…