相关论文: Groups whose Chermak-Delgado lattice is a quasi-an…

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

A positive integer $m$ will be called a {\it finitistic order} for an element $\gamma$ of a group $\Gamma$ if there exist a finite group $G$ and a homomorphism $h:\Gamma\to G$ such that $h(\gamma)$ has order $m$ in $G$. It is shown that up…

The Boolean lattice $\mathcal{P}(n)$ consists of all subsets of $[n] = \{1,\dots, n\}$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer:…

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…

We construct a lattice theory describing a system of interacting nonrelativistic spin s=1/2 fermions at nonzero chemical potential. The theory is applicable whenever the interparticle separation is large compared to the range of the…

Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group $L$ is said to be almost recognizable by spectrum if every finite group isospectral to $L$ is an almost simple group…

We point out the possibility of nearly flat band with Chern number C=2 on the dice lattice in a simple nearest-neighbor tightbinding model. This lattice can be naturally formed by three adjacent $(111)$ layers of cubic lattice, which may be…

We describe overcommutative varieties of semigroups whose lattice of overcommutative subvarieties satisfies a non-trivial identity or quasiidentity. These two properties turn out to be equivalent.

In the article a classification method for nonlinear integrable equations with three independent variables is discussed based on the notion of the integrable reductions. We call the equation integrable if it admits a large class of…

Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. In this paper, we introduce the notion of the length…

Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…

In this note, we announce the first results on quasi-isometric rigidity of non-nilpotent polycyclic groups. In particular, we prove that any group quasi-isometric to the three dimenionsional solvable Lie group Sol is virtually a lattice in…

Let $L$ be a full-rank lattice in $\mathbb R^d$ and write $L^+$ for the semigroup of all vectors with nonnegative coordinates in $L$. We call a basis $X$ for $L$ positive if it is contained in $L^+$. There are infinitely many such bases,…

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…

This paper gives the relation between quasi completely inverse semirings and strongly additively quasi completely inverse semirings and generates the necessary and sufficient conditions for a strongly additively quasi completely inverse…

This paper is concerned with discrete, uniform subgroups (lattices) of oscillator groups, which are certain semidirect products of the Heisenberg group and the additive group of real numbers. The present paper rectifies the uncertainties in…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

The characterization of level sets of finite Boolean lattices as antichain cutsets, due to Rival and Zaguia, is seen to hold in all discrete semimodular lattices.

We give an elementary, case-free, Coxeter-theoretic derivation of the formula $h^nn!/|W|$ for the number of maximal chains in the noncrossing partition lattice $NC(W)$ of a real reflection group $W$. Our proof proceeds by comparing the…