Related papers: Iterations and groups of formal transformations
Let $X$ be a simply connected pointed space with finitely generated homotopy groups. Let $\Pi_n(X)$ denote the set of all continuous maps $a:I^n\to X$ taking $\partial I^n$ to the basepoint. For $a\in\Pi_n(X)$, let $[a]\in\pi_n(X)$ be its…
There are solved standard problems related to Formal (Holomorphic) Segre preserving Mappings of non-trivial Real-Formal Hypersurfaces in $\mathbb{C}^{2}$.
Let X be a complex algebraic variety, and L(X) be the scheme of formal arcs in X. Let f be an arc whose image is not contained in the singularities of X. We show that the formal neighborhood of f in L(X) admits a decomposition into a…
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…
We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…
This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…
In analogy with non-degenerate involutive set-theoretic solutions of the Yang-Baxter equation and braces, we define non-degenerate involutive partial set-theoretic solutions and partial braces. We define the structure group and the…
We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms…
We describe geometric non-commutative formal groups in terms of a geometric commutative formal group with a Poisson structure on its splay algebra. We describe certain natural properties of such Poisson structures and show that any such…
We study the group of all linear automorphisms preserving an arbitrary bilinear form
We study iterations of two classical constructions, the evolutes and involutes of plane curves, and we describe the limiting behavior of both constructions on a class of smooth curves with singularities given by their support functions.…
This paper is a continuation of our first paper [10] in which we showed how deformation theory of representation varieties can be used to study finite simple quotients of triangle groups. While in Part I, we mainly used deformations of the…
In this paper we give a general geometrical framework for working with problems that can be described as a structure-preserving submersion defined on a suitable space with a geometrical structure. We give many examples of how to formulate…
The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…
By using a similar pattern of arguments, we show that in three categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at…
It is proven that the identity component of the group preserving the leaves of a generalized foliation is perfect. This shows that a well-known simplicity theorem on the diffeomorphism group extends to the nontransitive case.
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.