Related papers: The separating Noether number of small groups
Given a positive integer $u$ and a simple algebraic group $G$ defined over an algebraically closed field $K$ of characteristic $p$, we derive properties about the subvariety $G_{[u]}$ of $G$ consisting of elements of $G$ of order dividing…
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…
For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…
The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…
For a Grothendieck category having a noetherian generator, we prove that there are only finitely many minimal atoms. This is a noncommutative analogue of the fact that every noetherian scheme has only finitely many irreducible components.…
We obtain a complete description of the integer group determinants for SmallGroup(16,13), the central product of the dihedral group of order eight and cyclic group of order four. These values are the same as the integer group determinants…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…
We prove a fractional Noether's theorem for fractional Lagrangian systems invariant under a symmetry group both in the continuous and discrete cases. This provides an explicit conservation law (first integral) given by a closed formula…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…
We classify all of the groups with twelve or fewer subgroups. This paper is the proof of the entries in a submission to the Online Encyclopedia of Integer Sequences.
Finite nonassociative division algebras (i.e., finite semifields) with 243 elements are completely classified.
We compute the spinor class field for a genus of orders, in a central simple algebra of higher dimension, that are intersections of two maximal orders. In particular, we compute the number of spinor genera in a genus of such orders, as the…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…