Let PL0(I) represent the group of orientation-preserving piecewise-linear homeomorphisms of the unit interval which admit finitely many breaks in slope, under the operation of composition. We find a non-solvable groupW and show thatW embeds in every non-solvable subgroup of PL0(I). We find mild conditions under which other non-solvable subgroups (B, (≀Z≀), (Z≀), and (≀Z)) embed in subgroups of ...

It is shown that any non-solvable Latin Tableau (LT) has a solvable LT-extension with the same shape, and an algorithm computing the minimal such extension is presented. Minimal Latin Square embeddings of solvable Latin Tableaux are established. The results depend partly on the truth of the Wide Partition Conjecture for Latin Tableaux. More about Latin Tableaux and their Embeddings Bart Demoen ...

In this paper, first we introduce the notions of k-nilpotent (solvable) ideals and BCK-algebras. Specially, show that every commutative ideal is 1-nilpotent (solvable). Second, state an equivalent condition to k-nilpotency (solvablity) BCK-algebra. Finally, study n-fold 2-nilpotent BCK-algebras as a generalization BCK-algebras, relation between these two concepts. Basically, compare solvable (B...

We prove that an element g of prime order > 3 belongs to the solvable radical R(G) of a finite (or, more generally, a linear) group if and only if for every x ∈ G the subgroup generated by g, xgx is solvable. This theorem implies that a finite (or a linear) group G is solvable if and only if in each conjugacy class of G every two elements generate a solvable subgroup.

We study the combinatorics of constructing non-singular geometrically irreducible projective curves that do not admit rational points over finite solvable extensions of the base field. A graph is without solvable orbits if its group of automorphisms acts on each of its orbits through a non-solvable quotient. We prove that there is a connected graph without solvable orbits of cyclomatic number c...

A difficult problem in the character theory of solvable groups is to show that the number c.d. (G) of irreducible character degrees of a solvable group G is equal to or greater than d.l. (G), the derived length of G. Isaacs [4] has shown that d.l. (G) ^ 3 c.d. (G)-2 for every solvable group. Berger [1] subsequently proved that d.l. (G) < c.d. (G) when | G | is odd. This problem belongs to the c...

‎let $g$ be a finite group and let $n$ be a normal subgroup of $g$‎. ‎suppose that ${rm{irr}} (g | n)$ is the set of the irreducible characters of $g$ that contain $n$ in their kernels‎. ‎in this paper‎, ‎we classify solvable groups $g$ in which the set $mathcal{c} (g) = {{rm{irr}} (g | n) | 1 ne n trianglelefteq g }$ has at most three elements‎. ‎we also compute the set $mathcal{c}(g)$ for suc...

We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson’s group F . We find geometric criteria determining the derived length of any such group, and use this criteria to classify the solvable and non-solvable subgroups of PLo(I) and of F . Let H be a subgroup o...

Using the formalism of supersymmetric quantum mechanics, we obtain a large number of new analytically solvable one-dimensional periodic potentials and study their properties. More specifically, the supersymmetric partners of the Lamé potentials ma(a+ 1) sn(x,m) are computed for integer values a = 1, 2, 3, .... For all cases (except a = 1), we show that the partner potential is distinctly differ...

Abstract. A case of the matrix Kummer relation of Herz (1955) based on the Pearson VII type matrix model is derived in this paper. As a con- sequence, the polynomial Pearson VII configuration density is obtained and this sets the corresponding exact inference as a solvable aspect in shape theory. An application in postcode recognition, including a nu- merical comparison between the exact poly...