相关论文: An EL-labeling of the subgroup lattice

In the paper (Osaka J. Math. {\bf 46}: 403-409, 2009), Yang conjectured that a non-elementary subgroup $G$ of $SL(2, \bc)$ containing elliptic elements is discrete if for each elliptic element $g\in G$ the group $< f, g >$ is discrete,…

We construct the first example of a lattice on an irreducible Euclidean building that is not residually finite. Conjecturally, the normal subgroup theorem extends to this lattice making it virtually simple.

Let $\frak {F}$ be a class of group. A subgroup $A$ of a finite group $G$ is said to be $K$-$\mathfrak{F}$-subnormal in $G$ if there is a subgroup chain $$A=A_{0} \leq A_{1} \leq \cdots \leq A_{n}=G$$ such that either $A_{i-1}…

Let $G$ be a semisimple real algebraic Lie group of real rank at least two and $U$ be the unipotent radical of a non-trivial parabolic subgroup. We prove that a discrete Zariski dense subgroup of $G$ that contains an irreducible lattice of…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

A group $G$ is said to have dense solitary subgroups if each non-empty open interval in its subgroup lattice $L(G)$ contains a solitary subgroup. In this short note, we find all finite groups satisfying this property.

A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…

With any integral lattice \Lambda in n-dimensional euclidean space we associate an elementary abelian 2-group I(\lambda) whose elements represent parts of the dual lattice that are similar to \Lambda. There are corresponding involutions on…

$H$ is called a $G$-subgroup of a hyperbolic group $G$ if for any finite subset $M\subset G$ there exists a homomorphism from $G$ onto a non-elementary hyperbolic group $G_1$ that is surjective on $H$ and injective on $M$. In his paper in…

Entity Linking (EL) is an essential task for semantic text understanding and information extraction. Popular methods separately address the Mention Detection (MD) and Entity Disambiguation (ED) stages of EL, without leveraging their mutual…

In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…

A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…

A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…

In this article, we compare two different notions of partially defined group strutures, namely partial groups and pregroups, as introduced by Chermak and Stallings respectively. In particular we prove that the category of pregroups can be…

This communication records some observations made in the course of studying one-relator groups from the point of view of residual solvability. As a contribution to clas- sification efforts we single out some relator types that render the…

We extend to semi-abelian categories the notion of characteristic subobject, which is widely used in group theory and in the theory of Lie algebras. Moreover, we show that many of the classical properties of characteristic subgroups of a…

Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…

We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…