English
Related papers

Related papers: Subexponential estimations in Shirshov's height th…

200 papers

The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number $\varphi_R(n)$, possibly infinite, of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…

Combinatorics · Mathematics 2014-02-14 Maurice Pouzet , Nicolas M. Thiéry

Consider a finite dimensional Lie algebra L with an action of a finite group G over a field of characteristic 0. We prove the analog of Amitsur's conjecture on asymptotic behavior for codimensions of polynomial G-identities of L. As a…

Rings and Algebras · Mathematics 2013-03-11 Alexey Sergeevich Gordienko

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Representation Theory · Mathematics 2007-05-23 Aleksandrs Mihailovs

Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…

Representation Theory · Mathematics 2024-07-11 Andrei Gornitskii

We show that if $T$ is any of four semigroups of two elements that are not groups, there exists a finite dimensional associative $T$-graded algebra over a field of characteristic $0$ such that the codimensions of its graded polynomial…

Rings and Algebras · Mathematics 2017-01-23 Alexey Sergeevich Gordienko

A 2-step nilpotent Lie algebra n is said to be of type (p,q)if dim(n)=p+q and dim([n,n])=p. By considering a class of 2-step nilpotent Lie algebras naturally attached to graphs, we prove that there exist indecomposable, 2-step nilpotent Lie…

Differential Geometry · Mathematics 2012-04-16 David Oscari

The asymptotic behaviour is studied of exponentially bounded sequences of codimensions of identities of algebras with unity. A series of algebras is constructed for which the base of the exponential increases by exactly one when an outer…

Rings and Algebras · Mathematics 2019-10-29 Mikhail V. Zaicev , Dušan D. Repovš

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…

Group Theory · Mathematics 2022-02-01 Andrea Lucchini

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…

Operator Algebras · Mathematics 2015-05-15 Caleb Eckhardt , Paul McKenney

Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position. Improvements by Ilie to…

Formal Languages and Automata Theory · Computer Science 2017-08-23 F. Blanchet-Sadri , S. Osborne

Let $P$ be a partially ordered set. The function $\mbox{La}^{\#}(n,P)$ denotes the size of the largest family $\mathcal{F}\subset 2^{[n]}$ that does not contain an induced copy of $P$. It was proved by Methuku and P\'alv\"olgyi that there…

Combinatorics · Mathematics 2017-08-28 István Tomon

For a finite group $G$ and a non-negative integer $d$, denote by $\Omega_d(G)$ the number of functions $G^d\rightarrow G$ that are induced by substitution into a word with variables among $X_1,\ldots,X_d$. In this note, we show that…

Group Theory · Mathematics 2017-04-27 Alexander Bors

In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional "forbidden" words along all cardinal…

Dynamical Systems · Mathematics 2013-03-27 Tom Meyerovitch , Ronnie Pavlov

We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. We find Toeplitz determinant representations for the exponential…

Combinatorics · Mathematics 2009-07-11 Craig A. Tracy , Harold Widom

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…

Formal Languages and Automata Theory · Computer Science 2015-02-26 James D. Currie , Narad Rampersad

We study polynomial identities of algebras with involution of nonassociative algebras over a field of characteristic zero. We prove that the growth of the sequence of $*$-codimensions of a finite-dimensional algebra is exponentially…

Rings and Algebras · Mathematics 2022-10-20 Dušan D. Repovš , Mikhail V. Zaicev

If X is the complement of a hypersurface in P^n, then Kohno showed that the nilpotent completion of the fundamental group is isomorphic to the nilpotent completion of the holonomy Lie algebra of X. When X is the complement of a hyperplane…

Algebraic Topology · Mathematics 2012-01-31 Paulo Lima-Filho , Hal Schenck

We explore finitely generated groups by studying the nilpotent towers and the various Lie algebras attached to such groups. Our main goal is to relate an isomorphism extension problem in the Postnikov tower to the existence of certain…

Algebraic Topology · Mathematics 2021-05-25 Richard D. Porter , Alexander I. Suciu

For an irreducible character $\chi$ of a finite group $G$, let $\mathrm{cod}(\chi):=|G: \ker(\chi)|/\chi(1)$ denote the codegree of $\chi$, and let $\mathrm{cod}(G)$ be the set of irreducible character codegrees of $G$. In this note, we…

Group Theory · Mathematics 2025-02-05 Guohua Qian , Yu Zeng

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

Logic in Computer Science · Computer Science 2025-04-08 Vera Koponen , Yasmin Tousinejad
‹ Prev 1 4 5 6 7 8 10 Next ›