English
Related papers

Related papers: On cogrowth function of algebras and its logarithm…

200 papers

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

Group Theory · Mathematics 2010-12-13 Sang-hyun Kim , Henry Wilton

We characterize the Archimedean lattice-ordered algebras with identity that admit a polynomial growth continuous function calculus. More precisely, for an $n$-tuple $\mathbf{x}=(x_1,\dots,x_n)$ in an Archimedean lattice-ordered algebra $X$…

Functional Analysis · Mathematics 2026-04-23 David Muñoz-Lahoz

The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…

Combinatorics · Mathematics 2025-04-10 Jasem Hamoud , Duaa Abdullah

Let $G$ be a finitely generated group with polynomial growth, and let $\om$ be a weight, i.e. a sub-multiplicative function on $G$ with positive values. We study when the weighted group algebra $\ell^1(G,\om)$ is isomorphic to an operator…

Functional Analysis · Mathematics 2013-04-05 Hun Hee Lee , Ebrahim Samei , Nico Spronk

We study some properties of the growth rate of $\mathcal{L}(\mathcal{A},\mathcal{F})$, that is, the language of words over the alphabet $\mathcal{A}$ avoiding the set of forbidden factors $\mathcal{F}$. We first provide a sufficient…

Combinatorics · Mathematics 2025-04-09 Vuong Bui , Matthieu Rosenfeld

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

Combinatorics · Mathematics 2007-05-23 Irina Gheorghiciuc

Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence…

Computational Complexity · Computer Science 2015-07-01 Emil Kiss , Matthew Valeriote

We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…

Rings and Algebras · Mathematics 2016-02-04 Yolanda Cabrera Casado , Mercedes Siles Molina , M. Victoria Velasco

In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…

alg-geom · Mathematics 2008-02-03 Atsushi Moriwaki

In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our…

Formal Languages and Automata Theory · Computer Science 2016-02-11 Michel Rigo

We observe that the vocabulary used to construct the "answer" to problems in computer algebra can have a dramatic effect on the computational complexity of solving that problem. We recall a formalization of this observation and explain the…

Symbolic Computation · Computer Science 2010-02-02 Jacques Carette , James H. Davenport

An A-infinity algebra is given by a codifferential on the tensor coalgebra of a (graded) vector space. An associative algebra is a special case of an A-infinity algebra, determined by a quadratic codifferential. The notions of Hochschild…

Quantum Algebra · Mathematics 2007-05-23 Michael Penkava

This article presents a combinatorial result on indexed languages which was inspired by an attempt to understand the structure of groups with indexed language word problem. We show that a sufficiently long word in an indexed language can be…

Group Theory · Mathematics 2009-09-25 Robert Gilman

We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…

Combinatorics · Mathematics 2009-07-28 Fabien Durand , Michel Rigo

Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…

Rings and Algebras · Mathematics 2026-02-03 Wesley Quaresma Cota

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

In this article we investigate the L^1-norm of certain functions on groups called divisibility functions. Using these functions, their connection to residual finiteness, and integration theory on profinite groups, we define the residual…

Group Theory · Mathematics 2012-11-21 K. Bou-Rabee , D. B. McReynolds

The theory of algebras with polynomial identities has developed significantly, with special attention devoted to the classification of varieties according to the asymptotic behavior of their codimension sequences. This sequence is a…

Rings and Algebras · Mathematics 2026-01-26 Wesley Quaresma Cota , Luiz Henrique de Souza Matos , Ana Cristina Vieira

Let $\mathbb{A}_n^m$ be an arbitrary $n$-dimensional commutative associative algebra over the field of complex numbers with $m$ idempotents. Let $e_1=1,e_2,\ldots,e_k$ with $2\leq k\leq 2n$ be elements of $\mathbb{A}_n^m$ which are linearly…

Complex Variables · Mathematics 2015-03-25 V. S. Shpakivskyi

Amortized analysis is a cost analysis technique for data structures in which cost is studied in aggregate: rather than considering the maximum cost of a single operation, one bounds the total cost encountered throughout a session.…

Programming Languages · Computer Science 2024-12-18 Harrison Grodin , Robert Harper
‹ Prev 1 4 5 6 7 8 10 Next ›