Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

17345168 · Oct 201919922001200920172026
48 results for word growth

Abstract Coxeter groups have growth rates that are Perron numbers.

problem Understanding growth rates of Coxeter groups.
method Defined a class of Coxeter groups, \infty--spanned, and analyzed their growth rates.
result For \infty--spanned Coxeter groups, geodesic growth rate strictly dominates word growth rate and appears to be a Perron number.

Estimates growth of reciprocal classes in Hecke groups.

problem Estimating the growth of reciprocal conjugacy classes in Hecke groups.
method Using free product structure and word lengths of reciprocal elements, with tools from basic probability theory.
result Estimates the asymptotic growth of reciprocal conjugacy classes in Hecke groups.

Lehmer's question is equivalent to one about generalized growth rates of Lefschetz numbers of iterated pseudo-Anosov surface homeomorphisms. One need consider only homeomorphisms that arise as monodromies of fibered knots in lens spaces L(n,1), n>0. Lehmer's question for Perron polynomials is equivalent to one about ge…

2005-09-03abs ↗pdf ↗

Let ΣΣ be a surface of negative Euler characteristic and SS a generating set for π1(Σ,p)π_1(Σ,p) consisting of simple loops that are pairwise disjoint (except at pp). We show that the word length with respect to SS of an element of π1(Σ,p)π_1(Σ,p) is given by its intersection number with a well-chosen collection of curves an…

2016-08-26abs ↗pdf ↗

Let GG be a finitely generated group with a finite generating set SS. For gGg\in G, let lS(g)l_S(g) be the length of the shortest word over SS representing gg. The growth series of GG with respect to SS is the series A(t)=n=0antnA(t) = \sum_{n=0}^\infty a_n t^n, where ana_n is the number of elements of GG with lS(g)=nl_S(g)=n. If…

2014-01-15abs ↗pdf ↗

Extends growth properties of hyperbolic groups to their extensions.

problem Quantifying subgroup alternatives in group laws.
method Develops a framework for preserving exponential growth in extensions of hyperbolic groups.
result Automorphism groups of certain hyperbolic and Artin groups have locally uniform exponential growth.

The paper finds formulas for word lengths and conjugacy classes in surface groups.

problem Finding formulas for word lengths and conjugacy classes in surface groups.
method Investigating symmetric presentations and normal forms of conjugacy classes.
result Derives three formulae for word lengths and provides efficient algorithms for conjugacy problems.

The study examines the growth of reciprocal classes in Hecke groups, proving an asymptotic formula.

problem Analyzing the growth of reciprocal classes in Hecke groups.
method Utilizes the free product structure of Hecke groups, combinatorial counting, and recurrence relations.
result Proves an asymptotic formula for the number of reciprocal classes in Hecke groups.

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is strongly connected. Moreover, we show that the latter property is satisfied for all irr…

2014-03-11abs ↗pdf ↗

The study examines complete Kähler manifolds with nonnegative Ricci curvature and discovers rigidity properties.

problem Characterizing and understanding properties of complete Kähler manifolds with nonnegative Ricci curvature.
method Analyzes volume growth, scalar curvature, and curvature decay to establish rigidity results.
result Complete Ricci flat Kähler manifolds with Euclidean volume growth are rigid, with unique tangent cones.

The study calculates the growth rate of reciprocal hyperbolic elements in Hecke groups.

problem Counting reciprocal hyperbolic elements in Hecke groups.
method Analyzes conjugacy classes of hyperbolic elements associated with reciprocal geodesics.
result Determines the asymptotic growth rate and limiting constant of primitive conjugacy classes of reciprocal hyperbolic elements.

We introduce and systematically study the concept of a growth tight action. This generalizes growth tightness for word metrics as initiated by Grigorchuk and de la Harpe. Given a finitely generated, non-elementary group GG acting on a GG--space X\mathcal{X}, we prove that if GG contains a strongly contracting eleme…

2014-01-02abs ↗pdf ↗

Study inert and ambiguous classes in modular group using combinatorial methods.

problem Counting inert and ambiguous conjugacy classes in modular group.
method Purely combinatorial approach using word length in free product representation.
result Exact counting formulas and asymptotic growth rates for inert and ambiguous classes.

Study on quantitative aspects of trace polynomials in free groups.

problem Understanding the exact formula and bounds for trace polynomials in free groups.
method Proved exact formula for leading homogeneous part, obtained sharp bounds, studied random words, and provided deterministic algorithm.
result Sharp bounds on the degree of trace polynomials and growth rates of polynomial sizes.

We study a coarse homology theory with prescribed growth conditions. For a finitely generated group G with the word length metric this homology theory turns out to be related to amenability of G. We characterize vanishing of a certain fundamental class in our homology in terms of an isoperimetric inequality on G and sh…

2008-09-19abs ↗pdf ↗

For the free group FrF_r on r>1r>1 generators (respectively, the free product G1G2G_1 * G_2 of two nontrivial finite groups G1G_1 and G2G_2), we obtain the asymptotic for the number of conjugacy classes of commutators in FrF_r (respectively, G1G2G_1 * G_2) with a given word length in a fixed set of free generators (respecti…

2018-02-26abs ↗pdf ↗

Let ΓΓ be the fundamental group of a manifold modeled on three dimensional Sol geometry. We prove that ΓΓ has a finite index subgroup GG which has a rational growth series with respect to a natural generating set. We do this by enumerating GG by a regular language. However, in contrast to most earlier proofs of thi…

2005-04-06abs ↗pdf ↗

Let ΓΓ be a finitely generated discrete group satisfying the rapid decay condition. We give a new proof of the higher Atiyah-Patodi-Singer theorem on a Galois ΓΓ-coverings, thus providing an explicit formula for the higher index associated to a group cocycle cZk(Γ;C)c\in Z^k (Γ;\mathbb{C}) which is of polynomial growth wit…

2014-10-24abs ↗pdf ↗

We show that an Anosov map has a geodesic axis on the curve graph of a torus. The direct corollary of our result is the stable translation length of an Anosov map on the curve graph is always a positive integer. As the proof is constructive, we also provide an algorithm to calculate the exact translation length for any…

2019-08-01abs ↗pdf ↗

We establish the existence, finiteness, and uniqueness up to scaling of various isoperimetric profiles of a group, in all dimensions. We also show that these profiles all coincide in dimensions 4 and higher; in particular, the nth Dehn function is equal to FV^{n+1} for n at least 3. Even for dimension 3, there is signi…

2009-01-15abs ↗pdf ↗

We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if GG is a virtually compact special hyperbolic group, and QGQ\leq G is a KK-quasiconvex subgroup, then any gGQg\in G-Q of word-length at most nn is separated from QQ by a subg…

2015-01-28abs ↗pdf ↗

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include nilpotent groups, many relatively hyperbolic groups including geometrically…

2007-06-20abs ↗pdf ↗

Study growth patterns in random networks using i.i.d. perturbations.

problem Understanding the growth of affine regions in random piecewise-linear networks.
method Analyzes a random compositional model with i.i.d. perturbations of the tent map, proving submultiplicative pressure and using finite-state defect process for upper-tail lower bounds.
result Proves the existence of a submultiplicative pressure for \(N_n\) and gives exponential upper bounds for \(n^{-1}\log N_n\).

Paper benchmarks Bengali language classification tasks using MConv-LSTM network.

problem Lack of computational resources for NLP tasks in under-resourced languages like Bengali.
method Built three datasets, BengFastText word embeddings, and MConv-LSTM network for hate speech detection, document classification, and sentiment analysis.
result BengFastText yields up to 92.30%, 82.25%, and 90.45% F1-scores in document classification, sentiment analysis, and hate speech detection respectively.

Study of Bowditch representations in hyperbolic spaces with implications for dynamics and recognition.

problem Characterizing and understanding representations of free groups into hyperbolic spaces.
method Generalization of Bowditch conditions, explicit constant KδK_δ for hyperbolicity, characterizations of representations.
result Linear growth of lengths for primitive elements in Bowditch representations, new characterization of primitive-stable representations.

Let GG be a finite group with symmetric generating set SS, and let c=maxR>0B(2R)/B(R)c = \max_{R > 0} |B(2R)|/|B(R)| be the doubling constant of the corresponding Cayley graph, where B(R)B(R) denotes an RR-ball in the word-metric with respect to SS. We show that the multiplicity of the kkth eigenvalue of the Laplacian on the Cayley…

2008-06-10abs ↗pdf ↗

Separable Non-negative Matrix Factorization (SNMF) is an important method for topic modeling, where "separable" assumes every topic contains at least one anchor word, defined as a word that has non-zero probability only on that topic. SNMF focuses on the word co-occurrence patterns to reveal topics by two steps: anchor…

2019-05-10abs ↗pdf ↗

Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…

2016-11-29abs ↗pdf ↗

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…

2007-01-20abs ↗pdf ↗

We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads us to a notion of homotopy for words. We introduce several homotopy invariants …

2006-09-19abs ↗pdf ↗

Continuous word representation (aka word embedding) is a basic building block in many neural network-based models used in natural language processing tasks. Although it is widely accepted that words with similar semantics should be close to each other in the embedding space, we find that word embeddings learned in seve…

2018-09-18abs ↗pdf ↗

The abstract explains how word and relation representations capture semantic meaning.

problem Understanding how word and relation representations capture semantic meaning.
method Theoretical justification and extension of geometric relationships between word embeddings and knowledge graph representations.
result The geometric relationships between word embeddings correspond to semantic relations between words and entities in knowledge graphs.