English
Related papers

Related papers: Constructing solvable groups with derived length f…

200 papers

Let $G$ be a finite $p$-solvable group, where $p$ is an odd prime. We establish a connection between extendible irreducible characters of subgroups of $G$ that lie under monomial characters of $G$ and nilpotent subgroups of $G$. We also…

Group Theory · Mathematics 2023-05-23 Maria Loukaki

We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…

Information Theory · Computer Science 2021-12-09 Zitan Chen

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

Group Theory · Mathematics 2021-07-30 Nikolay Nikolov , Dan Segal

We study word series and extended word series, classes of formal series for the analysis of some dynamical systems and their discretizations. These series are similar to but more compact than B-series. They may be composed among themselves…

Numerical Analysis · Mathematics 2015-12-01 Ander Murua , J. M. Sanz-Serna

We construct new classes of self-similar groups : S-aritmetic groups, affine groups and metabelian groups. Most of the soluble ones are finitely presented and of type FP_{n} for appropriate n.

Group Theory · Mathematics 2017-10-16 Dessislava H. Kochloukova , Said N. Sidki

Separable coordinate systems are introduced in the complex and real four-dimensional flat spaces. We use maximal Abelian subgroups to generate coordinate systems with a maximal number of ignorable variables. The results are presented (also…

Mathematical Physics · Physics 2017-08-11 E. G. Kalnins , Z. Thomova , P. Winternitz

We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary…

Disordered Systems and Neural Networks · Physics 2009-02-17 Jie Sun , Takashi Nishikawa , Daniel ben-Avraham

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

Representation Theory · Mathematics 2013-10-15 Mikhail V. Ignatyev

In an earlier article, we presented a method to obtain integrals of motion and polynomial algebras for a class of two-dimensional superintegrable systems from creation and annihilation operators. We discuss the general case and present its…

Mathematical Physics · Physics 2010-04-27 Ian Marquette

This article extends the range of 1-DOF rigid-foldable developable quadrilateral creased papers. In a previous article, we put forward a sufficient and necessary condition for a quadrilateral creased paper to be rigid-foldable, and…

Metric Geometry · Mathematics 2020-06-15 Zeyuan He , Simon D. Guest

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

Representation Theory · Mathematics 2019-11-19 Michael Bate , David I. Stewart

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

Group Theory · Mathematics 2010-04-16 Kay Magaard , Hung P. Tong-Viet

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Number Theory · Mathematics 2014-05-26 Yann Bugeaud , Andrej Dujella

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

Group Theory · Mathematics 2024-04-30 Max Horn , Alice Niemeyer , Cheryl Praeger , Daniel Rademacher

It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarchical. Although most of…

Combinatorics · Mathematics 2016-08-09 C. Dalfó , M. A. Fiol

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

In this paper, we show that a locally graded group with a finite number m of non-(nilpotent of class at most n) subgroups is (soluble of class at most [log2(n)] + m + 3)-by-(finite of order $\le$ m!). Also we show that the derived length of…

Group Theory · Mathematics 2014-12-05 Mohammad Zarrin

In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

Let $U$ be the unitriangular group over a finite field. We consider an interesting class of irreducible complex characters of $U$, so-called characters of depth 2. This is a next natural step after characters of maximal and submaximal…

Representation Theory · Mathematics 2023-12-04 Mikhail Ignatev , Mikhail Venchakov

In this paper we compute the characters of certain non-irreducible N=4 superconformal modules which are different from the ones treated in our previous paper, and study their relation with characters of N=2 superconformal modules. Also, for…

Representation Theory · Mathematics 2024-03-07 Minoru Wakimoto
‹ Prev 1 4 5 6 7 8 10 Next ›