相关论文: Low growth equational complexity

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

We investigate the function $d_\mathbf{A}(n)$, which gives the size of a least size generating set for $\mathbf{A}^n$, in the case where $\mathbf{A}$ has a cube term. We show that if $\mathbf{A}$ has a $k$-cube term and $\mathbf{A}^k$ is…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

We prove that every non-elementary hyperbolic group $G$ acts with maximal growth on some set $X$ such that every orbit of any element $g \in G$ is finite. As a side-product of our approach we prove that if $G$ is non-elementary hyperbolic,…

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.

Let $G$ be the symmetric group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

In this paper we prove a H\"older partial regularity result for weak solutions $u:\Omega\to \mathbb{R}^N$, $N\geq 2$, to non-autonomous elliptic systems with general growth of the type: \begin{equation*} -\rm{div}\, a(x, u, Du)= b(x, u, Du)…

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…

We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…

Given a real semisimple connected Lie group $G$ and a discrete subgroup $\Gamma < G$ we prove a precise connection between growth rates of the group $\Gamma$, polyhedral bounds on the joint spectrum of the ring of invariant differential…

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…

We introduce the bounded packing property for a subgroup of a countable discrete group G. This property gives a finite upper bound on the number of left cosets of the subgroup that are pairwise close in G. We establish basic properties of…

We realize any submultiplicative increasing function which is equivalent to a polynomial proportion of itself as the growth function of a finitely generated simple Lie algebra. As an application, we resolve two open problems posed by…

Let $L$ be a finite dimensional Lie $F$-algebra endowed with a generalized action by an associative algebra $H$. We investigate the exponential growth rate of the sequence of $H$-graded codimensions $c_n^H(L)$ of $L$ which is a measure for…

We study a Faulty Congested Clique model, in which an adversary may fail nodes in the network throughout the computation. We show that any task of $O(n\log{n})$-bit input per node can be solved in roughly $n$ rounds, where $n$ is the size…

Let $\Gamma$ be a group and $r_n(\Gamma)$ the number of its $n$-dimensional irreducible complex representations. We define and study the associated representation zeta function $\calz_\Gamma(s) = \suml^\infty_{n=1} r_n(\Gamma)n^{-s}$. When…