Results 71 to 80 of about 6,757,466 (293)
Products of Finite Connected Subgroups
Mathematics, 2020 For a non-empty class of groups L, a finite group G=AB is said to be an L-connected product of the subgroups A and B if 〈a,b〉∈L for all a∈A and b∈B. In a previous paper, we prove that, for such a product, when L=S is the class of finite soluble groups ...
María Pilar Gállego +4 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.An explicit constitutive reconstruction framework enables accurate tensile characterization of miniaturized additively manufactured specimens using only the grip‐to‐grip displacement measurements. Progressive validation through self‐consistency, analytical comparison, and inverse finite element method (iFEM) benchmarking demonstrates constitutive ...
Junqing Leng +4 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz +4 more
wiley +1 more source
Minimal and random generation of permutation and matrix groups [PDF]
, 2012 We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases.
Derek F. Holt +5 more
core +1 more source
Advanced Engineering Materials, EarlyView.Gallium microalloying redirects interfacial reactions in low‐temperature Bi–Sn solders from Cu–Sn toward Cu–Ga intermetallic formation. The resulting Cu–Ga layer suppresses intermetallic growth during thermal aging, alters fracture pathways, and improves interfacial stability.
Iva Králová +6 more
wiley +1 more source
The Gaussian Sequence 3th Order Mod m
Communications in Advanced Mathematical SciencesThe work addresses the study of third-order recurrent sequences for mod m cases. Thus, some definitions aim to transform infinite sequences into finite ones.
Francisco Regis Alves +2 more
doaj +1 more source
Characterization of A5 and PSL(2,7) by sum of elements orders [PDF]
International Journal of Group Theory, 2013 Let $G$ be a finite group. We denote $psi(G)=sum_{gin G}o(g)$ where $o(g)$ denotes the order of $g in G$. Here we show that $psi(A_5)< psi(G)$ for every nonsimple group $G$ of order 60. Also we prove that $psi(PSL(2,7))groups $G$ of order 168.
Seyyed Majid Jafarian Amiri
doaj
On finite presentations for groups [PDF]
Proceedings of the American Mathematical Society, 1980 Three theorems are proved here giving canonical forms for finitely-presented groups. The first characterizes groups with balanced presentations as those groups with presentations of the form \[
openaire +1 more source
Investigating the Low‐Temperature Phase Stability of the Binary Ta–W System
Advanced Engineering Materials, EarlyView.Atomistic simulations show that the binary Ta–W system forms ordered intermetallic phases, B2‐TaW and D03‐TaW3, as 0 K ground states. Configurational entropy, however, lowers the free energy of the disordered bcc solid solution, which becomes the stable phase above about 400 K.
Klemens Lechner +7 more
wiley +1 more source
Journal 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