Results 61 to 70 of about 1,434,420 (325)

Nielsen realization for infinite-type surfaces

open access: yes, 2020
Given a finite subgroup G of the mapping class group of a surface S, the Nielsen realization problem asks whether G can be realized as a finite group of homeomorphisms of S.
Afton, Santana   +3 more
core  

On residuals of finite groups

open access: yesJournal of Group Theory, 2021
AbstractTheorem C in [S. Dolfi, M. Herzog, G. Kaplan and A. Lev, The size of the solvable residual in finite groups,Groups Geom. Dyn.1(2007), 4, 401–407] asserts that, in a finite group with trivial Fitting subgroup, the size of the soluble residual of the group is bounded from below by a certain power of the group order and that the inequality is ...
Aivazidis, Stefanos, Müller, Thomas
openaire   +3 more sources

On connected components and perfect codes of proper order graphs of finite groups [PDF]

open access: yesProceedings of the Estonian Academy of Sciences
Let G be a finite group with the identity element e. The proper order graph of G, denoted by ℒ* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj   +1 more source

A new result on factorization of finite groups

open access: yesNantong Daxue xuebao. Ziran kexue ban, 2023
Letτbe a subgroup functor.τis said regular if for all groups G,whenever H∈τ(G) is a p-subgroup and N is a minimal normal subgroup of G,then ︳G:HG(H∩N)︳ is a power of p.With the help of the notion and properties of regular subgroup functor,factorization ...
LI Baojun; WU Yan
doaj   +1 more source

X‐Ray Tomography Analysis of Damage Mechanisms in Metal Matrix Syntactic Foams During Compression

open access: yesAdvanced Engineering Materials, EarlyView.
In situ synchrotron X‐ray tomography is used to investigate the internal damage mechanisms of AlSi12 metal matrix syntactic foam with ceramic hollow spheres during compressive loading. It is concluded that a homogeneous distribution of the second‐phase filler material results in a sequential collapse in a localized region; this leads to controlled and ...
Indrajeet Tambe   +8 more
wiley   +1 more source

Residual Properties of Nilpotent Groups

open access: yesМоделирование и анализ информационных систем, 2015
Let π be a set of primes. Recall that a group G is said to be a residually finite π-group if for every nonidentity element a of G there exists a homomorphism of the group G onto some finite π-group such that the image of the element a differs from 1.
D. N. Azarov
doaj   +1 more source

Enabling Digital Continuity in Virtual Manufacturing for Eco‐Efficiency Assessment of Lightweight Structures by Means of a Domain‐Specific Structural Mechanics Language: Requirements, Idea and Proof of Concept

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents a solver‐agnostic domain‐specific language (DSL) for computational structural mechanics that strengthens interoperability in virtual product development. Using a hierarchical data model, the DSL enables seamless exchange between diverse simulation tools and numerical methods.
Martin Rädel   +3 more
wiley   +1 more source

Some Residual Properties of Finite Rank Groups

open access: yesМоделирование и анализ информационных систем, 2014
The generalization of one classical Seksenbaev theorem for polycyclic groups is obtained. Seksenbaev proved that if G is a polycyclic group which is residually finite p-group for infinitely many primes p, it is nilpotent. Recall that a group G is said to
D. N. Azarov
doaj   +1 more source

Recent Advancements in Bulk Processing of Rare‐Earth‐Free Hard Magnetic Materials and Related Multiscale Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley   +1 more source

Algorithmically finite groups

open access: yesJournal of Pure and Applied Algebra, 2011
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially ...
Myasnikov, Alexei, Osin, Denis
openaire   +2 more sources

Home - About - Disclaimer - Privacy