Results 71 to 80 of about 16,241 (233)
Lifting automorphisms of subgroups of direct products of cyclic $p$-groups [PDF]
International Journal of Group TheoryLet $\Gamma$ be a finite group. A subgroup $H$ of $\Gamma$ is called ``fully liftable" in $\Gamma$ if every automorphism of $H$ is the restriction of an automorphism of $\Gamma$.
Jill Dietz
doaj +1 more source
Mixed motives and linear forms in the Catalan constant
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract We first give a geometric construction of a two‐dimensional mixed motive over Q${\mathbb {Q}}$ with the Catalan constant G=1−1/32+1/52−1/72+⋯${\mathbf {G}}=1-1/3^2+1/5^2-1/7^2+\cdots$ as a period. We then use this motive to obtain a supply of linear forms in 1 and G${\mathbf {G}}$.
Payman Eskandari +2 more
wiley +1 more source
The isometry group of outer space [PDF]
, 2009 We prove analogues of Royden’s Theorem for the Lipschitz metrics of Outer Space, namely that Isom(CVn) = Out(Fn)
Francaviglia, Stefano +3 more
core +1 more source
ON THE GROWTH OF GROUPS AND AUTOMORPHISMS [PDF]
International Journal of Algebra and Computation, 2005 We consider the growth functions βΓ(n) of amalgamated free products Γ = A *C B, where A ≅ B are finitely generated, C is free abelian and |A/C| = |A/B| = 2. For every d ∈ ℕ there exist examples with βΓ(n) ≃ nd+1βA(n). There also exist examples with βΓ(n) ≃ en. Similar behavior is exhibited among Dehn functions.
openaire +4 more sources
Abelian number fields with frobenian conditions
Mathematika, Volume 72, Issue 4, October 2026.Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
Journal of Algebra, 2007 Let \({\mathcal E}\colon N\rightarrowtail G\twoheadrightarrow Q\) be a group extension with coupling \(\chi\colon Q\to\text{Out\,}N\). If \(\Aut\,{\mathcal E}=\{\gamma\in\Aut\,G\mid N^\gamma=N\}\), \(\text{Comp}(\chi)\) the group of all compatible pairs for \(\chi\) and \(A\) the center of \(N\) regarded as a \(Q\)-module via \(\chi\) then it is known [
openaire +2 more sources
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
On inner automorphisms and certain central automorphisms of groups
Indian Journal of Pure and Applied Mathematics, 2014 Let \(G\) be a group and \(M,N\trianglelefteq G\). By definition an automorphism \(\alpha\) of \(G\) belongs to \(\Aut^M_N(G)\) if and only if \(g^{-1}g^\alpha\in M\) for all \(g\in G\) and \(\alpha\) fixes \(N\) elementwise. The paper under review is devoted to the study of groups \(G\) in which one of the following holds: \(\mathrm{Inn}(G)=\Aut^M_N(G)
Azhdari, Zahedeh +1 more
openaire +2 more sources
Approximate Itai–Zehavi Conjecture for Random Graphs
Random Structures &Algorithms, Volume 69, Issue 2, September 2026.ABSTRACT A famous conjecture by Itai and Zehavi states that, for every d$$ d $$‐vertex‐connected graph G$$ G $$ and every vertex r$$ r $$ in G$$ G $$, there are d$$ d $$ spanning trees of G$$ G $$ such that, for every vertex v$$ v $$ in G∖{r}$$ G\setminus \left\{r\right\} $$, the paths between r$$ r $$ and v$$ v $$ in different trees are internally ...
Lawrence Hollom +4 more
wiley +1 more source
One note on the number of pairwise non-isomorphic connected regular graphs
Mathematics OpenIn this paper, we give an explicit expression for the number of pairwise non-isomorphic connected regular graphs as well as odd graphs on n vertices, where [Formula: see text] is a positive integer.
Hailin Liu, Liping Zhong, Huixian Xu
doaj +1 more source