On Frobenius Groups II: Universal completion of nearfields of finite degree over a field of reference

1987 ◽  
Vol 11 (3-4) ◽  
pp. 317-358 ◽  
Author(s):  
Hans Zassenhaus
Keyword(s):  
Finite Degree ◽  
Frobenius Groups ◽  
Universal Completion

scholarly journals Tetravalent edge-transitive Cayley graphs of Frobenius groups

2021 ◽  
Vol 53 (2) ◽  
pp. 527-551
Author(s):  
Lei Wang ◽  
Yin Liu ◽  
Yanxiong Yan
Keyword(s):  
Cayley Graphs ◽  
Frobenius Groups ◽  
Edge Transitive

scholarly journals Reliable Efficient Difference Methods for Random Heterogeneous Diffusion Reaction Models with a Finite Degree of Randomness

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 206
Author(s):  
María Consuelo Casabán ◽  
Rafael Company ◽  
Lucas Jódar
Keyword(s):  
Stochastic Process ◽  
Finite Difference ◽  
Coming Out ◽  
Finite Difference Methods ◽  
Diffusion Reaction ◽  
Finite Difference Schemes ◽  
Finite Degree ◽  
Mean Square Stability ◽  
Reaction Models ◽  
Difference Methods

This paper deals with the search for reliable efficient finite difference methods for the numerical solution of random heterogeneous diffusion reaction models with a finite degree of randomness. Efficiency appeals to the computational challenge in the random framework that requires not only the approximating stochastic process solution but also its expectation and variance. After studying positivity and conditional random mean square stability, the computation of the expectation and variance of the approximating stochastic process is not performed directly but through using a set of sampling finite difference schemes coming out by taking realizations of the random scheme and using Monte Carlo technique. Thus, the storage accumulation of symbolic expressions collapsing the approach is avoided keeping reliability. Results are simulated and a procedure for the numerical computation is given.

scholarly journals Frobenius groups of low rank

2021 ◽  
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Frobenius Group ◽  
Low Rank ◽  
Special Situation ◽  
Frobenius Groups ◽  
Frobenius Kernel

AbstractLet G be a finite Frobenius group of degree n. We show, by elementary means, that n is a power of some prime p provided the rank $${\mathrm{rk}}(G)\le 3+\sqrt{n+1}$$ rk ( G ) ≤ 3 + n + 1 . Then the Frobenius kernel of G agrees with the (unique) Sylow p-subgroup of G. So our result implies the celebrated theorems of Frobenius and Thompson in a special situation.

scholarly journals On finite degree partial representations of groups

2004 ◽  
Vol 274 (1) ◽  
pp. 309-334 ◽  
Author(s):  
M. Dokuchaev ◽  
N. Zhukavets
Keyword(s):  
Finite Degree ◽  
Representations Of Groups

Groups Saturated with Finite Frobenius Groups

2021 ◽  
Vol 109 (1-2) ◽  
pp. 270-279
Author(s):  
A. I. Sozutov
Keyword(s):  
Frobenius Groups

scholarly journals Cubic arc-transitive Cayley graphs on Frobenius groups

2018 ◽  
Vol 17 (07) ◽  
pp. 1850126 ◽  
Author(s):  
Hailin Liu ◽  
Lei Wang
Keyword(s):  
Automorphism Group ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Frobenius Groups

A Cayley graph [Formula: see text] is called arc-transitive if its automorphism group [Formula: see text] is transitive on the set of arcs in [Formula: see text]. In this paper, we give a characterization of cubic arc-transitive Cayley graphs on a class of Frobenius groups.

scholarly journals Finite degree clones are undecidable

2019 ◽  
Vol 796 ◽  
pp. 237-271
Author(s):  
Matthew Moore
Keyword(s):  
Finite Degree
Sign in / Sign up

Export Citation Format

Share Document