1-Homogeneous Graphs with Cocktail Party μ-Graphs

Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition{{z V() | (z, y) = i, (x, z) = j} | 0 i, j d}is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v,k,,), where v = k, k = a ₁, (v – k – 1) = k(k – 1 – ) and c ₂ + 1, since a -graph is a regular graph with valency . If c ₂ = + 1 and c ₂ 1, then is a Terwilliger graph, i.e., all the -graphs of are complete. In [11] we classified the Terwilliger 1-homogeneous graphs with c ₂ 2 and obtained that there are only three such examples. In this article we consider the case c ₂ = + 2 3, i.e., the case when the -graphs of are the Cocktail Party graphs, and obtain that either = 0, = 2 or is one of the following graphs: (i) a Johnson graph J(2m, m) with m 2, (ii) a folded Johnson graph J¯(4m, 2m) with m 3, (iii) a halved m-cube with m 4, (iv) a folded halved (2m)-cube with m 5, (v) a Cocktail Party graph K _{m × 2} with m 3, (vi) the Schläfli graph, (vii) the Gosset graph.     

Canonical Semigroups of States and Cocycles for the Group of Automorphisms of a Homogeneous Tree

Let G=A ut(T) be the group of automorphisms of a homogeneous tree and let d(v,gv) denote the natural tree distance. Fix a base vertex e in T. The function (g)=exp(–d(e,ge)), being positive definte on G, gives rise to a semigroup of states on G whose infinitesimal generator d/d|₌₀=log() is conditionally positive definite but not positive definite. Hence, log() corresponds to a nontrivial cocycle (g): GH in some representation space H . In contrast with the case of PGL(2,), the representation is not irreducible.Let _o (g) be the derivative of the spherical function corresponding to the complementary series of A ut(T). We show that –d(e,ge) and _o (g) come from cohomologous cocycles. Moreover, _o is associated to one of the two (irreducible) special representations of A ut(T).     

Characterization,structure and analysis on abelian ℒ∞ groups

An abelian topological group is an group if and only if it is a locally -compactk-space and every compact subset in it is contained in a compactly generated locally compact subgroup. Every abelian groupG is topologically isomorphic to G ₀ where ₀ andG ₀ is an abelian group where every compact subset is contained in a compact subgroup. Intrinsic definitions of measures, convolution of measures, measure algebra,L ₁-algebra, Fourier transforms of abelian groups are given and their properties are studied.     

Finite presentability of Steinberg groups over group rings

LetA be a finitely generated commutative -algebra with Krull dimensiond, and let be an arbitrary finite group. It is proved that the Steinberg groupSt _n (A) is finitely presented whenevern4. If, in addition,nd+3, andK ₁ (A) andK ₂ (A) are finitely generated, thenE _n (A) andGL _n (A) are finitely presented.The Project supported by National Natural Science Foundation of China.     

On a hypothesis on Poincaré series

Let F(x₁,..., x_m) (m1) be a polynomial with integral p-adic coefficients, and let N, be the number of solutions of the congruence F(x₁,..., X_m)=0 mod A proof is given that the Poincaré series (t) = ₀ N t is rational for a class of isometrically-equivalent polynomials of m variables (m2) containing a form of degree n2 of two variables.Translated from Matematicheskie Zametki, Vol. 14, No. 3, pp. 453–463, September, 1973.The author wishes to thank N. G. Chudakov for discussing this paper and for his helpful advice.     

The Domination Parameters of Cubic Graphs

Let ir(G), (G), i(G), ₀(G), (G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any nonnegative integers k₁, k₂, k₃, k₄, k₅ there exists a cubic graph G satisfying the following conditions: (G) – ir(G) k₁, i(G) – (G) k₂, ₀(G) – i(G) > k₃, (G) – ₀(G) – k₄, and IR(G) – (G) – k₅. This result settles a problem posed in [9].Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093).Supported by RUTCOR.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Toughness and the existence ofk-factors. II

In a paper with the same title [3], we proved Chvátal's conjecture thatk-tough graphs havek-factors if they satisfy trivial necessary conditions. In this paper, we prove the following stronger result: Suppose|V(G)| k + 1,k |V(G)| even, and|S| k w(G – S) – 7/8k ifw(G – S) 2, wherew(G – S) is the number of connected components ofG – S. ThenG has ak-factor.     

On pathwise behavior of multiserver queues

In this paper, by exploiting recent results on the pathwise behavior of the workload process in single server, work conserving queues of theG/G/1/ type, we show that the workload of multiserver, work conserving queues ofG/G/m/ (m<) (andG/G/) queues satisfies an o(t) growth condition, provided that the time average of the work brought into the system is less thanm form < (and finite form=).     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

Best approximation and best unilateral approximation of the kernel of a biharmonic equation and optimal renewal of the values of operators

For the classB _p , 0 < 1, 1p , of 2-periodic functions of the form f(t)=u(,t), whereu (,t) is a biharmonic function in the unit disk, we obtain the exact values of the best approximation and best unilateral approximation of the kernel K(t) of the convolution f= K *g, gl, with respect to the metric of L₁. We also consider the problem of renewal of the values of the convolution operator by using the information about the values of the boundary functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.47, No. 11, pp. 1549–1557, November, 1995.     

Transvection free groups and invariants of polynomial tensor exterior algebras

Let :GGl(n, ) be a representation of a finite groupG over a field such that the ring of invariants is a polynomial algebra . It is known that in the nonmodular case (i.e., when the order of the group is not divisible by the characteristic of ), the invariants ofG acting on the tensor product of a polynomial and an exterior algebra are given by ,d denoting the exterior derivative. We show that in the modular case, the ring of invariants in is of this form if and only if is a polynomial algebra and all pseudoreflections in (G) are diagonalizable.     

On the Measure of a Nonreciprocal Algebraic Number

Let M() be the Mahler measure of an algebraic number and let G() be the modulus of the product of logarithms of absolute values of its conjugates. We prove that if is a nonreciprocal algebraic number of degree d 2 then M()² G()^1/d 1/2d. This estimate is sharp up to a constant. As a main tool for the proof we develop an idea of Cassels on an estimate for the resultant of and 1/. We give a number of immediate corollaries, e.g., some versions of Smyth's inequality for the Mahler measure of a nonreciprocal algebraic integer from below.     

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let (t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let (t,n) be the minimum ofc(G), whereG ranges over allt-tough 2-connected graphs onn vertices. It is shown that for fixedt>0 there exist constantsA, B such that (t,n)A·log(n) and (t,n)·log((t,n))B·log(n). Examples are presented showing that fort1 there exist constantsA, B such that (t,n)A·log(n) and (t,n)B· log(n). It is conjectured that (t,n) B·log(n) for some constantB. This conjecture is shown to be valid within the class of 3-connected graphs and, as conjectured in Bondy [1] forl=3, within the class of 2-connectedK _1.l-free graphs, wherel is fixed.     

Interpolation problems and Toeplitz operators on multiply connected domains

LetR be a bounded domain in the complex plane bounded by n + 1 nonintersecting analytic Jordan curves, letE, F, andG be flat unitary vector bundles (in the sense of Abrahamse and Douglas) and let :F G and :E G be bounded analytic bundle maps. A condition is given for the existence of a bounded analytic map D:E F such that D = , together with an estimate for D. An interesting special case is the case whereE = G and = I _E , for which the condition involves a uniform lower bound for a class of Toeplitz operators overR, all of which are induced (formally) by the bundle map (N = rankE). When interpreted for a finite column of analytic scalar functions, this special case gives quantitative information on the corona theorem forR. The main tool is the Sz.Nagy-Foias commutant lifting theorem for regionsR recently obtained by the author.Research supported by National Science Foundation Grant No. MCS 77-00966.     

On the Location of Roots of Independence Polynomials

The independence polynomial of a graph G is the function i(G, x) = _k0 i _k x ^k, where i _k is the number of independent sets of vertices in G of cardinality k. We prove that real roots of independence polynomials are dense in (–, 0], while complex roots are dense in , even when restricting to well covered or comparability graphs. Throughout, we exploit the fact that independence polynomials are essentially closed under graph composition.     

The binding number of a graph and its circuits

In this paper we prove the following main results: Theorem A. If bind (G)3/2, thenG–u has a Hamiltonian circuit for every vertexu of graphG _i, unlessG belongs either to two classesH ₁ andH ₂ of graphs or to some smaller order graphs with |V(G)|17. Theorem B. If bind (G)3/2 and the maximum degree (G)>(n–1)/2, |V(G)|=n>17, thenG is pancyclic (i.e., it contains a circuit of every lengthm, 3m|V(G)|).     

Solving systems of polynomial inequalities over a real closed field in subexponential time

Let _m= (₁,..., _m) denote an ordered field, where _i+1>0 is infinitesimal relative to the elements of _i, 0 < –i < m (by definition, ₀= ). Given a system of inequalities f₁ > 0, ..., f_s > 0, f_s+1 0, ..., f_k 0, where f_{j m} [X₁,..., X_n] are polynomials such that, and the absolute value of any integer occurring in the coefficients of the f_js is at most 2^M. An algorithm is constructed which tests the above system of inequalities for solvability over the real closure of _m in polynomial time with respect to M, ((d)ⁿd₀)^n+m. In the case _m=, the algorithm explicitly constructs a family of real solutions of the system (provided the latter is consistent). Previously known algorithms for this problem had complexity of the order ofM(d d ₀ ^{m 2U(n)} .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Maternaticheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 174, pp. 3–36, 1988.     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.