Related papers: Join operation and ${\mathcal A}$-finite map-germs
The main object of study of the present paper is the group $\au_n$ of \emph{unimodular automorphisms} of $\com^n$. Taking $\au_n$ as a working example, our intention was to develop an approach (or rather an edifice) which allows one to…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
This work presents the conjugacy classes of finite abelian subgroups of the Cremona group of the plane. Using a well-known theory, this problem amounts to the study of automorphism groups of some Del Pezzo surfaces and conic bundles. We…
Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…
We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…
The classification of map-germs up to the natural right-left equivalence (also known as A-equivalence) is often complicated. Certainly it is more complicated than K-equivalence which is extremely easy to work with because the associated…
A map between connected $2$-manifolds has a geometric kernel if it sends a non-contractible simple loop to a null-homotopic loop. While every non-$\pi_1$-injective map between compact surfaces admits a geometric kernel, this generally fails…
The purpose of this paper is to understand generic behavior of constraint functions in optimization problems relying on singularity theory of smooth mappings. To this end, we will focus on the subgroup $\mathcal{K}[G]$ of the Mather's group…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
Duality and chirality are examples of operations of order 2 on hypermaps. James showed that the groups of all operations on hypermaps and on oriented hypermaps can be identified with the outer automorphism groups ${\rm Out} \Delta\cong…
Clean markings on surfaces were a key component in Masur and Minsky's hierarchy machinery, which proved to be a powerful tool in the study of mapping class groups. We construct a marking graph for irreducible finite-type Artin groups which…
The group scheme of ternary automorphisms of a perfect finite dimensional evolution algebra A is computed. The main advantage of using group schemes is that it allows to apply the Lie functor to determine the Lie algebra of ternary…
We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
We translate the concept of the join of topological spaces to the language of $C^*$-algebras, replace the $C^*$-algebra of functions on the interval $[0,1]$ with evaluation maps at $0$ and $1$ by a unital $C^*$-algebra $C$ with appropriate…