Spectral Characterizations of the Lovász Number and the Delsarte Number of a Graph

This paper gives spectral characterizations of two closely related graph functions: the Lovász number and a generalization ¹ of Delsarte's linear programming bound. There are many known characterizations of the Lovász number , and each one corresponds to a similar characterization of ¹ obtained by extremizing over a larger or smaller class of objects.The spectral characterizations of and ¹ given here involve the largest eigenvalue of a type of weighted Laplacian that Fan Chung introduced.     

On the consistency of conditional maximum likelihood estimators

Let {P _, : , H} be a family of probability measures admitting a sufficient statistic for the nuisance parameter . The paper presents conditions for consistency of (asymptotic) conditional maximum likelihood estimators for . An application to the Rasch-model (a stochastic model for psychological tests) yields a condition on the sequence of nuisance parameters which is sufficient for strong consistency of conditional maximum likelihood estimators, and necessary for the existence of any weakly consistent estimator-sequence.     

Randomized graph products, chromatic numbers, and the Lovász ϑ-function

For a graphG, let (G) denote the size of the largest independent set inG, and let (G) denote the Lovász -function onG. We prove that for somec>0, there exists an infinite family of graphs such that \alpha (G)n/2^{c\sqrt {\log n} }$$ " align="middle" border="0"> , wheren denotes the number of vertices in a graph. this disproves a known conjecture regarding the function.As part of our proof, we analyse the behavior of the chromatic number in graphs under a randomized version of graph products. This analysis extends earlier work of Linial and Vazirani, and of Berman and Schnitger, and may be of independent interest.Incumbent of the Joseph and Celia Reskin Career Development Chair. Yigal Alon Fellow     

Two poset polytopes

Two convex polytopes, called theorder polytope (P) andchain polytope (P), are associated with a finite posetP. There is a close interplay between the combinatorial structure ofP and the geometric structure of (P). For instance, the order polynomial (P, m) ofP and Ehrhart polynomiali((P),m) of (P) are related by (P, m+1)=i((P),m). A transfer map then allows us to transfer properties of (P) to (P). In particular, we transfer known inequalities involving linear extensions ofP to some new inequalities.Partially supported by NSF Grant No. 8104855-MCS and by a Guggenheim Fellowship.     

Fuzzy (Θ, S)-continuity and fuzzy (Θ, S)-closed graphs

The concept of (,s)-continuity [6] is considered and studied in fuzzy setting. It is seen that althought it is independent with each of the concepts of fuzzy continuity [2], fuzzy -continuity [10], fuzzy almost continuity [1] and fuzzy semicontinuity [1]; it implies fuzzy weak continuity [1], but the converse may not be true. The image of a compact fts [2] under a fuzzy (,s)-continuous surjective function isS-closed [5]. Finally the concepts of fuzzy (,s)-closed graphs, fuzzy (,s)-T ₂ spaces and fuzzy Urysohn spaces are introduced and mainly their connections with fuzzy (,s)-continuity are studied.     

Matrix functions with arbitrarily prescribed left and right partial indices

We prove that ifn2 and , are two given vectors inZ ⁿ, then there exists a matrix function inL ^n×n (T) which has a right Wiener-Hopf factorization inL ² with the partial indices and a left Wiener-Hopf factorization inL ² with the partial indices .     

A relation between the zeros of an <Emphasis Type="Italic">L</Emphasis>-function belonging to the Selberg class and the zeros of an associated <Emphasis Type="Italic">L</Emphasis>-function twisted by a Dirichlet character

Let F (s) be a function belonging to the Selberg class. For a primitive Dirichlet character , we can define the -twist F(s) of F (s). If F(s) also belongs to the Selberg class and satisfies some other conditions then there is a relation between the zeros of F (s) and the zeros F(s). Further we give an operator theoretic interpretation of this relation according to A. Connes study.Received: 5 January 2004     

Critical star multigraphs

A star-multigraphG is a multigraph in which there is a vertexv ⁺ which is incident with each non-simple edge. It is critical if it is connected, Class 2 and(G\e) < (G) for eache E(G). We show that, ifG is any star multigraph, then(G) (G) + 1. We investigate the edge-chromatic class of star multigraphs with at most two vertices of maximum degree. We also obtain a number of results on critical star multigraphs. We shall make use of these results in later papers.     

The Length of the Longest Head-Run in a Model with Long Range Dependence

In this paper, we construct stationary sequences of random variables { _i : i0} taking values ±1 with probability 1/2 and we prove an Erdös–Rényi law of large numbers for the length of the longest run of consecutive +1's in the sample {₀,..., _n }. Our model, which is called random walk in random scenery, exhibits long-range, positive dependence.     

Pseudo-mesures p- adiques associées aux fonctions L deQ

It is shown that some standard results concerning the p-adic L- functions, L_p(), ofQ(p-divisibilities of 1/2L_p(, s), and congruences for 1/2L_p(, t)–1/2L_p(, s), s, t_p) are direct consequences of a general structural theorem, based only on the functional properties of the p-adic pseudo-measures and distributions attached to these L_p-functions (essentially the eulerian ones). The method suggests that all such divisibilities and congruences are obtained systematically by this way, and are the best possible (in a standard point of view). In particular, these results improve significantly all the known ones.     

Trace formulas for pair operators

In this paper we shall study the Fredholm determinant and related trace formulas for a class of operators which correspond to the restriction of integral operators with kernels of the form k(x,y) = (x)g^v(x–y)+[1–(x)]f^v(x–y) to the square |x|,|y| T and shall evaluate the limit as T . Here denotes the indicator function of the right half-line [0,) . The results obtained generalize the well known formulas of M. Kac for the classical convolution operator in which g = f .     

Wave operators in a multistratified strip

One investigates the scattering theory for the positive self-adjoint operatorH=–· acting in with = × and a bounded open set in ^n–1,n2. The real-valued function belongs toL (), is bounded from below byc>0 and there exist real-valued functions ₁ and ₂ inL () such that – _j ,j=1,2 is a short range perturbation of _j when (–1) ^j x _n +. One assumes _j = ^(j) 1_R,j=1,2, with ^(j) L bounded from below byc>0. One proves the existence and completeness of the generalized wave operators _j ^± =s – _j e ^–itHj ,j=1,2, withH _j =–· _j and _j : equal to 1 if (–1) ^j x _n >0 and to 0 if (–1) ^j x _n <0. The ranges ofW _j ^± :=( _j ^± )^* are characterized so that W ₁ ^± =Ran and . The scattering operator can then be defined.     

The crossing number of posets

The purpose of this paper is to investigate some properties of the crossing number (P) of a posetP. We first study the crossing numbers of the product and the lexicographical sum of posets. The results are similar to the dimensions of these posets. Then we consider the problem of what happens to the crossing number when a point is taken away from a poset. We show that ifP is a poset such that P and (P–)1, then 1/2 (P)(P–)(P). We don't know yet how to improve the lower bound. We also determine the crossing numbers of some subposets of the Boolean latticeB _n which consist of some specified ranks. Finally we show that _n is crossing critical where _n is the subposet ofB _n which is restricted to rank 1, rankn–1 and middle rank(s). Some open problems are raised at the end of this paper.     

Symmetriegerechte Basisvektoren für Permutationsdarstellungen aller endlichen Punktgruppen der Dimensionen 3 und 2

Zusammenfassung Es seiG eine endliche Untergruppe der orthogonalen Gruppe (det=±1) des ^k mitk=2 oder 3 undN eine endliche Menge von Punkten des ^k , welche unterG invariant ist. Dies gibt Anlass zu einer Permutationsdarstellung vonG im Vektorraum der komplexen Funktionen aufN.In Abschn. 3 wird für eine symmetriegerechte Basis angegeben. Dabei sind die Funktionswerte jeweils exakt tabelliert.

---

Let G be a finite subgroup of the orthogonal group (det=±1) of ^k wherek=2 or 3 and letN be a finite set of points of ^k , which is invariant underG. In this way one gets a permutation representation ofG in the vector space of the complex functions onN.In Section 3, a symmetry adapted basis is given for , where the function values are tabulated exactly.

---

---

Im Buch [1] wurden lediglich die Diedergruppen behandelt (in Abschn. 3.1).     

On the discrete mean square of Dirichlet <Emphasis Type="Italic">L</Emphasis>-functions at 1

There have been many results obtained so far for the mean square of the (absolute) value of the Dirichlet L-function L(s,) in the critical strip 0<<1, especially on the critical line , but relatively few results were known for discrete mean value of |L(1,)|² till W. Zhang had published papers improving the error term step by step, which have recently been superseded by M. Katsurada and K.Matsumoto in which they succeeded in deriving an asymptotic formula for ₀|L(1,)|². The object of our paper is to point out a structural property contained in the formation of the mean square, to find out the niryana–the true body of the above sum.Dedicated to Professor Jean Louis Nicolás on his sixtieth birthdayin final form: 7 October 2003     

Paradoxical subsets of hyperbolic and spherical discs

Given a disc D of radius r in H ² (resp. S ²) with <r (resp. <r), we determine the pairs (m,n) for which there is an (m,n)-paradoxical subset of D but not an (m–1, n)-paradoxical subset of D or an (m, n–1)-paradoxical subset of D.     

Plane Partitions and Characters of the Symmetric Group

In this paper we show that the existence of plane partitions, which are minimal in a sense to be defined, yields minimal irreducible summands in the Kronecker product of two irreducible characters of the symmetric group S(n). The minimality of the summands refers to the dominance order of partitions of n. The multiplicity of a minimal summand equals the number of pairs of Littlewood-Richardson multitableaux of shape (, ), conjugate content and type . We also give lower and upper bounds for these numbers.     

On the dispersion spectrum

A measure for the denseness of sequences (an) mod 1, irrational, is the dispersion constantD() introduced byH. Niederreiter. In this paper the smallest accumulation point ₁ of the set of theD() is determined and all those are explicitely given for whichD () < ₁ holds.     

Thermal creep of polyethylene in the presence of thermal cycling

The temperature-time dependence of Poisson's ratio and the volume relaxation of LDP is investigated in the case of uniaxial tension. It is established that at elevated temperatures and loads the material becomes denser and Poisson's ratio exceeds 0.5. It is shown that the (t) curves and the temperature dependence of the instantaneous Poisson's ratio are nonmonotonic, while the nature of the (t) relaxation changes qualitatively as a certain temperature region is entered and the stress is increased.Mekhanika Polimerov, Vol. 4, No. 3, pp. 421–427, 1968     

A variational principle for eigenvalues of pencils of Hermitian matrices

LetH=(A, B) be a pair of HermitianN×N matrices. A complex number is an eigenvalue ofH ifdet(A–B)=0 (we include = ifdetB=0). For nonsingularH (i.e., for which some is not an eigenvalue), we show precisely which eigenvalues can be characterized as _k ⁺ =sup{inf{*A:*B=1,S},SS _k},S _k being the set of subspaces of C ^N of codimensionk–1.Dedicated to the memory of our friend and colleague Branko NajmanResearch supported by NSERC of Canada and the I.W.Killam FoundationProfessor Najman died suddenly while this work was at its final stage. His research was supported by the Ministry of Science of CroatiaResearch supported by NSERC of Canada