English
Related papers

Related papers: Translation length formula for two-generated group…

200 papers

The paper has three parts. In the first part we apply the theory of commuting pairs of (pseudo) difference operators to the (formal) asymptotics of orthogonal polynomials: using purely geometrical arguments we show heuristically that the…

Mathematical Physics · Physics 2009-12-05 M. Bertola , M. Y. Mo

We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…

Group Theory · Mathematics 2021-09-24 Matthew Horak , Melanie Stein , Jennifer Taback

Using ideas from Jones, lattice gauge theory and loop quantum gravity, we construct 1+1-dimensional gauge theories on a spacetime cylinder. Given a separable compact group $G$, we construct localized time-zero fields on the spatial torus as…

Mathematical Physics · Physics 2020-01-08 Arnaud Brothier , Alexander Stottmeister

We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of…

High Energy Physics - Phenomenology · Physics 2019-11-22 Robert Runkel , Zoltán Szőr , Juan Pablo Vesga , Stefan Weinzierl

Let $K$ be a non-archimedean local field with residue field of characteristic $p$. We give necessary and sufficient conditions for a two-generator subgroup $G$ of ${\rm PSL_2}(K)$ to be discrete, where either $K=\mathbb{Q}_p$ or $G$…

Group Theory · Mathematics 2023-08-16 Matthew J. Conder , Jeroen Schillewaert

A group $G$ is said to be a {\it CSA}-group if all maximal abelian subgroups of $G$ are malnormal. The class of CSA groups is of interest because it contains torsion-free hyperbolic groups, groups acting freely on $\Lambda$-trees and groups…

Group Theory · Mathematics 2009-09-25 Dion Gildenhuys , Olga Kharlampovich , Alexey Myasnikov

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…

Logic in Computer Science · Computer Science 2019-03-21 Michele Basaldella

We study non-nesting actions on R-trees. We prove that some natural conditions describing how the group is generated, imply that such an action involves an isometric action on an R-tree. This can be applied to permutation groups, linear…

Group Theory · Mathematics 2011-12-07 A. Ivanov

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

Classical Analysis and ODEs · Mathematics 2008-09-16 Shahaf Nitzan-Hahamov , Alexander Olevskii

We say a subset $\Sigma \subseteq F_N$ of the free group of rank $N$ is \emph{spectrally rigid} if whenever $T_1, T_2 \in \cv_N$ are $\mathbb{R}$-trees in (unprojectivized) outer space for which $|\sigma|_{T_1} = |\sigma|_{T_2}$ for every…

Group Theory · Mathematics 2014-01-10 Brian Ray

Given an infinite set \Lambda of characters on a compact abelian group we show that \Lambda is a \Lambda(p)-set for all p>2 if and only if the limit order of the ideal of all \Lambda-summing operators coincides with that of the ideal of all…

Functional Analysis · Mathematics 2007-05-23 Carsten Michels

Latent tree learning(LTL) methods learn to parse sentences using only indirect supervision from a downstream task. Recent advances in latent tree learning have made it possible to recover moderately high quality tree structures by training…

Computation and Language · Computer Science 2019-09-24 Phu Mon Htut , Kyunghyun Cho , Samuel R. Bowman

In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…

Computational Geometry · Computer Science 2015-05-12 Abhishek Rathore

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Group Theory · Mathematics 2020-07-23 Nicolas Radu

In string theory it is known that abelian isometries in the sigma model lead to target space duality. We generalize this duality to backgrounds with non--abelian isometries. The procedure we follow consists of gauging the isometries of the…

High Energy Physics - Theory · Physics 2009-10-22 Xenia C. de la Ossa , Fernando Quevedo

An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…

Group Theory · Mathematics 2015-09-16 James East , Thomas E. Nordahl

We use freely acting asymmetric orbifolds of type IIB string theory to construct a class of theories in four dimensions with eight supercharges. Their low energy effective field theories resemble $STU$ models, but have different duality…

High Energy Physics - Theory · Physics 2025-06-16 George Gkountoumis , Chris Hull , Guo-En Nian , Stefan Vandoren

Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…

Group Theory · Mathematics 2018-04-17 Ihechukwu Chinyere

We present an algorithm which takes as input a finite set $X$ of automorphisms of a simplicial tree, and outputs a generating set $X'$ of $\langle X \rangle$ such that either $\langle X \rangle$ is purely hyperbolic and $X'$ is a free basis…

Group Theory · Mathematics 2023-09-01 Ari Markowitz

We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…

Programming Languages · Computer Science 2018-03-01 William Blum
‹ Prev 1 8 9 10 Next ›