相关论文: Groups whose Chermak-Delgado lattice is a quasi-an…
The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…
We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…
We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…
Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…
The Chermak-Delgado measure of a finite group is a function which assigns to each subgroup a positive integer. In this paper, we give necessary and sufficient conditions for when the Chermak-Delgado measure of a group is actually a map of…
We represent Feigin's construction [11] of lattice W algebras and give some simple results: lattice Virasoro and $W_3$ algebras. For simplest case $g=sl(2)$ we introduce whole $U_q(sl(2))$ quantum group on this lattice. We find simplest…
In this short note, we describe finite groups all of whose non-trivial cyclic subgroups have the same Chermak-Delgado measure.
We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…
We continue some recent investigations of W. Dziobiak, J. Jezek, and M. Maroti. Let G=(G,\cdot) be a commutative group. A semilattice over G is a semilattice enriched with G as a set of unary operations acting as semilattice automorphisms.…
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
In this article, we give a short algebraic proof that all closed intervals in a $\gamma$-Cambrian semilattice $\mathcal{C}_{\gamma}$ are trim for any Coxeter group $W$ and any Coxeter element $\gamma\in W$. This means that if such an…
If $m$ is a positive integer or infinity, the $m$-layer (or briefly, the layer) of a group $G$ is the subgroup $G_m$ generated by all elements of $G$ of order $m$. This notion goes back to some contributions of Ya.D. Polovickii of almost 60…
Given a quasi-monomial, respectively an almost monomial, group $A$ and a cyclic group $C$ of prime order $p>0$, we show that the wreath product $W=A\wr C$ is quasi-monomial (respectively almost monomial), if certain technical conditions…
A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…
In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…
In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…
If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct…