arXiv subjects

Vladimir Shpilrain

Publications and source records attributed to Vladimir Shpilrain.

70 records · Page 4Linked to original sources

arXiv2002

Automorphic orbits in free groups

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_ϕ(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $ϕ$. If an orbit like that is finite, we determine precisely what its cardinality can be if $u$ runs through the whole group $F_n$, and $ϕ$ runs through the whole group $Aut(F_n)$. Another problem that we address here is related to Whitehead's algorithm that determines whether or not a given element of a free group of finite rank is an automorphic image of another given element. It is known that the first part of this algorithm (reducing a given free word to a free word of minimum possible length by elementary Whitehead automorphisms) is fast (of quadratic time with respect to the length of the word). On the other hand, the second part of the algorithm (applied to two words of the same minimum length) was always considered very slow. We give here an improved algorithm for the second part, and we believe this algorithm always terminates in polynomial time with respect to the length of the words. We prove that this is indeed the case if the free group has rank 2.

math.GR↗

arXiv2002

Average-case complexity and decision problems in group theory

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group $G$ has the word problem solvable in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group, then the average-case complexity of the word problem for $G$ is linear time, uniformly with respect to the collection of all length-invariant measures on $G$. For example, the result applies to all braid groups $B_n$.

math.GR↗

arXiv2002

Generic-case complexity, decision problems in group theory and random walks

We give a precise definition of ``generic-case complexity'' and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have linear-time generic-case complexity. We prove such theorems by using the theory of random walks on regular graphs.

math.GR↗

arXiv2002

Measuring sets in infinite groups

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a property P with probability p". The validity of a statement like that does, of course, heavily depend on how one defines probability on groups, or, equivalently, how one measures sets in a group (in particular, in a free group). We hope that new approaches to defining probabilities on groups outlined in this paper create, among other things, an appropriate framework for the study of the "average case" complexity of algorithms on groups.

math.GR↗

arXiv2002

Representing braids by automorphisms

Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof of the standard Artin's representation being faithful.

math.GR↗

arXiv2001

Affine varieties with equivalent cylinders

A well-known cancellation problem asks when, for two algebraic varieties $V_1, V_2 \subseteq {\bf C}^n$, the isomorphism of the cylinders $V_1 \times {\bf C}$ and $V_2 \times {\bf C}$ implies the isomorphism of $V_1$ and $V_2$. In this paper, we address a related problem: when the equivalence (under an automorphism of ${\bf C}^{n+1}$) of two cylinders $V_1 \times {\bf C}$ and $V_2 \times {\bf C}$ implies the equivalence of their bases $V_1$ and $V_2$ under an automorphism of ${\bf C}^n$? We concentrate here on hypersurfaces and show that this problem establishes a strong connection between the Cancellation conjecture of Zariski and the Embedding conjecture of Abhyankar and Sathaye. We settle the problem for a large class of polynomials. On the other hand, we give examples of equivalent cylinders with inequivalent bases (those cylinders, however, are not hypersurfaces). Another result of interest is that, for an arbitrary field $K$, the equivalence of two polynomials in $m$ variables under an automorphism of $K[x_1,..., x_n], n \ge m,$ implies their equivalence under a tame automorphism of $K[x_1,..., x_{2n}]$.

math.AG↗

arXiv2001

Non-extendable isomorphisms between affine varieties

In this paper, we report several large classes of affine varieties (over an arbitrary field $K$ of characteristic 0) with the following property: each variety in these classes has an isomorphic copy such that the corresponding isomorphism cannot be extended to an automorphism of the ambient affine space $K^n$. This implies, in particular, that each of these varieties has at least two inequivalent embeddings in $K^n$. The following application of our results seems interesting: we show that lines in $K^2$ are distinguished among irreducible algebraic retracts by the property of having a unique embedding in $K^2$.

math.AG↗

arXiv2000

Embeddings of hypersurfaces in affine spaces

In this paper, we address the following two general problems: given two algebraic varieties in ${\bf C}^n$, find out whether or not they are (1) isomorphic; (2) equivalent under an automorphism of ${\bf C}^n$. Although a complete solution of either of these problems is out of the question at this time, we give here some handy and useful invariants of isomorphic as well as of equivalent varieties. Furthermore, and more importantly, we give a universal procedure for obtaining all possible algebraic varieties isomorphic to a given one, and use it to construct numerous examples of isomorphic, but inequivalent algebraic varieties in ${\bf C}^n$. Among other things, we establish the following interesting fact: for isomorphic hypersurfaces $\{p(x_1,...,x_n)=0\}$ and $\{q(x_1,...,x_n)=0\}$, the number of zeros of $grad(p)$ might be different from that of $grad(q)$.

math.AG↗

arXiv1999

Peak reduction technique in commutative algebra

The "peak reduction" method is a powerful combinatorial technique with applications in many different areas of mathematics as well as theoretical computer science. It was introduced by Whitehead, a famous topologist and group theorist, who used it to solve an important algorithmic problem concerning automorphisms of a free group. Since then, this method was used to solve numerous problems in group theory, topology, combinatorics, and probably in some other areas as well. In this paper, we give a survey of what seems to be the first applications of the peak reduction technique in commutative algebra and affine algebraic geometry.

math.AG↗

arXiv1998

Embeddings of curves in the plane

In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several applications to the study of embeddings of algebraic curves in the plane. In particular, we show that for any $k \ge 2$, there is an irreducible curve with one place at infinity, which has at least $k$ inequivalent embeddings in $C^2$. Also, upon combining our method with a well-known theorem of Zaidenberg and Lin, we show that one can decide "almost" just by inspection whether or not a polynomial fiber is an irreducible simply connected curve.

math.AG↗

arXiv1998

Automorphisms of one-relator groups

It is a well-known fact that every group $G$ has a presentation of the form $G = F/R$, where $F$ is a free group and $R$ the kernel of the natural epimorphism from $F$ onto $G$. Driven by the desire to obtain a similar presentation of the group of automorphisms $Aut(G)$, we can consider the subgroup $Stab(R) \subseteq Aut(F)$ of those automorphisms of $F$ that stabilize $R$, and try to figure out if the natural homomorphism $Stab(R) \to Aut(G)$ is onto, and if it is, to determine its kernel. Both parts of this task are usually quite hard. The former part received considerable attention in the past, whereas the latter, more difficult, part (determining the kernel) seemed unapproachable. Here we approach this problem for a class of one-relator groups with a special kind of small cancellation condition. Then, we address a somewhat easier case of 2-generator (not necessarily one-relator) groups, and determine the kernel of the above mentioned homomorphism for a rather general class of those groups.

math.GR↗

arXiv1997

Combinatorial problems about free groups and algebras

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more generally, homomorphisms of various algebraic systems by means of their action on ``very small" sets of elements, as opposed to a traditional approach of studying their action on subsystems (like subgroups, normal subgroups; subalgebras, ideals, etc.) We will show that there is a lot that can be said about a homomorphism, given its action on just a single element, if this element is ``good enough". Then, we consider somewhat bigger sets of elements, like, for example, automorphic orbits, and study a variety of interesting problems arising in that framework. One more point that we make here is that one can use similar combinatorial ideas in seemingly distant areas of algebra, like, for example, group theory and commutative algebra. In particular, we use the same language of ``elementary transformations" in different contexts and show that this approach appears to be quite fruitful for all the areas involved.

math.GR↗

arXiv1997

Combinatorial methods: from groups to polynomial algebras

Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own powerful techniques. On the other hand, combinatorial commutative algebra emerged in the sixties, after Buchberger introduced what is now known as Gröbner bases. The purpose of this survey is to show how ideas from one of those areas contribute to the other.

math.GR↗

arXiv1997

Polynomial Retracts and the Jacobian Conjecture

Let $ K[x, y]$ be the polynomial algebra in two variables over a field $K$ of characteristic $0$. A subalgebra $R$ of $K[x, y]$ is called a retract if there is an idempotent homomorphism (a {\it retraction}, or {\it projection}) $φ: K[x, y] \to K[x, y]$ such that $φ(K[x, y]) = R$. The presence of other, equivalent, definitions of retracts provides several different methods of studying them, and brings together ideas from combinatorial algebra, homological algebra, and algebraic geometry. In this paper, we characterize all the retracts of $ K[x, y]$ up to an automorphism, and give several applications of this characterization, in particular, to the well-known Jacobian conjecture. Notably, we prove that if a polynomial mapping $φ$ of $K[x,y]$ has invertible Jacobian matrix {\it and } fixes a non-constant polynomial, then $φ$ is an automorphism.

math.AC↗

arXiv1996

Fixed points of endomorphisms of a free metabelian group

We consider IA-endomorphisms (i.e., Identical in Abelianization) of a free metabelian group of finite rank, and give a matrix characterization of their fixed points which is similar to (yet different from) the well-known characterization of eigenvectors of a linear operator in a vector space. We then use our matrix characterization to elaborate several properties of the fixed point groups of metabelian endomorphisms. In particular, we show that the rank of the fixed point group of an IA-endomorphism of the free metabelian group of rank $n \ge 2$ can be either equal to 0, 1, or greater than $(n-1)$ (in particular, it can be infinite). We also point out a connection between these properties of metabelian IA-endomorphisms and some properties of the Gassner representation of pure braid groups.

math.GR↗

arXiv1996

Generalized primitive elements of a free group

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like an automorphism" on one particular orbit), is itself an automorphism. Then, we consider elements of a different nature, defined by means of homological properties of the corresponding one-relator group. These elements (``generalized primitive elements"), interesting in their own right, can also be used for distinguishing automorphisms among arbitrary endomorphisms.

math.GR↗