English
Related papers

Related papers: Low growth equational complexity

200 papers

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

Rings and Algebras · Mathematics 2014-04-01 Erhard Aichinger , Peter Mayr

Suppose $G$ is a finite group and $A\subseteq G$ is such that $\{gA:g\in G\}$ has VC-dimension strictly less than $k$. We find algebraically well-structured sets in $G$ which, up to a chosen $\epsilon>0$, describe the structure of $A$ and…

Combinatorics · Mathematics 2022-03-04 G. Conant , A. Pillay , C. Terry

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

K-Theory and Homology · Mathematics 2017-05-24 Süleyman Kağan Samurkaş

In this work, we study the existence and regularity results of anisotropic elliptic equations with a singular lower order term that grows naturally with respect to the gradient and unbounded coefficients. We take up the following model…

Analysis of PDEs · Mathematics 2025-12-10 Fessel Achhoud , Hichem Khelifi

We study sunflowers within the context of finitely generated substructures of ultrahomogeneous structures. In particular, we look at bounds on how large a set system is needed to guarantee the existence of sunflowers of a given size. We…

Combinatorics · Mathematics 2023-10-25 Nathanael Ackerman , Mostafa Mirabi

In this paper, we obtain that the logarithmic Sobolev and $\mathcal{W}$-functionals admit remarkable power series expansions when appropriate test functions are selected. Using these expansions formulas, we prove that for an open subset $V$…

Differential Geometry · Mathematics 2025-05-21 Liang Cheng

Let $G$ be an acylindrically hyperbolic group on a $\delta$-hyperbolic space $X$. Assume there exists $M$ such that for any finite generating set $S$ of $G$, the set $S^M$ contains a hyperbolic element on $X$. Suppose that $G$ is…

Group Theory · Mathematics 2023-06-12 Koji Fujiwara

We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…

Rings and Algebras · Mathematics 2017-03-28 Adel Alahmadi , Hamed Alsulami , S. K. Jain , Efim Zelmanov

Let $X$ be a complex smooth quasi-projective variety with a fixed epimorphism $\nu\colon\pi_1(X)\twoheadrightarrow H$, where $H$ is a finitely generated abelian group with $\mathrm{rank}H\geq 1$. In this paper, we study the asymptotic…

Algebraic Geometry · Mathematics 2023-11-21 Fenglin Li , Yongqiang Liu

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

Group Theory · Mathematics 2023-10-03 Geoffrey R. Robinson

A variety of associative algebras over a field of characteristic 0 is called minimal if its codimension sequence grows much faster than the codimension sequence of any of its proper subvarieties. By the results of Giambruno and Zaicev it…

Rings and Algebras · Mathematics 2020-04-21 Vesselin Drensky

Prototypical rational vertex operator algebras are associated to affine Lie algebras at positive integer level k. They correspond physically to the Wess-Zumino-Witten theories, and their representation theory can be captured by quantum…

Quantum Algebra · Mathematics 2025-11-04 Terry Gannon

In this paper, the semilinear elliptic systems with Dirichlet boundary value are considered \begin{align} \left\{\begin{array}{ll} -\Delta v=f(u) & \mathrm{in}\ \Omega, -\Delta u=g(v) & \mathrm{in}\ \Omega, u=0, \ v=0 & \mathrm{on}\…

Analysis of PDEs · Mathematics 2013-07-30 Fei Fang

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

Group Theory · Mathematics 2017-02-07 Gideon Amir , Gady Kozma

We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…

Exactly Solvable and Integrable Systems · Physics 2017-03-06 John A. G. Roberts , Dinh T. Tran

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

Group Theory · Mathematics 2011-04-11 László Pyber , Endre Szabó

For a finite group $G$, we associate the quantity $\beta(G)=\frac{|L(G)|}{|G|}$, where $L(G)$ is the subgroup lattice of $G$. Different properties and problems related to this ratio are studied throughout the paper. We determine the second…

Group Theory · Mathematics 2019-01-23 Mihai-Silviu Lazorec

We construct an increasing, submultiplicative, arbitrarily rapid function which is not equivalent to the growth function of any finitely generated algebra, demonstrating the difficulty in characterizing growth functions in an asymptotic…

Rings and Algebras · Mathematics 2020-05-06 Be'eri Greenfeld

In previous work, the authors established various bounds for the dimensions of degree $n$ cohomology and $\Ext$-groups, for irreducible modules of semisimple algebraic groups $G$ (in positive characteristic $p$) and (Lusztig) quantum groups…

Representation Theory · Mathematics 2010-08-16 Brian Parshall , Leonard Scott

We show that the unrestricted black-box complexity of the $n$-dimensional XOR- and permutation-invariant LeadingOnes function class is $O(n \log (n) / \log \log n)$. This shows that the recent natural looking $O(n\log n)$ bound is not…

Data Structures and Algorithms · Computer Science 2012-10-25 Benjamin Doerr , Carola Winzen
‹ Prev 1 3 4 5 6 7 10 Next ›