Additional Information
| Author(s) | Crivei, Septimiu, Olteanu, Gabriela |
|---|
GAP algorithms for finite abelian groups and applications
Septimiu Crivei ♦ Gabriela Olteanu
Full PDF
carpathian_2008_24_3_310_316We propose GAP algorithms which determine finite abelian groups or subgroups of them having certain properties of lattice-theoretic nature. We also show their usefulness for obtaining examples and some theoretical results.
Recently posted
-
Operational almost periodic alpha unpredictability
-
Finite-Time H∞ Control for Conformable Fractional-Order Nonlinear Systems with Time Delays
-
Gallai’s property for Archimedean tiling graphs on the torus
-
Two geometric constants of normed spaces related to new characterizations of inner product spaces
-
Weak and strong convergence of multi-inertial forward-backward-forward methods for solving monotone inclusions
-
Solving Certain Classes of Variational Inclusion Problems Using Linearized Splitting Algorithms with Applications
-
The Stinespring-Wittstock theory for variable exponential completely bounded maps
-
On Stability of Two New Generalized Set-Valued Functional Equations
-
The Solodov–Svaiter type proximal point algorithm on a complete geodesic space
-
Iterative criteria for oscillation of third-order linear delay dynamic equations