Search results for "Graph theory"

HEIGHTS OF CHARACTERS IN BLOCKS OF $p$-SOLVABLE GROUPS

2005

In this paper, it is proved that if $B$ is a Brauer $p$ -block of a $p$ -solvable group, for some odd prime $p$ , then the height of any ordinary character in $B$ is at most $2b$ , where $p^b$ is the largest degree of the irreducible characters of the defect group of $B$ . Some other results that relate the heights of characters with properties of the defect group are obtained.

Construction of 3D Triangles on Dupin Cyclides

2011

This paper considers the conversion of the parametric Bézier surfaces, classically used in CAD-CAM, into patched of a class of non-spherical degree 4 algebraic surfaces called Dupin cyclides, and the definition of 3D triangle with circular edges on Dupin cyclides. Dupin cyclides was discovered by the French mathematician Pierre-Charles Dupin at the beginning of the 19th century. A Dupin cyclide has one parametric equation, two implicit equations, and a set of circular lines of curvature. The authors use the properties of these surfaces to prove that three families of circles (meridian arcs, parallel arcs, and Villarceau circles) can be computed on every Dupin cyclide. A geometric algorithm …

Asymptotics for thenth-degree Laguerre polynomial evaluated atn

1992

We investigate the asymptotic behaviour of ? n (n),n?? where ? n (x) denotes the Laguerre polynomial of degreen. Our results give a partial answer to the conjecture ?? n (n)>1 forn>6, made in 1984 by van Iseghem. We also show the connection between this conjecture and the continued fraction approximants of $$6\sqrt {{3 \mathord{\left/ {\vphantom {3 \pi }} \right. \kern-\nulldelimiterspace} \pi }} $$ .

Extremum degree sets of irregular oriented graphs and pseudodigraphs

2006

BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE

2013

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.

Incomplete vertices in the prime graph on conjugacy class sizes of finite groups

2013

Abstract Given a finite group G, consider the prime graph built on the set of conjugacy class sizes of G. Denoting by π 0 the set of vertices of this graph that are not adjacent to at least one other vertex, we show that the Hall π 0 -subgroups of G (which do exist) are metabelian.

Degree sequences of digraphs with highly irregular property

1998

Embeddings of Danielewski surfaces

2003

A Danielewski surface is defined by a polynomial of the form P=x nz −p(y). Define also the polynomial P ′ =x nz −r(x)p(y) where r(x) is a non-constant polynomial of degree ≤n−1 and r(0)=1. We show that, when n≥2 and deg p(y)≥2, the general fibers of P and P ′ are not isomorphic as algebraic surfaces, but that the zero fibers are isomorphic. Consequently, for every non-special Danielewski surface S, there exist non-equivalent algebraic embeddings of S in ℂ3. Using different methods, we also give non-equivalent embeddings of the surfaces xz=(y d n >−1) for an infinite sequence of integers d n . We then consider a certain algebraic action of the orthogonal group $\mathcal O(2)$ on ℂ4 which was…

On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric

2011

It is known that the d-dimensional Steiner Minimum Tree Problem in Hamming metric is NP-complete if d is considered to be a part of the input. On the other hand, it was an open question whether the problem is also NP-complete in fixed dimensions. In this paper we answer this question by showing that the problem is NP-complete for any dimension strictly greater than 2. We also show that the Steiner ratio is 2 - 2/d for d ≥ 2. Using this result, we tailor the analysis of the so-called k-LCA approximation algorithm and show improved approximation guarantees for the special cases d = 3 and d = 4.

Counterexamples to the Kneser conjecture in dimension four.

1995

We construct a connected closed orientable smooth four-manifold whose fundamental group is the free product of two non-trivial groups such that it is not homotopy equivalent toM 0#M 1 unlessM 0 orM 1 is homeomorphic toS 4. LetN be the nucleus of the minimal elliptic Enrique surfaceV 1(2, 2) and putM=N∪ ∂NN. The fundamental group ofM splits as ℤ/2 * ℤ/2. We prove thatM#k(S 2×S2) is diffeomorphic toM 0#M 1 for non-simply connected closed smooth four-manifoldsM 0 andM 1 if and only ifk≥8. On the other hand we show thatM is homeomorphic toM 0#M 1 for closed topological four-manifoldsM 0 andM 1 withπ 1(Mi)=ℤ/2.