Author: S. V. Ivanov
Publisher: American Mathematical Soc.
ISBN: 1470441438
Category : Education
Languages : en
Pages : 118
Book Description
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.
The Bounded and Precise Word Problems for Presentations of Groups
Author: S. V. Ivanov
Publisher: American Mathematical Soc.
ISBN: 1470441438
Category : Education
Languages : en
Pages : 118
Book Description
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.
Publisher: American Mathematical Soc.
ISBN: 1470441438
Category : Education
Languages : en
Pages : 118
Book Description
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.
The Bounded and Precise Word Problems for Presentations of Groups
Author: S. V. IVANOV
Publisher:
ISBN: 9781470458041
Category : Electronic books
Languages : en
Pages : 106
Book Description
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and th.
Publisher:
ISBN: 9781470458041
Category : Electronic books
Languages : en
Pages : 106
Book Description
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and th.
Double Affine Hecke Algebras and Congruence Groups
Author: Bogdan Ion
Publisher: American Mathematical Soc.
ISBN: 1470443260
Category : Education
Languages : en
Pages : 90
Book Description
The most general construction of double affine Artin groups (DAAG) and Hecke algebras (DAHA) associates such objects to pairs of compatible reductive group data. We show that DAAG/DAHA always admit a faithful action by auto-morphisms of a finite index subgroup of the Artin group of type A2, which descends to a faithful outer action of a congruence subgroup of SL(2, Z)or PSL(2, Z). This was previously known only in some special cases and, to the best of our knowledge, not even conjectured to hold in full generality. It turns out that the structural intricacies of DAAG/DAHA are captured by the underlying semisimple data and, to a large extent, even by adjoint data; we prove our main result by reduction to the adjoint case. Adjoint DAAG/DAHA correspond in a natural way to affine Lie algebras, or more precisely to their affinized Weyl groups, which are the semi-direct products W Q∨ of the Weyl group W with the coroot lattice Q∨. They were defined topologically by van der Lek, and independently, algebraically, by Cherednik. We now describe our results for the adjoint case in greater detail. We first give a new Coxeter-type presentation for adjoint DAAG as quotients of the Coxeter braid groups associated to certain crystallographic diagrams that we call double affine Coxeter diagrams. As a consequence we show that the rank two Artin groups of type A2,B2,G2 act by automorphisms on the adjoint DAAG/DAHA associated to affine Lie algebras of twist number r =1, 2, 3, respec-tively. This extends a fundamental result of Cherednik for r =1. We show further that the above rank two Artin group action descends to an outer action of the congruence subgroup Γ1(r). In particular, Γ1(r) acts naturally on the set of isomorphism classes of representations of an adjoint DAAG/DAHA of twist number r, giving rise to a projective representation of Γ1(r)on the spaceof aΓ1(r)-stable representation. We also provide a classification of the involutions of Kazhdan-Lusztig type that appear in the context of these actions.
Publisher: American Mathematical Soc.
ISBN: 1470443260
Category : Education
Languages : en
Pages : 90
Book Description
The most general construction of double affine Artin groups (DAAG) and Hecke algebras (DAHA) associates such objects to pairs of compatible reductive group data. We show that DAAG/DAHA always admit a faithful action by auto-morphisms of a finite index subgroup of the Artin group of type A2, which descends to a faithful outer action of a congruence subgroup of SL(2, Z)or PSL(2, Z). This was previously known only in some special cases and, to the best of our knowledge, not even conjectured to hold in full generality. It turns out that the structural intricacies of DAAG/DAHA are captured by the underlying semisimple data and, to a large extent, even by adjoint data; we prove our main result by reduction to the adjoint case. Adjoint DAAG/DAHA correspond in a natural way to affine Lie algebras, or more precisely to their affinized Weyl groups, which are the semi-direct products W Q∨ of the Weyl group W with the coroot lattice Q∨. They were defined topologically by van der Lek, and independently, algebraically, by Cherednik. We now describe our results for the adjoint case in greater detail. We first give a new Coxeter-type presentation for adjoint DAAG as quotients of the Coxeter braid groups associated to certain crystallographic diagrams that we call double affine Coxeter diagrams. As a consequence we show that the rank two Artin groups of type A2,B2,G2 act by automorphisms on the adjoint DAAG/DAHA associated to affine Lie algebras of twist number r =1, 2, 3, respec-tively. This extends a fundamental result of Cherednik for r =1. We show further that the above rank two Artin group action descends to an outer action of the congruence subgroup Γ1(r). In particular, Γ1(r) acts naturally on the set of isomorphism classes of representations of an adjoint DAAG/DAHA of twist number r, giving rise to a projective representation of Γ1(r)on the spaceof aΓ1(r)-stable representation. We also provide a classification of the involutions of Kazhdan-Lusztig type that appear in the context of these actions.
The Irreducible Subgroups of Exceptional Algebraic Groups
Author: Adam R. Thomas
Publisher: American Mathematical Soc.
ISBN: 1470443376
Category : Education
Languages : en
Pages : 191
Book Description
This paper is a contribution to the study of the subgroup structure of excep-tional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group G is called irreducible if it lies in no proper parabolic subgroup of G. In this paper we com-plete the classification of irreducible connected subgroups of exceptional algebraic groups, providing an explicit set of representatives for the conjugacy classes of such subgroups. Many consequences of this classification are also given. These include results concerning the representations of such subgroups on various G-modules: for example, the conjugacy classes of irreducible connected subgroups are determined by their composition factors on the adjoint module of G, with one exception. A result of Liebeck and Testerman shows that each irreducible connected sub-group X of G has only finitely many overgroups and hence the overgroups of X form a lattice. We provide tables that give representatives of each conjugacy class of connected overgroups within this lattice structure. We use this to prove results concerning the subgroup structure of G: for example, when the characteristic is 2, there exists a maximal connected subgroup of G containing a conjugate of every irreducible subgroup A1 of G.
Publisher: American Mathematical Soc.
ISBN: 1470443376
Category : Education
Languages : en
Pages : 191
Book Description
This paper is a contribution to the study of the subgroup structure of excep-tional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group G is called irreducible if it lies in no proper parabolic subgroup of G. In this paper we com-plete the classification of irreducible connected subgroups of exceptional algebraic groups, providing an explicit set of representatives for the conjugacy classes of such subgroups. Many consequences of this classification are also given. These include results concerning the representations of such subgroups on various G-modules: for example, the conjugacy classes of irreducible connected subgroups are determined by their composition factors on the adjoint module of G, with one exception. A result of Liebeck and Testerman shows that each irreducible connected sub-group X of G has only finitely many overgroups and hence the overgroups of X form a lattice. We provide tables that give representatives of each conjugacy class of connected overgroups within this lattice structure. We use this to prove results concerning the subgroup structure of G: for example, when the characteristic is 2, there exists a maximal connected subgroup of G containing a conjugate of every irreducible subgroup A1 of G.
The 2D Compressible Euler Equations in Bounded Impermeable Domains with Corners
Author: Paul Godin
Publisher: American Mathematical Soc.
ISBN: 1470444216
Category : Education
Languages : en
Pages : 72
Book Description
We study 2D compressible Euler flows in bounded impermeable domains whose boundary is smooth except for corners. We assume that the angles of the corners are small enough. Then we obtain local (in time) existence of solutions which keep the L2 Sobolev regularity of their Cauchy data, provided the external forces are sufficiently regular and suitable compatibility conditions are satisfied. Such a result is well known when there is no corner. Our proof relies on the study of associated linear problems. We also show that our results are rather sharp: we construct counterexamples in which the smallness condition on the angles is not fulfilled and which display a loss of L2 Sobolev regularity with respect to the Cauchy data and the external forces.
Publisher: American Mathematical Soc.
ISBN: 1470444216
Category : Education
Languages : en
Pages : 72
Book Description
We study 2D compressible Euler flows in bounded impermeable domains whose boundary is smooth except for corners. We assume that the angles of the corners are small enough. Then we obtain local (in time) existence of solutions which keep the L2 Sobolev regularity of their Cauchy data, provided the external forces are sufficiently regular and suitable compatibility conditions are satisfied. Such a result is well known when there is no corner. Our proof relies on the study of associated linear problems. We also show that our results are rather sharp: we construct counterexamples in which the smallness condition on the angles is not fulfilled and which display a loss of L2 Sobolev regularity with respect to the Cauchy data and the external forces.
Conformal Graph Directed Markov Systems on Carnot Groups
Author: Vasileios Chousionis
Publisher: American Mathematical Soc.
ISBN: 1470442159
Category : Mathematics
Languages : en
Pages : 170
Book Description
The authors develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, they develop the thermodynamic formalism and show that, under natural hypotheses, the limit set of an Carnot conformal GDMS has Hausdorff dimension given by Bowen's parameter. They illustrate their results for a variety of examples of both linear and nonlinear iterated function systems and graph directed Markov systems in such sub-Riemannian spaces. These include the Heisenberg continued fractions introduced by Lukyanenko and Vandehey as well as Kleinian and Schottky groups associated to the non-real classical rank one hyperbolic spaces.
Publisher: American Mathematical Soc.
ISBN: 1470442159
Category : Mathematics
Languages : en
Pages : 170
Book Description
The authors develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, they develop the thermodynamic formalism and show that, under natural hypotheses, the limit set of an Carnot conformal GDMS has Hausdorff dimension given by Bowen's parameter. They illustrate their results for a variety of examples of both linear and nonlinear iterated function systems and graph directed Markov systems in such sub-Riemannian spaces. These include the Heisenberg continued fractions introduced by Lukyanenko and Vandehey as well as Kleinian and Schottky groups associated to the non-real classical rank one hyperbolic spaces.
Operator Theory on One-Sided Quaternion Linear Spaces: Intrinsic $S$-Functional Calculus and Spectral Operators
Author: Jonathan Gantner
Publisher: American Mathematical Society
ISBN: 1470442388
Category : Mathematics
Languages : en
Pages : 114
Book Description
Two major themes drive this article: identifying the minimal structure necessary to formulate quaternionic operator theory and revealing a deep relation between complex and quaternionic operator theory. The theory for quaternionic right linear operators is usually formulated under the assumption that there exists not only a right- but also a left-multiplication on the considered Banach space $V$. This has technical reasons, as the space of bounded operators on $V$ is otherwise not a quaternionic linear space. A right linear operator is however only associated with the right multiplication on the space and in certain settings, for instance on quaternionic Hilbert spaces, the left multiplication is not defined a priori, but must be chosen randomly. Spectral properties of an operator should hence be independent of the left multiplication on the space.
Publisher: American Mathematical Society
ISBN: 1470442388
Category : Mathematics
Languages : en
Pages : 114
Book Description
Two major themes drive this article: identifying the minimal structure necessary to formulate quaternionic operator theory and revealing a deep relation between complex and quaternionic operator theory. The theory for quaternionic right linear operators is usually formulated under the assumption that there exists not only a right- but also a left-multiplication on the considered Banach space $V$. This has technical reasons, as the space of bounded operators on $V$ is otherwise not a quaternionic linear space. A right linear operator is however only associated with the right multiplication on the space and in certain settings, for instance on quaternionic Hilbert spaces, the left multiplication is not defined a priori, but must be chosen randomly. Spectral properties of an operator should hence be independent of the left multiplication on the space.
Bounded Littlewood Identities
Author: Eric M. Rains
Publisher: American Mathematical Soc.
ISBN: 1470446901
Category : Education
Languages : en
Pages : 115
Book Description
We describe a method, based on the theory of Macdonald–Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald’s partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type (R, S) in terms of ordinary Macdonald polynomials, are q, t-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our method implies that MacMahon’s famous ex-conjecture for the generating function of symmetric plane partitions in a box follows from the identification of GL(n, R), O(n) as a Gelfand pair. As further applications, we obtain combinatorial formulas for characters of affine Lie algebras; Rogers–Ramanujan identities for affine Lie algebras, complementing recent results of Griffin et al.; and quadratic transformation formulas for Kaneko–Macdonald-type basic hypergeometric series.
Publisher: American Mathematical Soc.
ISBN: 1470446901
Category : Education
Languages : en
Pages : 115
Book Description
We describe a method, based on the theory of Macdonald–Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald’s partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type (R, S) in terms of ordinary Macdonald polynomials, are q, t-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our method implies that MacMahon’s famous ex-conjecture for the generating function of symmetric plane partitions in a box follows from the identification of GL(n, R), O(n) as a Gelfand pair. As further applications, we obtain combinatorial formulas for characters of affine Lie algebras; Rogers–Ramanujan identities for affine Lie algebras, complementing recent results of Griffin et al.; and quadratic transformation formulas for Kaneko–Macdonald-type basic hypergeometric series.
Dynamics Near the Subcritical Transition of the 3D Couette Flow I: Below Threshold Case
Author: Jacob Bedrossian
Publisher: American Mathematical Soc.
ISBN: 1470442175
Category : Mathematics
Languages : en
Pages : 170
Book Description
The authors study small disturbances to the periodic, plane Couette flow in the 3D incompressible Navier-Stokes equations at high Reynolds number Re. They prove that for sufficiently regular initial data of size $epsilon leq c_0mathbf {Re}^-1$ for some universal $c_0 > 0$, the solution is global, remains within $O(c_0)$ of the Couette flow in $L^2$, and returns to the Couette flow as $t rightarrow infty $. For times $t gtrsim mathbf {Re}^1/3$, the streamwise dependence is damped by a mixing-enhanced dissipation effect and the solution is rapidly attracted to the class of ``2.5 dimensional'' streamwise-independent solutions referred to as streaks.
Publisher: American Mathematical Soc.
ISBN: 1470442175
Category : Mathematics
Languages : en
Pages : 170
Book Description
The authors study small disturbances to the periodic, plane Couette flow in the 3D incompressible Navier-Stokes equations at high Reynolds number Re. They prove that for sufficiently regular initial data of size $epsilon leq c_0mathbf {Re}^-1$ for some universal $c_0 > 0$, the solution is global, remains within $O(c_0)$ of the Couette flow in $L^2$, and returns to the Couette flow as $t rightarrow infty $. For times $t gtrsim mathbf {Re}^1/3$, the streamwise dependence is damped by a mixing-enhanced dissipation effect and the solution is rapidly attracted to the class of ``2.5 dimensional'' streamwise-independent solutions referred to as streaks.
Traffic Distributions and Independence: Permutation Invariant Random Matrices and the Three Notions of Independence
Author: Camille Male
Publisher: American Mathematical Society
ISBN: 1470442981
Category : Mathematics
Languages : en
Pages : 100
Book Description
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by permutation matrices. This fact leads naturally to an extension of free probability, formalized under the notions of traffic probability. The author first establishes this construction for random matrices and then defines the traffic distribution of random matrices, which is richer than the $^*$-distribution of free probability. The knowledge of the individual traffic distributions of independent permutation invariant families of matrices is sufficient to compute the limiting distribution of the join family. Under a factorization assumption, the author calls traffic independence the asymptotic rule that plays the role of independence with respect to traffic distributions. Wigner matrices, Haar unitary matrices and uniform permutation matrices converge in traffic distributions, a fact which yields new results on the limiting $^*$-distributions of several matrices the author can construct from them. Then the author defines the abstract traffic spaces as non commutative probability spaces with more structure. She proves that at an algebraic level, traffic independence in some sense unifies the three canonical notions of tensor, free and Boolean independence. A central limiting theorem is stated in this context, interpolating between the tensor, free and Boolean central limit theorems.
Publisher: American Mathematical Society
ISBN: 1470442981
Category : Mathematics
Languages : en
Pages : 100
Book Description
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by permutation matrices. This fact leads naturally to an extension of free probability, formalized under the notions of traffic probability. The author first establishes this construction for random matrices and then defines the traffic distribution of random matrices, which is richer than the $^*$-distribution of free probability. The knowledge of the individual traffic distributions of independent permutation invariant families of matrices is sufficient to compute the limiting distribution of the join family. Under a factorization assumption, the author calls traffic independence the asymptotic rule that plays the role of independence with respect to traffic distributions. Wigner matrices, Haar unitary matrices and uniform permutation matrices converge in traffic distributions, a fact which yields new results on the limiting $^*$-distributions of several matrices the author can construct from them. Then the author defines the abstract traffic spaces as non commutative probability spaces with more structure. She proves that at an algebraic level, traffic independence in some sense unifies the three canonical notions of tensor, free and Boolean independence. A central limiting theorem is stated in this context, interpolating between the tensor, free and Boolean central limit theorems.