Related papers: Gauge-Invariant Uniqueness and Reductions of Order…

Let $\hat G$ be the finite simply connected version of an exceptional Chevalley group, and let $V$ be a nontrivial irreducible module, of minimal dimension, for $\hat G$ over its field of definition. We explore the overgroup structure of…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

An $L(h_1, h_2, \ldots, h_l)$-labelling of a graph $G$ is a mapping $\phi: V(G) \rightarrow \{0, 1, 2, \ldots\}$ such that for $1\le i\le l$ and each pair of vertices $u, v$ of $G$ at distance $i$, we have $|\phi(u) - \phi(v)| \geq h_i$.…

To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…

Let $G$ be a reductive group over a number field $F$, which is split at a finite place $\mathfrak{p}$ of $F$, and let $\pi$ be a cuspidal automorphic representation of $G$, which is cohomological with respect to the trivial coefficient…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

Suppose that G is a finite, unitary reflection group acting on a complex vector space V and X is the fixed point subspace of an element of G. Define N to be the setwise stabilizer of X in G, Z to be the pointwise stabilizer, and C=N/Z. Then…

Let $G$ be a compact connected Lie group acting on a stable complex manifold $M$ with equivariant vector bundle $E$. Besides, suppose $\phi$ is an equivariant map from $M$ to the Lie algebra $\mathfrak{g}$. We can define some equivalence…

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

Let $\psi : G\to GL(V)$ and $\varphi :G \to GL (W)$ be representations of finite group $G$. A linear map $T: V\to W$ is called a morphism from $\psi$ to $\varphi$ if it satisfys $T\psi_g= \varphi_g T$ for each $g\in G$ and let…

The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…

Let V(KG) be a normalised unit group of the modular group algebra of a finite p-group G over the field K of p elements. We introduce a notion of symmetric subgroups in V(KG) as subgroups invariant under the action of the classical…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

The relation between manifold topology, observables and gauge group is clarified on the basis of the classification of the representations of the algebra of observables associated to positions and displacements on the manifold. The guiding,…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

The notion of a \emph{$G$-completely reducible} subgroup is important in the study of algebraic groups and their subgroup structure. It generalizes the usual idea of complete reducibility from representation theory: a subgroup $H$ of a…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

An automorphism of a group is called outer if it is not an inner automorphism. Let $G$ be a finite $p$-group. Then for every outer $p$-automorphism $\phi$ of $G$ the subgroup $C_G(\phi)=\{x\in G \;|\; x^\phi=x\}$ has order $p$ if and only…

Johnson's characterization of amenable groups states that a discrete group $\Gamma$ is amenable if and only if $H_b^{n \geq 1}(\Gamma; V) = 0$ for all dual normed $\mathbb{R}[\Gamma]$-modules V. In this paper, we extend the previous result…