Related papers: Constructing solvable groups with derived length f…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We begin the study of character sheaves on a not necessarily connected reductive group, extending the known theory for connected groups.
We restrict the possibilities for the character degrees of $p$-groups $G$ satisfying $|G:G'| = p^2$. E.g. if $G$ is of maximal class and has an irreducible character of degree $> p$, then it has such a character of degree at most…
A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…
This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…
Let $G$ be a group, let $d$ be a character degree, and let $e$ be the integer so that $|G| = d(d+e)$. It has been shown when $e > 1$ that $|G| \le e^4 - e^3$. In this paper, we consider the groups where $|G| = e^4 - e^3$. It is known that…
We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…
In this paper, we deal with locally graded groups whose subgroups are either subnormal or soluble of bounded derived length, say d. In particular, we prove that every locally (soluble-by-finite) group with this property is either soluble or…
We describe a new method of constructing rational surfaces with given invariants in P^4 and present a family of degree 11 rational surfaces of sectional genus 11 with 2 six-secants that we found with this method.
We present a new one parameter family of second derivative discontinuous solutions to the simplest scale invariant linear ordinary differential equation. We also point out how the construction could be extended to generate families of…
In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…
In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three…
In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.
We consider problems concerning the largest degrees of irreducible characters of symmetric groups, and the multiplicities of character degrees of symmetric groups. Using evidence from computer experiments, we posit several new conjectures…
In this paper, using group actions, we introduce a new method for constructing partial geometric designs (sometimes referred to as $1\frac{1}{2}$-designs). Using this new method, we construct several infinite families of partial geometric…
We determine the finite groups whose real irreducible representations have different degrees.
We classify the irreducible complex characters of the symplectic groups $Sp_{2n}(q)$ and the orthogonal groups $Spin_{2n}^\pm(q)$, $Spin_{2n+1}(q)$ of degrees up to the bound D, where $D=(q^n-1)q^{4n-10}/2$ for symplectic groups,…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…