Related papers: Constructing solvable groups with derived length f…
A phylogenetic tree is a graphical representation of an evolutionary history of taxa in which the leaves correspond to the taxa and the non-leaves correspond to speciations. One of important problems in phylogenetic analysis is to assemble…
In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.
We construct multiple Dirichlet series in several complex variables whose coefficients involve quadratic residue symbols. The series are shown to have an analytic continuation and satisfy a certain group of functional equations. These are…
We propose a new way to build networks of defects. The idea takes advantage of the deformation procedure recently employed to describe defect structures, which we use to construct networks, spread from small rudimentary networks that appear…
Let p be a prime larger than 3 and let G be a finite group. We prove that G is p-solvable of p-length at most 2 if there are at most two distinct character degrees relatively prime to p in the principal p-block of G. This generalizes a…
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…
In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying…
Multi-stroke characters in scripts such as Chinese and Japanese can be highly complex, posing significant challenges for both native speakers and, especially, non-native learners. If these characters can be simplified without degrading…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
We obtain the codegree of a certain primitive character for a finite solvable group, and thereby give a negative answer to a question proposed by Moret\'o in \cite{Moreto}.
A family of solvable self-dual Lie algebras is presented. There exist a few methods for the construction of non-reductive self-dual Lie algebras: an orthogonal direct product, a double-extension of an Abelian algebra, and a Wigner…
We describe several families of permutation polynomials obtained using functions with linear translators.
Much can be learned about a finite group from its character table, but sometimes that table can be difficult to compute. Supercharacter theories are generalizations of character theory defined by P. Diaconis and I.M. Isaacs, in which…
We construct a description of graded derivations in group algebras. Using this result for arbitrary graduation of the group algebra, we describe all possible structures of DG algebras. The corresponding examples are given. The description…
In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.
A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…
Solvable structures are exploited in order to find families of explicit solutions to evolution PDEs admitting suitable differential constraints. The effectiveness of the method is verified on several explicit examples.
Grammar-based sentence generation has been thoroughly explored for Context-Free Grammars (CFGs), but remains unsolved for recognition-based approaches such as Parsing Expression Grammars (PEGs). Lacking tool support, language designers…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, that has meromorphic continuation to…