Related papers: Scott Complexity of Reduced Abelian $p$-Groups

Let $G$ be a finite $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. In this article we classify non-abelian $p$-groups $G$ of…

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…

We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a…

We give a characterization of the finite groups having nilpotent or abelian Hall $\pi$-subgroups which can easily be verified from the character table.

We study abelian group objects in $\omega$-categories and discuss the well-known Dold-Kan correspondence from the perspective of $\omega$-categories as a model for strict $\infty$-categories. The first part of the paper is intended to…

We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…

A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and…

Given a $p$-group $G$ and a subgroup-closed class $\mathfrak{X}$, we associate with each $\mathfrak{X}$-subgroup $H$ certain quantities which count $\mathfrak{X}$-subgroups containing $H$ subject to further properties. We show in Theorem I…

Linckelmann showed in 2011 that a group algebra is separably equivalent to the group algebra of its Sylow p-subgroups. In this article we use this relationship, together with Mackey decomposition, to demonstrate that a group algebra of a…

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…

We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over…

Proving super-polynomial size lower bounds for syntactic multilinear Algebraic Branching Programs(smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in…

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Let $B(g,p)$ denote the number of isomorphism classes of $g$-dimensional abelian varieties over the finite field of size $p.$ Let $A(g,p)$ denote the number of isomorphism classes of principally polarized $g$ dimensional abelian varieties…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.