Results 121 to 130 of about 163,882 (275)
Limit trees for free group automorphisms: universality
To any free group automorphism, we associate a universal (cone of) limit tree(s) with three defining properties: first, the tree has a minimal isometric action of the free group with trivial arc stabilizers; second, there is a unique expanding dilation ...
Jean Pierre Mutanguha
doaj +1 more source
On θ-commutators and the corresponding non-commuting graphs
The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other ...
Shalchi S., Erfanian A., Farrokhi DG M.
doaj +1 more source
Random Orderings and Unique Ergodicity of Automorphism Groups [PDF]
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random graph.
Omer Angel, A. Kechris, R. Lyons
semanticscholar +1 more source
On the universal pairing for 2‐complexes
Abstract The universal pairing for manifolds was defined and shown to lack positivity in dimension 4 in [Freedman, Kitaev, Nayak, Slingerland, Walker, and Wang, J. Geom. Topol. 9 (2005), 2303–2317]. We prove an analogous result for 2‐complexes, and show that the universal pairing does not detect the difference between simple homotopy equivalence and 3 ...
Mikhail Khovanov+2 more
wiley +1 more source
On Some Properties of the Operator, Defined on Class of Analytic in the Half-Plane Functions
In present paper the properties of the operator introduced by authors, which is defined on special class of n-normalized analytic in the half-plane functions are investigated. This operator is closely related with automorphism of a half-plane.
J. Kirjackis, E. G. Kiriyatzkii
doaj +1 more source
The Generic Circular Triangle‐Free Graph
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
The Minimal Automorphism-Free Tree [PDF]
A finite tree $T$ with $|V(T)| \geq 2$ is called {\it automorphism-free} if there is no non-trivial automorphism of $T$. Let $\mathcal{AFT}$ be the poset with the element set of all finite automorphism-free trees (up to graph isomorphism) ordered by $T_1
Kim, Ilhee, Kim, Ringi, Seymour, Paul
core
Automophisms of Nil-Triangular Subrings of Algebras Chevalley Type $G_2$ Over Integral Domain. I
Let $N\Phi(K)$ be the nil-triangular subalgebra of the Chevalley algebra over an associative commutative ring $K$ with the identity associated with a root system $\Phi$.
A. V. Kazakova
doaj +1 more source
Permutation matrices and matrix equivalence over a finite field
Let F=GF(q) denote the finite field of order q and Fm×n the ring of m×n matrices over F. Let 𝒫n be the set of all permutation matrices of order n over F so that 𝒫n is ismorphic to Sn.
Gary L. Mullen
doaj +1 more source
We determine the automorphism group of the modular curve $X_0^*(p)$ for all prime numbers $p$.
Yuji Hasegawa, Matthew Baker
openaire +3 more sources