Related papers: Orientably-Regular $\pi$-Maps and Regular $\pi$-Ma…

We study proper holomorphic maps of annuli in complex Euclidean spaces, that is, domains with $U(n)$ as the automorphism group. By the Hartogs phenomenon and a result of Forstneri\v{c}, such maps are always rational and extend to proper…

We show that the normal closure of any periodic element of the mapping class group of a non-orientable surface whose order is greater than 2 contains the commutator subgroup, which for $g\geq 7$ is equal to the twist subgroup, and provide…

Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it is known that in most cases there are no distortion maps. In…

A component of the moduli space M_g(Y,b) of stable maps from genus g curves to a variety Y is said to be regular if it is generically smooth and of the expected dimension provided by deformation theory. In this note we prove existence of…

Let $\pi$ be a set of primes. According to H. Wielandt, a subgroup $H$ of a finite group $X$ is called a $\pi$-submaximal subgroup if there is a monomorphism $\phi:X\rightarrow Y$ into a finite group $Y$ such that $X^\phi$ is subnormal in…

The orientation completion problem for a class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class by orienting the unoriented edges of the partially oriented graph.…

In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

In this note, we generalize biharmonic equation for rotationally symmetric maps ([4], [16], [10]) to equivariant maps between model spaces and use it to give a complete classification of rotationally symmetric conformal biharmonic maps from…

Given a $C^1$ planes distribution $P_T$ on all ${\mathbb R}^m$ we consider {\em horizontal $\alpha$-harmonic maps}, $\alpha\ge 1/2$, with respect to such a distribution. These are maps $u\in H^{\alpha}({{\mathbb R}}^k,{{\mathbb R}}^m)$…

We investigate {\it Gottlieb map}s, which are maps $f:E\to B$ that induce the maps between the Gottlieb groups $\pi_n (f)|_{G_n(E)}:G_n(E)\to G_n(B)$ for all $n$, from a rational homotopy theory point of view.We will define the obstruction…

An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.

Let $G$ a semisimple Lie group of non-compact type and let $\mathcal{X}_G$ be the Riemannian symmetric space associated to it. Suppose $\mathcal{X}_G$ has dimension $n$ and it has no factor isometric to either $\mathbb{H}^2$ or…

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V,E)$ is an orientation $D$ of $E(G)$ such that for every two adjacent vertices $ v $ and $ u $, $ d^{-}_{D}(v) \neq d^{-}_{D}(u)$ where…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Dynamic maps that allow continuous map rotations, e.g., on mobile devices, encounter new issues unseen in static map labeling before. We study the following dynamic map labeling problem: The input is a static, labeled map, i.e., a set P of…