Discovery Logo
Sign In
Search
Paper
Search Paper
R Discovery for Libraries Pricing Sign In
  • Home iconHome
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Literature Review iconLiterature Review NEW
  • Chat PDF iconChat PDF Star Left icon
  • Citation Generator iconCitation Generator
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link
  • Paperpal iconPaperpal
    External link
  • Mind the Graph iconMind the Graph
    External link
  • Journal Finder iconJournal Finder
    External link
Discovery Logo menuClose menu
  • Home iconHome
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Literature Review iconLiterature Review NEW
  • Chat PDF iconChat PDF Star Left icon
  • Citation Generator iconCitation Generator
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link
  • Paperpal iconPaperpal
    External link
  • Mind the Graph iconMind the Graph
    External link
  • Journal Finder iconJournal Finder
    External link
features
  • Audio Papers iconAudio Papers
  • Paper Translation iconPaper Translation
  • Chrome Extension iconChrome Extension
Content Type
  • Journal Articles iconJournal Articles
  • Conference Papers iconConference Papers
  • Preprints iconPreprints
  • Seminars by Cassyni iconSeminars by Cassyni
More
  • R Discovery for Libraries iconR Discovery for Libraries
  • Research Areas iconResearch Areas
  • Topics iconTopics
  • Resources iconResources

Related Topics

  • Finite Abelian Group
  • Finite Abelian Group
  • Elementary Abelian Group
  • Elementary Abelian Group
  • Free Abelian Group
  • Free Abelian Group
  • Finite Group
  • Finite Group
  • Non-abelian Group
  • Non-abelian Group
  • Torsion-free Groups
  • Torsion-free Groups
  • Algebraic Group
  • Algebraic Group
  • Abelian Subgroup
  • Abelian Subgroup
  • Nilpotent Groups
  • Nilpotent Groups
  • Cyclic Subgroup
  • Cyclic Subgroup

Articles published on Abelian group

Authors
Select Authors
Journals
Select Journals
Duration
Select Duration
13421 Search results
Sort by
Recency
  • New
  • Research Article
  • 10.1016/j.disc.2026.115060
A generalization of the Davenport constant over abelian groups
  • Jul 1, 2026
  • Discrete Mathematics
  • H Godinho + 2 more

A generalization of the Davenport constant over abelian groups

  • New
  • Research Article
  • 10.1016/j.disc.2026.115033
Magic squares on Abelian groups
  • Jul 1, 2026
  • Discrete Mathematics
  • Sylwia Cichacz + 1 more

Magic squares on Abelian groups

  • New
  • Research Article
  • 10.1021/acs.jctc.6c00057
Hamiltonian-Informed Point Group Symmetry-Respecting Ansätze for the Variational Quantum Eigensolver.
  • Jun 23, 2026
  • Journal of chemical theory and computation
  • Runhong He + 7 more

Point group symmetry has been exploited for designing compact ansätze in the Variational Quantum Eigensolver (VQE), thereby facilitating the computation of molecular energy levels on current Noisy Intermediate-Scale Quantum (NISQ) devices. However, the widely used Symmetry-reduced Unitary Coupled Cluster Singles and Doubles (SymUCCSD) is restricted to molecules with Abelian point groups and often yields deficient ansätze for non-Abelian molecular systems. In this paper, we propose Hamiltonian-informed UCCSD (HiUCCSD), a novel shallow ansatz engineered based on the intrinsic information encoded in the molecular Hamiltonian. We theoretically prove the effectiveness of HiUCCSD for molecules belonging to Abelian point groups. Furthermore, numerical results for 10 molecular systems with distinct symmetries demonstrate that HiUCCSD may also be applicable to non-Abelian point group systems. Compared with the standard UCCSD ansatz, HiUCCSD reduces the parameter count and circuit size of VQE by 18-83% and 26-83%, respectively, and shrinks the size of the excitation operator pool for Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT)-VQE by 27-84% across the studied molecules. Given its superior performance and broad applicability, we expect that HiUCCSD will facilitate the realization of large-scale molecular VQE implementations.

  • Research Article
  • 10.1021/acs.jpca.6c00998
Exploitation ofComplex Abelian Point Groups in Quantum-ChemicalCalculations
  • Jun 9, 2026
  • The Journal of Physical Chemistry. a
  • Marios-Petros Kitsaras + 1 more

Quantum-chemical calculations often make use of point-grouptheoryto exploit molecular symmetry, resulting in a reduction of the computationalcost and in insights into the electronic structure. This exploitationis often limited to subgroups of D2h that are Abelian with real characters. Here, we extend thesymmetry exploitation to Abelian point groups with complex characters.Such point groups are often encountered in calculations that involvefinite magnetic fields, though their occurrence is not limited tothese cases alone. We present the evaluation of integrals over symmetry-adaptedorbitals using the double-coset decomposition, as well as the useof these symmetries in the contractions needed within post-Hartree-Fockcalculations in the context of block tensors. Efficiency gains arediscussed for four simple hydrocarbons that exhibit a complex Abelianpoint group in the presence of a magnetic field.

  • Research Article
  • 10.1088/1751-8121/ae6ada
Braided quantum mechanics and Majorana qubits at third root of unity: a color Heisenberg-Lie (super)algebra framework
  • May 20, 2026
  • Journal of Physics A: Mathematical and Theoretical
  • Zhanna Kuznetsova + 1 more

Abstract We introduce color Heisenberg-Lie (super)algebras graded by the abelian groups Z 3 2 , Z 2 p × Z 3 2 for p = 1 , 2 , 3 , and investigate the properties of their associated multi-particle quantum paraoscillators. In the Rittenberg–Wyler’s color Lie (super)algebras framework the above abelian groups are the simplest ones which induce mixed brackets interpolating commutators and anticommutators. These mixed brackets allow to accommodate two types of parastatistics: one based on the permutation group (beyond bosons and fermions in any space dimension) and an anyonic parastatistics based on the braid group. In both such cases the two broad classes of paraparticles are given by parabosons and parafermions. Mixed-bracket parafermions are created by nilpotent operators; they satisfy a generalized Pauli exclusion principle leading to roots-of-unity truncations in their multi-particle energy spectrum (braided Majorana qubits and their Gentile-type parastatistics are recovered in this color Lie superalgebra setting). Mixed-bracket parabosons do not admit truncations of the spectrum; the minimal detectable signature of their parastatistics is encoded in the measurable probability density of two indistinguishable parabosonic oscillators in a given energy eigenstate.

  • Research Article
  • 10.1080/00927872.2026.2662985
Square-free and dual-square-free abelian groups
  • May 6, 2026
  • Communications in Algebra
  • Rafail Alizade + 2 more

In this paper, we study the structure of square-free (summand-square-free) modules, that is the modules that do not contain two nonzero isomorphic disjoint submodules (direct summands) and the modules that are dual to square-free modules over the ring of integers. The class of square-free abelian groups is completely characterized. We determine the structure of both summand-square-free and dual-square-free torsion and finitely generated abelian groups. An abelian group is summand-square-free if its torsion subgroup and the factor group by the torsion subgroup are summand-square-free. The rank of torsion-free dual-square-free groups does not exceed 2. Finally, we establish several results concerning dual-square-free and simply-distinct right modules and provide generalizations of some known results.

  • Research Article
  • 10.1080/00927872.2026.2658687
Generators and automorphisms of the congruence groups in the infinite rank case
  • May 6, 2026
  • Communications in Algebra
  • Vladimir A Tolstykh

Let A be an infinitely generated free abelian group. For every natural number m ⩾ 1 , we provide two generating sets for the congruence group Γ A ( m ) of level m of the group Γ = Aut ( A ) , and then use one of these generating sets to describe the automorphisms of the group Γ A ( m ) .

  • Research Article
  • 10.1145/3797909
The Ideal Membership Problem and Abelian Groups
  • May 4, 2026
  • ACM Transactions on Computation Theory
  • Andrei Bulatov + 1 more

Given polynomials f 0 , f 1 , …, f k the Ideal Membership Problem, IMP for short, asks if f 0 belongs to the ideal generated by f 1 , …, f k . In the search version of this problem, the task is to find a proof of this fact. The IMP is a well-known fundamental problem with numerous applications. For instance, it underlies many proof systems based on polynomials such as Nullstellensatz, Polynomial Calculus, and Sum-of-Squares. Although the IMP is in general intractable, in many important cases it can be efficiently solved. Mastrolilli [SODA’19] initiated a systematic study of IMPs for ideals arising from Constraint Satisfaction Problems (CSPs), parameterized by constraint languages, denoted IMP(Γ). The ultimate goal of this line of research is to classify all such IMPs accordingly to their complexity. Mastrolilli achieved this goal for IMPs arising from CSP(Γ) where Γ is a Boolean constraint language, while Bulatov and Rafiey [STOC’22] advanced these results to several cases of CSPs over finite domains. In this article, we consider IMPs arising from CSPs over “affine” constraint languages, in which constraints are subgroups (or their cosets) of direct products of Abelian groups. This kind of CSPs include systems of linear equations and are considered one of the most important types of tractable CSPs. Some special cases of the problem have been considered before by Bharathi and Mastrolilli [MFCS’21] for linear equations modulo 2, and by Bulatov and Rafiey [STOC’22] for systems of linear equations over GF ( p ), p prime. Here, we prove that if Γ is an affine constraint language then IMP(Γ) is solvable in polynomial time assuming the input polynomial has bounded degree.

  • Research Article
  • 10.1016/j.acha.2026.101877
Separating polynomial invariants over non-closed fields of finite abelian groups
  • May 1, 2026
  • Applied and Computational Harmonic Analysis
  • Mátyás Domokos

Separating polynomial invariants over non-closed fields of finite abelian groups

  • Research Article
  • 10.1016/j.jalgebra.2026.01.031
Orientable quadratic equations in wreath products of abelian groups
  • May 1, 2026
  • Journal of Algebra
  • Alexander Ushakov + 1 more

Orientable quadratic equations in wreath products of abelian groups

  • Research Article
  • 10.1080/00927872.2026.2644621
On separating sets of polynomial invariants of finite abelian group actions
  • Apr 27, 2026
  • Communications in Algebra
  • Barna Schefler + 2 more

Let G be a finite group acting on a finite dimensional complex vector space V via linear transformations. Let C [ V ] G be the algebra of polynomials that are invariant under the induced G-action on the polynomial ring C [ V ] . A subset S ⊆ C [ V ] G is a separating set if it separates the orbits of the group action. If G is abelian, then there exist finite separating sets consisting of monomials. In this paper we investigate properties of separating sets from three different points of view, including the minimal size of separating sets consisting of monomials, the exact value of the separating Noether number β sep ( G ) of abelian groups of rank 4, and an inverse problem of β sep ( G ) for abelian groups of rank 2.

  • Research Article
  • 10.1142/s0219265926500088
Domination in the Negation of Cayley Signed Graphs
  • Apr 24, 2026
  • Journal of Interconnection Networks
  • Amit Kumar + 2 more

In this paper, the authors study the concept of domination in the negation of Cayley signed graphs over finite abelian groups. They establish sharp bounds for the domination numbers and characterize the groups that attain these bounds. The study reveals that, for certain Cayley sets, the sum of the domination numbers of a Cayley signed graph and its negation exceeds the group’s order. The results are illustrated with several examples.

  • Research Article
  • 10.1515/jgth-2025-0153
Strongly not divisible Abelian groups
  • Apr 22, 2026
  • Journal of Group Theory
  • Grigore Călugăreanu + 1 more

Abstract An Abelian group 𝐺 is called strongly not divisible if n ⁢ G ≠ G nG\neq G for every integer n ≠ ± 1 n\neq\pm 1 . In J. A. Lewallen and N. Sagullo, A note on OI torsion abelian groups, Missouri J. Math. Sci. 27 (2015), 1, 33–36, a characterization of the torsion strongly not divisible groups (referred to there as OI-groups) was obtained. In this note, we provide characterizations for broad classes of torsion-free and mixed strongly not divisible groups.

  • Research Article
  • 10.1017/s0004972726101166
SLENDER SEMIGROUPS
  • Apr 21, 2026
  • Bulletin of the Australian Mathematical Society
  • Attila Nagy

Abstract We define the concept of slenderness for arbitrary semigroups containing at least one idempotent element, and give necessary and sufficient conditions for semigroups to be slender. We describe the semigroup of all homomorphisms of the direct product of a nonempty family of groups into a slender rectangular abelian group.

  • Research Article
  • 10.1007/s11005-026-02076-6
Quantum error correction in Kitaev’s quantum double model for Abelian groups
  • Apr 20, 2026
  • Letters in Mathematical Physics
  • Shawn X Cui + 2 more

Quantum error correction in Kitaev’s quantum double model for Abelian groups

  • Research Article
  • 10.1007/s11128-026-05165-6
Quantum algorithms for Gowers norm estimation, polynomial testing, and arithmetic progression counting over finite abelian groups
  • Apr 13, 2026
  • Quantum Information Processing
  • En-Jui Kuo

Abstract We propose a family of quantum algorithms for estimating Gowers uniformity norms $$ U^k $$ U k over finite abelian groups, extending earlier quantum methods for the $$ U^2 $$ U 2 -norm to arbitrary prime fields and higher-order uniformity norms. Our algorithms prepare quantum states encoding higher-order finite differences and apply Fourier sampling together with amplitude estimation to obtain estimates of Gowers norms. As a central application, we study algebraic property testing problems of distinguishing whether a bounded function $$ f: \mathbb {F}_p^n \rightarrow \mathbb {C} $$ f : F p n → C is a low-degree phase polynomial or is far from any such structure. We show that whenever an inverse theorem for the $$ U^{d+1} $$ U d + 1 -norm is available, our quantum framework yields a corresponding structure-testing algorithm whose query and measurement complexity depends explicitly on the quantitative bounds of that inverse theorem. In particular, using the recent quasipolynomial inverse theorem for the $$ U^4 $$ U 4 -norm over $$ \mathbb {F}_p^n $$ F p n , we obtain quasipolynomial-time quantum algorithms for detecting cubic phase polynomials. For higher-order norms such as $$ U^5 $$ U 5 and $$ U^6 $$ U 6 over $$ \mathbb {F}_2^n $$ F 2 n , the best known inverse theorems provide only tower-type quantitative bounds; accordingly, our detection algorithms remain correct but inherit complexity corresponding to tower-type quantitative bounds. We also present a quantum method for estimating the number of 3-term arithmetic progressions in Boolean functions via the $$ U^2 $$ U 2 -norm. Although not query-optimal compared to Grover-style counting, this approach is sensitive to additive structure and naturally aligned with tools from higher-order Fourier analysis. Finally, we observe that Gowers norms are invariant under certain classes of shift-type noise, implying that our algorithms retain robustness under natural quantum noise models. This suggests that Gowers norm-based quantum procedures may serve as stable primitives for quantum property testing, learning theory, and the analysis of pseudorandomness in the NISQ regime.

  • Research Article
  • 10.1007/s10623-026-01821-1
Perfect codes in Cayley graphs of abelian groups
  • Apr 1, 2026
  • Designs, Codes and Cryptography
  • Peter J Cameron + 2 more

Abstract A perfect code in a graph $$\Gamma = (V, E)$$ Γ = ( V , E ) is a subset C of V such that no two vertices in C are adjacent and every vertex in $$V \setminus C$$ V \ C is adjacent to exactly one vertex in C . A total perfect code in $$\Gamma $$ Γ is a subset C of V such that every vertex of $$\Gamma $$ Γ is adjacent to exactly one vertex in C . In this paper we prove several results on perfect codes and total perfect codes in Cayley graphs of finite abelian groups.

  • Research Article
  • 10.1142/s0218196726500244
Concrete self-similar representations of some subgroups of the Baer–Specker group
  • Mar 27, 2026
  • International Journal of Algebra and Computation
  • Alex C Dantas + 2 more

In this work we study the self-similarity of infinite products of the group of the integers. In [A. C. Dantas, T. M. G. Santos and S. N. Sidki, Self-similar abelian groups and their centralizers, Groups Geom. Dyn. 17 (2023) 1–23], the authors ask if there is a self-similar free abelian group of uncountable rank. On the other hand, in [L. Bartholdi and S. N. Sidki, Self-similar products of groups, Groups Geom. Dyn. 14(1) (2020) 107–115] is asked if the Baer–Specker group [Formula: see text] is self-similar (by a result of R. Baer, this group is not free abelian). We answer both questions positively.

  • Research Article
  • 10.1142/s0129167x26420012
The classification of Hermitian and hyper-Hermitian structures on Lie groups with one-dimensional commutator groups
  • Mar 27, 2026
  • International Journal of Mathematics
  • Hamid Reza Salimi Moghaddam

This paper classifies all left-invariant Hermitian and hyper-Hermitian structures on Lie groups whose commutator groups are one-dimensional. Furthermore, for each natural number n = 2k and n = 4k (k > 1 for the case of hyper-Hermitian structures), we construct an n-dimensional Lie group with a one-dimensional commutator group that possesses left-invariant Hermitian and hyper-Hermitian structures, respectively.

  • PDF Download Icon
  • Research Article
  • 10.1007/s00031-026-09959-x
Horospherical Varieties with Quotient Singularities
  • Mar 27, 2026
  • Transformation Groups
  • Sean Monahan

Our main result is a combinatorial characterization of when a horospherical variety has (at worst) quotient singularities. Using this characterization, we show that every quasiprojective horospherical variety with quotient singularities is globally the quotient of a smooth variety by a finite abelian group.

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • .
  • .
  • .
  • 10
  • 1
  • 2
  • 3
  • 4
  • 5

Popular topics

  • Latest Artificial Intelligence papers
  • Latest Nursing papers
  • Latest Psychology Research papers
  • Latest Sociology Research papers
  • Latest Business Research papers
  • Latest Marketing Research papers
  • Latest Social Research papers
  • Latest Education Research papers
  • Latest Accounting Research papers
  • Latest Mental Health papers
  • Latest Economics papers
  • Latest Education Research papers
  • Latest Climate Change Research papers
  • Latest Mathematics Research papers

Most cited papers

  • Most cited Artificial Intelligence papers
  • Most cited Nursing papers
  • Most cited Psychology Research papers
  • Most cited Sociology Research papers
  • Most cited Business Research papers
  • Most cited Marketing Research papers
  • Most cited Social Research papers
  • Most cited Education Research papers
  • Most cited Accounting Research papers
  • Most cited Mental Health papers
  • Most cited Economics papers
  • Most cited Education Research papers
  • Most cited Climate Change Research papers
  • Most cited Mathematics Research papers

Latest papers from journals

  • Scientific Reports latest papers
  • PLOS ONE latest papers
  • Journal of Clinical Oncology latest papers
  • Nature Communications latest papers
  • BMC Geriatrics latest papers
  • Science of The Total Environment latest papers
  • Medical Physics latest papers
  • Cureus latest papers
  • Cancer Research latest papers
  • Chemosphere latest papers
  • International Journal of Advanced Research in Science latest papers
  • Communication and Technology latest papers

Latest papers from institutions

  • Latest research from French National Centre for Scientific Research
  • Latest research from Chinese Academy of Sciences
  • Latest research from Harvard University
  • Latest research from University of Toronto
  • Latest research from University of Michigan
  • Latest research from University College London
  • Latest research from Stanford University
  • Latest research from The University of Tokyo
  • Latest research from Johns Hopkins University
  • Latest research from University of Washington
  • Latest research from University of Oxford
  • Latest research from University of Cambridge

Popular Collections

  • Research on Reduced Inequalities
  • Research on No Poverty
  • Research on Gender Equality
  • Research on Peace Justice & Strong Institutions
  • Research on Affordable & Clean Energy
  • Research on Quality Education
  • Research on Clean Water & Sanitation
  • Research on COVID-19
  • Research on Monkeypox
  • Research on Medical Specialties
  • Research on Climate Justice
Discovery logo
FacebookTwitterLinkedinInstagram

Download the FREE App

  • Play store Link
  • App store Link
  • Scan QR code to download FREE App

    Scan to download FREE App

  • Google PlayApp Store
FacebookTwitterTwitterInstagram
  • Universities & Institutions
  • Publishers
  • R Discovery PrimeNew
  • Ask R Discovery
  • Blog
  • Accessibility
  • Topics
  • Journals
  • Open Access Papers
  • Year-wise Publications
  • Recently published papers
  • Pre prints
  • Questions
  • FAQs
  • Contact us
Lead the way for us

Your insights are needed to transform us into a better research content provider for researchers.

Share your feedback here.

FacebookTwitterLinkedinInstagram
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.

Privacy PolicyCookies PolicyTerms of UseCareers