English
Related papers

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

200 papers

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

Representation Theory · Mathematics 2018-10-08 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

Logic · Mathematics 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

We find conditions which ensure that the topological complexity of a closed manifold $M$ with abelian fundamental group is nonmaximal, and see through examples that our conditions are sharp. This generalizes results of Costa and Farber on…

Algebraic Topology · Mathematics 2021-09-10 Daniel C. Cohen , Lucile Vandembroucq

We study the Brauer group of an abelian variety A over an algebraically closed field of characteristic p focusing on the p-primary torsion, the key part of which is a certain quasi-algebraic unipotent group U_A. We determine its dimension…

Algebraic Geometry · Mathematics 2025-11-25 Livia Grammatica , Alexei N. Skorobogatov , Yuan Yang

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Group Theory · Mathematics 2024-09-18 Antonio Beltrán , Changguo Shao

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

Combinatorics · Mathematics 2017-02-06 Will Sawin

We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complexity and show that it only preserves…

Logic · Mathematics 2026-02-11 David Gonzalez , Dino Rossegger

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

For an abelian variety $A$ over a number field we study bounds depending only on the dimension of $A$ for the minimal degree $d(A)$ of a field extension over which $A$ acquires semi-stable reduction. We first compute $d(A)$ in terms of the…

Number Theory · Mathematics 2021-07-30 Séverin Philip

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

Optimization and Control · Mathematics 2022-02-10 Nikita Doikov

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Combinatorics · Mathematics 2025-12-18 Carl Schildkraut

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

Group Theory · Mathematics 2017-11-15 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

Let A be a complex abelian variety and G its Mumford--Tate group. Supposing that the simple abelian subvarieties of A are pairwise non-isogenous, we find a lower bound for the rank of G, which is a little less than log_2 dim A. If we…

Algebraic Geometry · Mathematics 2016-04-26 Martin Orr

We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…

Group Theory · Mathematics 2023-12-19 Udvas Acharjee , M S Srinath

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

Quantum Physics · Physics 2007-05-23 Chris Lomont

Let $G$ be a finite $p$-group of order $p^n$. YA. G. Berkovich (Journal of Algebra {\bf 144}, 269-272 (1991)) proved that $G$ is elementary abelian $p$-group if and only if the order of its Schur multiplier, $M(G)$, is at the maximum case.…

Group Theory · Mathematics 2011-03-31 Behrooz Mashayekhy , Mahboobeh Alizadeh Sanati

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

Number Theory · Mathematics 2010-03-16 Reza Rezaeian Farashahi , Igor E. Shparlinski

Let $H$ be an abelian subgroup of a finite group $G$ and $\pi$ the set of prime divisors of $|H|$. We prove that $|H O_{\pi}(G)/ O_{\pi}(G)|$ is bounded above by the largest character degree of $G$. A similar result is obtained when $H$ is…

Group Theory · Mathematics 2019-05-28 Nguyen Ngoc Hung , Yong Yang

For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…

Logic · Mathematics 2024-06-05 David Gonzalez , Matthew Harrison-Trainor , Meng-Che "Turbo" Ho