Results 51 to 60 of about 83,911 (252)
Cazenave‐Dickstein‐Weissler‐Type Extension of Fujita'S Problem on Heisenberg Groups
ABSTRACT This paper investigates the Fujita critical exponent for a heat equation with nonlinear memory posed on the Heisenberg groups. A sharp threshold is identified such that, for exponent values less than or equal to this critical value, no global solution exists, regardless of the choice of nonnegative initial data. Conversely, for exponent values
Mokhtar Kirane +3 more
wiley +1 more source
Automorphism groups of some non-nilpotent Leibniz algebras
Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[,]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity: $[a,[b,c]]=[[a,b],c]+[b,[a,c]]$ for all $a,b,c\in L$. A linear transformation $f$ of $L$
L.A. Kurdachenko +2 more
doaj +1 more source
On normal automorphisms of n-periodic products of finite cyclic groups [PDF]
We prove that each normal automorphism of the$n$-periodic product of cyclic groups of odd order$rge1003$ is inner, whenever $r$ divides $n$.
Ashot Pahlevanyan +3 more
doaj
Finiteness of outer automorphism groups of random right-angled Artin groups
We consider the outer automorphism group Out(A_Gamma) of the right-angled Artin group A_Gamma of a random graph Gamma on n vertices in the Erdos--Renyi model.
Erdős, Matthew B Day
core +1 more source
Counting Independent Sets in Percolated Graphs via the Ising Model
ABSTRACT Given a graph G$$ G $$, we form a random subgraph Gp$$ {G}_p $$ by including each edge of G$$ G $$ independently with probability p$$ p $$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of ...
Anna Geisler +3 more
wiley +1 more source
Dimension invariants of outer automorphism groups
The geometric dimension for proper actions $\underline{\mathrm{gd}}(G)$ of a group $G$ is the minimal dimension of a classifying space for proper actions $\underline{E}G$.
Degrijse, Dieter, Souto, Juan
core +2 more sources
Splitting the difference: Computations of the Reynolds operator in classical invariant theory
Abstract If G$G$ is a linearly reductive group acting rationally on a polynomial ring S$S$, then the inclusion SG↪S$S^{G} \hookrightarrow S$ possesses a unique G$G$‐equivariant splitting, called the Reynolds operator. We describe algorithms for computing the Reynolds operator for the classical actions as in Weyl's book.
Aryaman Maithani
wiley +1 more source
On Groups of Automorphism of Lie Groups [PDF]
Not ...
openaire +3 more sources
Automorphisms of Coxeter groups [PDF]
16 pages, no figures. Submitted to Trans. Amer.
openaire +3 more sources
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj

