Search results for "VERTEX"
showing 10 items of 225 documents
Vertices for characters of $p$-solvable groups
2002
Suppose that G is a finite p-solvable group. We associate to every irreducible complex character X ∈ Irr(G) of G a canonical pair (Q, δ), where Q is a p-subgroup of G and δ ∈ Irr(Q), uniquely determined by X up to G-conjugacy. This pair behaves as a Green vertex and partitions Irr(G) into families of characters. Using the pair (Q, δ), we give a canonical choice of a certain p-radical subgroup R of G and a character η ∈ Irr(R) associated to X which was predicted by some conjecture of G. R. Robinson.
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
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.
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.
On finding common neighborhoods in massive graphs
2003
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We prove lower bounds on the resources needed to solve this problem on resource-bounded models of computation. In streaming models, in which algorithms can access the input only a constant number of times and only sequentially, we show that, even with randomization, any algorithm that determines if there exists any pair of vertices with a large common neighborhood must essentially store and process the input graph off line. In sampling models, in which algorithms can only query an oracle for the common neighborhoods of specified vertex pairs, we show that any algorithm must …
“Ill-Conditioned” Vertices
1970
The round-off errors tend to increase particularly rapidly after pivoting at “ill-conditioned” vertices. Those vertices where two or more hyperplanes, each representing one constraint, intersect at a very slight angle are considered as “ill-conditioned”. An “ill-conditioned” vertex is for instance given by the intersection of the two constraints: $$\eqalign{ & 3\,{{\rm{x}}_{\rm{1}}}\, + \,{{\rm{x}}_{\rm{2}}}\, \le \,6 \cr & {{\rm{x}}_{\rm{1}}}\, + \,.354\,{{\rm{x}}_{\rm{2}}}\, \le \,2.001 \cr} $$
Games without repetitions on graphs with vertex disjoint cycles
1997
Games without repetitions on graphs with vertex disjoint cycles are considered. We show that the problem finding of the game partition in this class reduces to this problem for trees. A method of finding of the game partition for trees have been given in [2].
A graph associated with the $\pi$-character degrees of a group
2003
Let G be a group and $\pi$ be a set of primes. We consider the set ${\rm cd}^{\pi}(G)$ of character degrees of G that are divisible only by primes in $\pi$. In particular, we define $\Gamma^{\pi}(G)$ to be the graph whose vertex set is the set of primes dividing degrees in ${\rm cd}^{\pi}(G)$. There is an edge between p and q if pq divides a degree $a \in {\rm cd}^{\pi}(G)$. We show that if G is $\pi$-solvable, then $\Gamma^{\pi}(G)$ has at most two connected components.
The number of lifts of a Brauer character with a normal vertex
2011
AbstractIn this paper we examine the behavior of lifts of Brauer characters in p-solvable groups. In the main result, we show that if φ∈IBr(G) has a normal vertex Q and either p is odd or Q is abelian, then the number of lifts of φ is at most |Q:Q′|. As a corollary, we prove that if φ∈IBr(G) has an abelian vertex subgroup Q, then the number of lifts of φ in Irr(G) is at most |Q|.
SELF-ENERGIES AND VERTEX CORRECTIONS WITH TWO FACTORIZING LOOPS
1999
A complete set of factorizing two-loop self-energies and vertex corrections is calculated analytically for arbitrary masses and momenta — including the case of collinear singularities — within the ℛ-functions approach.