Groups with exactly two supercharacter theories

In this paper, we classify those finite groups with exactly two supercharacter theories. We show that the solvable groups with two supercharacter theories are ?₃ and S₃. We also show that the only nonsolvable group with two supercharacter theories is Sp(6,2).     

Remarks on Gelfand Pairs Associated to Non-Type-I Solvable Lie Groups

LetSbe a connected and simply connected unimodular solvable Lie group andKa connected compact Lie group acting onSas automorphisms. We call the pair (K S) a Gelfand pair if the Banach ∗-algebraL¹_K(S) of allK-invariant integrable functions onSis a commutative algebra. In this paper we give a necessary and sufficient condition for the pair (K; S) to be a Gelfand pair using the representation theory of non-type-I solvable Lie groups. For a Gelfand pair (K; S) we realize all irreducibleK-spherical representations ofK?Sfrom irreducible unitary representations ofS.     

On Behavior of Solvable Ideals of Lie Algebras Under Outer Derivations

Let L be a finite dimensional Lie algebra over a field F. It is well known that the solvable radical S(L) of the algebra L is a characteristic ideal of L if char F = 0, and there are counterexamples to this statement in case char F = p > 0. We prove that the sum S(L) of all solvable ideals of a Lie algebra L (not necessarily finite dimensional) is a characteristic ideal of L in the following cases: 1) char F = 0; 2) S(L) is solvable and its derived length is less than log₂ p.     

A characterization of finite simple groups by the orders of solvable subgroups

Let G be a finite group and S be a finite simple group. In this paper, we prove that if G and S have the same sets of all orders of solvable subgroups, then G is isomorphic to S, or G and S are isomorphic to Bn(q), Cn(q), where n≥3 and q is odd. This gives a positive answer to the problem put forward by Abe and Iiyori.     

The superstar packing problem

Hell and Kirkpatrick proved that in an undirected graph, a maximum size packing by a set of non-singleton stars can be found in polynomial time if this star-set is of the form {S ₁, S ₂, ..., S _k } for some k∈ℤ₊ (S _i is the star with i leaves), and it is NP-hard otherwise. This may raise the question whether it is possible to enlarge a set of stars not of the form {S ₁, S ₂, ..., S _k } by other non-star graphs to get a polynomially solvable graph packing problem. This paper shows such families of depth 2 trees. We show two approaches to this problem, a polynomial alternating forest algorithm, which implies a Berge-Tutte type min-max theorem, and a reduction to the degree constrained subgraph problem of Lovász. Research is supported by OTKA grants K60802, TS049788 and by European MCRTN Adonet, Contract Grant No. 504438.     

On the invariance of small overlap hypotheses

Suppose thtS is a semigroup with a finite presentation (X; R). John Remmers has proved that the word problem for the presentation (X; R) is solvable if the presentation satisfies a certain small overlap hypothesis,C(n), forn≥3. Here we prove that, with trivial but numerous exceptions, if (X ₁;R ₁) and (X ₂;R ₂) are both finite presentations forS which satisfyC(2), then forn≥2, (X ₁;R ₁) satisfiesC(n) if and only if (X ₂;R ₂) satisfiesC(n).     

On the complexity of reconstructing H‐free graphs from their Star Systems

In the Star System problem we are given a set system and asked whether it is realizable by the multi‐set of closed neighborhoods of some graph, i.e. given subsets S₁, S₂, …, S_n of an n‐element set V does there exist a graph G = (V, E) with {N[v]: v∈V} = {S₁, S₂, …, S_n}? For a fixed graph H the H‐free Star System problem is a variant of the Star System problem where it is asked whether a given set system is realizable by closed neighborhoods of a graph containing no H as an induced subgraph. We study the computational complexity of the H‐free Star System problem. We prove that when H is a path or a cycle on at most four vertices the problem is polynomial time solvable. In complement to this result, we show that if H belongs to a certain large class of graphs the H‐free Star System problem is NP‐complete. In particular, the problem is NP‐complete when H is either a cycle or a path on at least five vertices. This yields a complete dichotomy for paths and cycles. Copyright © 2010 John Wiley & Sons, Ltd. 68:113‐124, 2011     

Points invariants dans le produit de quatre inversions de centres non coplanaires

We study in the spaceE _n(n≥3) a special case in order to simplify long calculus. IfS ₁,S ₂,S ₃,S ₄ are centers of inversion’s spheres, then the straight lineS ₁ S ₄ is the common perpendicular to straight linesS ₁ S ₂ andS ₃ S ₄ which are orthogonal. But then we show that there exist invariant points ifn>3 in the subspace orthogonal to the centers’ subspace and if the powerk of four inversions is upper to 3a ²/₄ by supposing that lenghts ofS ₁ S ₂,S ₁ S ₄,S ₃ S ₄ are all equal toa. Ifk=3a ²/₄ it exists in the centers’ subspace an invariant point which is equidistant of four centers and which is common to four inversions’ spheres. Ifk<3a ²/₄ there is not any invariant point.      

On Cubic Graphs Admitting an Edge-Transitive Solvable Group

Using covering graph techniques, a structural result about connected cubic simple graphs admitting an edge-transitive solvable group of automorphisms is proved. This implies, among other, that every such graph can be obtained from either the 3-dipole Dip₃ or the complete graph K ₄, by a sequence of elementary-abelian covers. Another consequence of the main structural result is that the action of an arc-transitive solvable group on a connected cubic simple graph is at most 3-arc-transitive. As an application, a new infinite family of semisymmetric cubic graphs, arising as regular elementary abelian covering projections of K _3,3, is constructed.     

Varieties of solvable index-two alternative algebras over a field of characteristic three

The subvarieties of the variety Alt₂ of solvable index-two alternative algebras over an arbitrary field of characteristic 3 are studied. The main types of such varieties are singled out in the language of identities, and inclusions between these types are established. The main results is the following.Theorem.The topological rank of the variety Alt₂ of solvable index-two alternative algebras over an arbitrary field of characteristic 3 is equal to five. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 556–566, October, 1999.     

Finite groups with S-permutable n-minimal subgroups

We study the supersolvability of finite groups and the nilpotent length of finite solvable groups under the assumption that all their exactly n-minimal subgroups are S-permutable, where n is an arbitrary integer.     

Extensions and biextensions of locally constant group schemes,tori and abelian schemes

Let S be a scheme. We compute explicitly the group of homomorphisms, the S-sheaf of homomorphisms, the group of extensions, and the S-sheaf of extensions involving locally constant S-group schemes, abelian S-schemes, and S-tori. Using the obtained results, we study the categories of biextensions involving these geometrical objects. In particular, we prove that if G _i (for i = 1, 2, 3) is an extension of an abelian S-scheme A _i by an S-torus T _i , the category of biextensions of (G ₁, G ₂) by G ₃ is equivalent to the category of biextensions of the underlying abelian S-schemes (A ₁, A ₂) by the underlying S-torus T ₃.      

Bivariate hermite interpolation and applications to Algebraic Geometry

Summary We try to solve the bivariate interpolation problem (1.3) for polynomials (1.1), whereS is a lower set of lattice points, and for theq-th interpolation knot,A _q is the set of orders of derivatives that appear in (1.3). The number of coefficients |S| is equal to the number of equations |A _q |. If this is possible for all knots in general position, the problem is almost always solvable (=a.a.s.). We seek to determine whether (1.3) is a.a.s. An algorithm is given which often gives a positive answer to this. It can be applied to the solution of a problem of Hirschowitz in Algebraic Geometry. We prove that for Hermite conditions (1.3) (when allA _q are lower triangles of orderp) andP is of total degreen, (1.3) is a.a.s. for allp=1, 2, 3 and alln, except for the two casesp=1,n=2 andp=1,n=4.Dedicated to R. S. Varga on the occasion of his sixtieth birthdayThis work has been partly supported by the Texas ARP and the Deutsche Forschungsgemeinschaft     

Approximation of convex bodies by simplices

This paper deals with the following kind of approximation of a convex bodyQ in Euclidean space E ⁿ by simplices: which is the smallest positive numberh _S(Q) such thatS ₁ Q S ₂ for a simplexS ₁ and its homothetic copyS ₂ of ratioh _S(Q). It is shown that ifS ₀ is a simplex of maximal volume contained inQ, then a homothetic copy ofS ₀ of ratio 13/3 containsQ.     

On Solvable R* Groups of Finite Rank

Abstract

For an element a of a group G,let S(a) denote the semigroup generated by all conjugates of a in G. We prove that if G is solvable of finite rank and 1 ? S(a) for all 1 ≠ a ∈ G,then ?a ^G ?/?b ^G ? is a periodic group for every b ∈ S(a). Conversely if every two generator subgroup of a finitely generated torsion-free solvable group G has this property then G has finite rank,and if every finitely generated subgroup has this property then every partial order on G can be extended to a total order.     

Integral modular data and congruences

We compute all fusion algebras with symmetric rational S-matrix up to dimension 12. Only two of them may be used as S-matrices in a modular datum: the S-matrices of the quantum doubles of ℤ/2ℤ and S ₃. Almost all of them satisfy a certain congruence which has some interesting implications, for example for their degrees. We also give explicitly an infinite sequence of modular data with rational S- and T-matrices which are neither tensor products of smaller modular data nor S-matrices of quantum doubles of finite groups. For some sequences of finite groups (certain subdirect products of S ₃,D ₄,Q ₈,S ₄), we prove the rationality of the S-matrices of their quantum doubles.     

Solvable Indecomposable Extensions of Two Nilpotent Lie Algebras

A pair of sequences of nilpotent Lie algebras denoted by N_{n, 7} and N_{n, 16} are introduced. Here, n denotes the dimension of the algebras that are defined for n ≥ 6; the first terms in the sequences are denoted by 6.7 and 6.16, respectively, in the standard list of six-dimensional Lie algebras. For each of them, all possible solvable extensions are constructed so that N_{n, 7} and N_{n, 16} serve as the nilradical of the corresponding solvable algebras. The construction continues Winternitz’ and colleagues’ program of investigating solvable Lie algebras using special properties rather than trying to extend one dimension at a time.     

On Cycles in 3-Connected Graphs

 Let G be a 3-connected graph of order n and S a subset of vertices. Denote by δ(S) the minimum degree (in G) of vertices of S. Then we prove that the circumference of G is at least min{|S|, 2δ(S)} if the degree sum of any four independent vertices of S is at least n+6. A cycle C is called S-maximum if there is no cycle C ^′ with |C ^′∩S|>|C∩S|. We also show that if ∑⁴ _i=1 d(a _i)≥n+3+|⋂⁴ _i=1 N(a _i)| for any four independent vertices a ₁, a ₂, a ₃, a ₄ in S, then G has an S-weak-dominating S-maximum cycle C, i.e. an S-maximum cycle such that every component in G−C contains at most one vertex in S. Received: March 9, 1998 Revised: January 7, 1999     

Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours

 Let S _ni be a star of size n _i and let S=S _n1∪…∪S _nk≠S _2n−3∪S ₁ or S ₂∪S ₂ be a spanning star-forest of the complete graph K _2n. We prove that K _2n has a proper (2n−1)-edge-colouring such that all the edges of S receive distinct colours. This result is very useful in the study of total-colourings of graphs. Received: March 8, 1995 / Revised: May 16, 1997