相关论文: Sparse groups need not be semisparse

The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…

In this paper we characterize the monoid congruences of commutative semigroups by the help of the notion of the separator of subsets of semigroups. We show that every monoid congruence of a commutative semigroup S can be constructed by the…

In this short note we prove that the finite non-abelian simple groups PSL(2,q), where q = 5,7, are determined by their posets of classes of isomorphic subgroups. In particular, this disproves the conjecture in the end of [5].

Let $S$ be a non-empty subset of a group $G$. We say $S$ is product-free if $S\cap SS=\varnothing$, and $S$ is locally maximal if whenever $T$ is product-free and $S\subseteq T$, then $S=T$. Finally $S$ fills $G$ if $G^*\subseteq S \sqcup…

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

We provide a combinatorial recipe for constructing all posets of height at most two for which the corresponding type-A Lie poset algebra is contact. In the case that such posets are connected, a discrete Morse theory argument establishes…

A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…

It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…

The notion of double coset for semisimple finite dimensional Hopf algebras is introduced. This is done by considering an equivalence relation on the set of irreducible characters of the dual Hopf algebra. As an application formulae for the…

Given a graded poset $P$, consider a chain decomposition $\mathcal{C}$ of $P$. If $|C_1|\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\in \mathcal{C}$,…

We obtain many results and solve some problems about feebly compact paratopological groups. We obtain necessary and sufficient conditions for such a group to be topological. One of them is the quasiregularity. We prove that each…

The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…

A group $G$ is called a Howson group if the intersection $H\cap K$ of any two finitely generated subgroups $H, K<G$ is again finitely generated, and called a strongly Howson group when a uniform bound for the rank of $H\cap K$ can be…

We prove that for any prime p there exist infinitely many finite simple groups G with a coset xP of a Sylow p-subgroup P of G such that every element of xP has order divisible by p. John Thompson proved this for p=2 in 1967 answering a…

In this paper we give sufficient conditions under which a subsemigroup of a topological group is a subgroup, adding to the results given in \cite{Kosh, can, axioms, forum, Hof, cc, locally} where conditions exist (such as locally…

Using Cohen's classification of symplectic reflection groups, we prove that the parabolic subgroups, that is, stabilizer subgroups, of a finite symplectic reflection group are themselves symplectic reflection groups. This is the symplectic…

In this paper, we bring together results about the existence of a somewhere dense (resp. dense) orbit and the minimal number of generators for abelian semigroups of matrices on $\mathbb{R}^n$. We solve the problem of determining the minimal…

We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by…

The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…