Searcharxiv⌕ Search

arXiv subjects

Michael Shapiro

Publications and source records attributed to Michael Shapiro.

69 records · Page 4Linked to original sources

Cluster algebras and Weil-Petersson forms

In our previous paper we have discussed Poisson properties of cluster algebras of geometric type for the case of a nondegenerate matrix of transition exponents. In this paper we consider the case of a general matrix of transition exponents. Our leading idea that a relevant geometric object in this case is a certain closed 2-form compatible with the cluster algebra structure. The main example is provided by Penner coordinates on the decorated Teichmueller space, in which case the above form coincides with the classic Weil-Petersson symplectic form.

math.QA↗

On boundary values for rectifiable curves of a generalization of the Cauchy-type integral related to the Helmholtz operator in $R^2$

There are considered vector fields and quaternionic $α$-hyperholomorphic functions in a domain of $R^2$ which generalize the notion of solenoidal and irrotational vector fields. There are established sufficient conditions for the corresponding Cauchy-type integral along a closed Jordan rectifiable curve to be continuously extended onto the closure of a domain. The Sokhotski-Plemelj-type formulas are proved as well.

math.CV↗

Stratified spaces formed by totally positive varieties

By a theorem of A.Björner, for every interval $[u,v]$ in the Bruhat order of a Coxeter group $W$, there exists a stratified space whose strata are labeled by the elements of $[u,v]$, adjacency is described by the Bruhat order, and each closed stratum (resp., the boundary of each stratum) has the homology of a ball (resp., of a sphere). Answering a question posed by Björner, we suggest a natural geometric realization of these stratified spaces for a Weyl group $W$ of a semisimple Lie group $G$, and prove its validity in the case of the symmetric group. Our stratified spaces arise as links in the Bruhat decomposition of the totally nonnegative part of the unipotent radical of $G$.

math.CO↗

Simply-laced Coxeter groups and groups generated by symplectic transvections

Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W\times W. We associate to i a subgroup Gamma_i in GL_m(Z) generated by symplectic transvections. We prove among other things that the subgroups corresponding to different reduced words for the same pair (u,v) are conjugate to each other inside GL_m(Z). We also generalize the enumeration result of the first three authors (see AG/9802093) by showing that, under certain assumptions on u and v, the number of Gamma_i(F_2)-orbits in F_2^m is equal to 3\times 2^s, where s is the number of simple reflections that appear in a reduced decomposition for u or v and F_2 is the two-element field.

math.AG↗

On Hurwitz numbers and Hodge integrals

In this paper we find an explicit formula for the number of topologically different ramified coverings $C\to\CP^1$ (C is a compact Riemann surface of genus g) with only one complicated branching point in terms of Hodge integrals over the moduli space of genus g curves with marked points.

math.AG↗

Regular geodesic normal forms in virtually abelian groups

Cannon has given an example of a virtually abelian group and a generating set where the full language of geodesics is not regular. We describe a virtually abelian group and a generating set so that no regular language of geodesics surjects to the group.

math.GR↗

Rewriting Systems and Geometric 3-Manifolds

The fundamental groups of most (conjecturally, all) closed 3-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting systems. The general case remains open.

math.GR↗

Pascal's Triangles in Abelian and Hyperbolic Groups

Pascal's triangle will give the number of geodesics from the identity to each point of ${\bf Z}^2$ if you write it in each of the quadrants. Given a group $G$ and generating set $\cal G$ we take the {\it Pascal's function} $p_{\cal G}: G \to {\bf Z}_{\ge 0}$ to be the function which assigns to each $g\in G$ the number of geodesics from $1$ to $g$. We give a general method for calculating this in hyperbolic groups and discuss the generic case in abelian groups.

math.GR↗

Hyperbolic buildings, affine buildings and automatic groups

We see that a building whose Coxeter group is hyperbolic is itself hyperbolic. Thus any finitely generated group acting co-compactly on such a building is hyperbolic, hence automatic. We turn our attention to affine buildings and consider a group $Γ$ which acts simply transitively and in a ``type-rotating'' way on the vertices of a locally finite thick building of type $\tilde A_n$. We show that $Γ$ is biautomatic, using a presentation of $Γ$ and unique normal form for each element of $Γ$, as described in ``Groups acting simply transitively on the vertices of a building of type $\tilde A_n$'' by D.I. Cartwright, to appear, Proceedings of the 1993 Como conference ``Groups of Lie type and their geometries''.

math.GR↗

Automatic structures, rational growth and geometrically finite hyperbolic groups

We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$ of equivalence classes of biautomatic structures on $G$ is isomorphic to the product of the sets $BSA(P)$ over the cusps (conjugacy classes of maximal parabolic subgroups) of $G$. Each maximal parabolic $P$ is a virtually abelian group, so $SA(P)$ and $BSA(P)$ were computed in ``Equivalent automatic structures and their boundaries'' by M.Shapiro and W.Neumann, Intern. J. of Alg. Comp. 2 (1992) We show that any geometrically finite hyperbolic group has a generating set for which the full language of geodesics for $G$ is regular. Moreover, the growth function of $G$ with respect to this generating set is rational. We also determine which automatic structures on such a group are equivalent to geodesic ones. Not all are, though all biautomatic structures are.

math.GR↗

Almost Convex Groups and the Eight Geometries

If $M$ is a closed Nil geometry 3-manifold then $π_1(M)$ is almost convex with respect to a fairly simple ``geometric'' generating set. If $G$ is a central extension or a ${\Bbb Z}$-extension of a word hyperbolic group, then $G$ is also almost convex with respect to some generating set. Combining these with previously known results shows that if $M$ is a closed 3-manifold with one of Thurston's eight geometries, $π_1(M)$ is almost convex with respect to some generating set if and only if the geometry in question is not Sol.

math.GR↗

A note on Context Sensitive languages and Word Problems

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually free. In this note, we exhibit a class of groups where the word problem is as close as possible to being a context sensitive language. This class includes the automatic groups and is closed under passing to finitely generated subgroups. Consequently, it is quite large, including many groups which are not finitely presented.

math.GR↗

Automatic structures and boundaries for graphs of groups

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product bijects to the product of the sets of biautomatic structures on the vertex groups. The set of automatic structures is much richer. Indeed, it is dense in the infinite product of the sets of automatic structures of all conjugates of the vertex groups. We classify these structures by a class of labelled graphs which ``mimic" the underlying graph of the graph of groups. Analogous statements hold for asynchronous automatic structures. We also discuss the boundaries of these structures.

math.GR↗