中文
相关论文

相关论文: Low growth equational complexity

200 篇论文

We study the conjugacy class growth function in finitely generated virtually abelian groups. That is, the number of elements in the ball of radius $n$ in the Cayley graph which intersect a fixed conjugacy class. In the class of virtually…

群论 · 数学 2025-02-26 Aram Dermenjian , Alex Evetts

We prove a multiplicity result for non-constant weak solutions $u \in H^1(\Omega)$ for the quasilinear elliptic equation \[ \begin{cases} \displaystyle-\text{div}(A(x,u)\nabla u) + \frac{1}{2} D_sA(x,u)\nabla u \cdot \nabla u = g(x,u) -…

偏微分方程分析 · 数学 2025-12-09 Annamaria Canino , Simone Mauro

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

群论 · 数学 2020-08-28 Nguyen Ngoc Hung , Thomas Michael Keller , Yong Yang

The results showing a quantum query complexity of $\Theta(N^{1/3})$ for the collision problem do not apply to random functions. The issues are two-fold. First, the $\Omega(N^{1/3})$ lower bound only applies when the range is no larger than…

计算复杂性 · 计算机科学 2013-12-12 Mark Zhandry

We investigate quantitative aspects of the LEF property for subgroups of the topological full group $[[ \sigma ]]$ of a two-sided minimal subshift over a finite alphabet, measured via the LEF growth function. We show that the LEF growth of…

群论 · 数学 2023-07-19 Henry Bradford , Daniele Dona

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…

泛函分析 · 数学 2013-04-05 Hun Hee Lee , Ebrahim Samei , Nico Spronk

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

逻辑 · 数学 2021-05-18 Manuel Bodirsky , Thomas Quinn-Gregson

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

逻辑 · 数学 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

In this paper we give a bound to the number of conjugacy classes of maximal subgroups of any almost simple group whose socle is a classical group of Lie type. The bound is $2n^{5.2}+n\log_2\log_2 q$, where $n$ is the dimension of the…

表示论 · 数学 2014-07-28 Jokke Häsä

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

形式语言与自动机理论 · 计算机科学 2017-03-16 Lukas Fleischer , Manfred Kufleitner

The Grigorchuk and Gupta-Sidki groups are natural examples of self-similar finitely generated periodic groups. The author constructed their analogue in case of restricted Lie algebras of characteristic 2, Shestakov and Zelmanov extended…

环与代数 · 数学 2020-04-27 Victor Petrogradsky

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

组合数学 · 数学 2026-03-10 Igor Dolinka , D. G. FitzGerald , James D. Mitchell

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

代数几何 · 数学 2010-07-30 Daniel Plaumann , Claus Scheiderer

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

计算复杂性 · 计算机科学 2018-04-17 Lukas Fleischer

We consider the quantum query complexity of local search as a function of graph geometry. Given a graph $G = (V,E)$ with $n$ vertices and black box access to a function $f : V \to \mathbb{R}$, the goal is find a vertex $v$ that is a local…

计算复杂性 · 计算机科学 2024-12-19 Simina Brânzei , Nicholas J. Recker

We propose a new approach to the study of (nonlinear) growth and instability for semilinear evolution equations with compact nonlinearities. We show, in particular, that compact nonlinear perturbations of a linear evolution equation can be…

偏微分方程分析 · 数学 2023-09-27 Vladimir Müller , Roland Schnaubelt , Yuri Tomilov

Given partitions $\alpha$, $\beta$, $\gamma$, the short exact sequences $0\to N_\alpha \to N_\beta \to N_\gamma \to 0$ of nilpotent linear operators of Jordan types $\alpha$, $\beta$, $\gamma$, respectively, define a constructible subset…

表示论 · 数学 2019-06-27 Justyna Kosakowska , Markus Schmidmeier

The paper is devoted to the study of finite dimensional complex evolution algebras. The class of evolution algebras isomorphic to evolution algebras with Jordan form matrices is described. For finite dimensional complex evolution algebras…

交换代数 · 数学 2018-05-01 L. M. Camacho , J. R. Gómez , B. A. Omirov , R. M. Turdibaev

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

代数拓扑 · 数学 2018-02-15 Saugata Basu , Cordian Riener

We prove an abstract result giving a $\langle t \rangle^\varepsilon$ upper bound on the growth of the Sobolev norms of a time-dependent Schr\"odinger equation of the form ${i} \dot \psi = H_0 \psi + V (t)\psi$. Here $H_0$ is assumed to be…

偏微分方程分析 · 数学 2024-12-20 Dario Bambusi , Beatrice Langella