Equations and dot-depth one

This paper studies the fine structure of the Straubing hierarchy of star-free languages. Sequences of equations are defined and are shown to be sufficiently strong to characterize completely the monoid varieties of a natural subhierarchy of level one. In a few cases, it is also shown that those sequences of equations are equivalent to finite ones. Extensions to a natural sublevel of level two are discussed. This work was initiated while the author was at the Université de Montréal under an NSERC Postdoctoral Fellowship (Natural Sciences and Engineering Research Council of Canada). This work was supported by a grant from the Research Council of the University of North Carolina at Greensboro. Many thanks to the referee for his valuable comments and suggestions.     

Some variations of the Hardy hierarchy

We study some variations of the so‐called Hardy hierarchy (up to ε₀) of quickly growing functions, known from the literature, and obtain analogues of Ratajczyk's approximation lemma for them. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some applications of the analytic hierarchy process

In this paper we describe our experience using the Analytic Hierarchy Process in the evaluation of drug effectiveness in medicine, wine tasting and tea production, selection of team members in sports, forecasting in the industrial sector and service and trade. Each of the applications presented involves the quantification of qualitative information.     

Some results on the capitulation problem

Let K be an unramified abelian extension of a number field F with Galois group G. K corresponds to a subgroup H of the ideal class group of F. We study the subgroup J of ideal classes in H which become trivial in K. There is an epimorphism from the cohomology group H^?1(G, Cl_K) to J which is an isomorphism if G is cyclic; Cl_K is the ideal class group of K. Some results on the structure of J and Cl_K are obtained.     

Some results on the nonstationary ideal

The strength of precipitousness, presaturatedness and saturatedness of NS_κ and NS _κ ^λ is studied. In particular, it is shown that:

1. The exact strength of “ $NS_{\mu ^ + }^\lambda $ for a regularμ > max(λ, ?₁)” is a (ω,μ)-repeat point.
2. The exact strength of “NS_κ is presaturated over inaccessible κ” is an up-repeat point.
3. “NS_κ is saturated over inaccessible κ” implies an inner model with ?αo(α) =α ⁺⁺.

     

Some results on the achromatic number

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ≤ m. We show that the problem of determining the achromatic number of a tree is NP-hard. We further prove that almost all trees T satisfy ψ (T) = q(m), where m is the number of edges in T. Lastly, for fixed d and ϵ > 0, we show that there is an integer N₀ = N₀(d, ϵ) such that if G is a graph with maximum degree at most d, and m ≥ N₀ edges, then (1 - ϵ)q(m) ≤ ψ (G) ≤ q(m). © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 129–136, 1997     

Some results on the Oberwolfach problem

Aequationes mathematicae -     

Some new results on the Littlewood-Offord problem

We consider the 2ⁿ sums of the form Σ?_ia_i with the a_i's vectors, | a_i | ? 1, and ?_i = 0, 1 for each i. We raise a number of questions about their distribution.We show that if the a_i lie in two dimensions, then at most $\text{n}\text{(}\text{n}\text{2}\text{)}$) sums can lie within a circle of diameter √3, and if n is even at most the sum of the three largest binomial coefficients can lie in a circle of diameter √5. These are best results under the indicated conditions.If two a's are more than 60° but less than 120° apart in direction, then the bound ($\text{n}\text{[}\text{n}\text{2}\text{]}$) on sums lying within a unit diameter sphere is improved to ($\text{n+1}\text{[}\text{n}\text{2}\text{]}\text{) ? 2(}\text{n?1}\text{[(n?}\text{1}\text{2}\text{)])}$.The method of Katona and Kleitman is shown to lead to a significant improvement on their two dimensional result.Finally, Lubell-type relations for sums lying in a unit diameter sphere are examined.     

Some results on the forced pendulum equation

This paper is devoted to the study of the forced pendulum equation in the presence of friction, namely u^″+au^′+sinu=f(t)$u^{″}+a{u}^{\prime }+sinu=f\left(t\right)$ with a∈R$a\in \mathbb{R}$ and f∈L²(0,T)$f\in L^2(0,T)$.     

Some results on the nonstationary ideal II

This paper is a continuation of [Gi]. We show that the upper bound of [Gi] on the strength of NS _μ ⁺ precipitous for a regular μ is exact. The upper bounds on the strength of NS_κ precipitous for inaccessible κ are reduced quite close to the lower bounds.     

Some results on the spectral reconstruction problem

This paper is concerned with the spectral version of the reconstruction conjecture: Whether a graph with n>2 vertices is determined (up to isomorphism) by the collection of its spectrum and the spectrum of its vertex-deleted graphs? Some positive results as well as a method for constructing counterexamples to the problem are provided.     

Some results on sperner families

Let F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if $\text{A ∈ F ?}\text{A}\text{= {1,…,m}βA ∈ F}$, and if the parameters of F are p₀,…,p_m then

$\text{∑}\text{i=0}\text{[}\text{m}\text{2}\text{Pi}\text{m?1}\text{i?1}\text{+}\text{∑}\text{i=[}\text{m}\text{2}\text{]+1}\text{m}\text{Pi}\text{m?1}\text{m?i?1}\text{? 2}$

Here we generalize this result and prove some analogues of it. A corollary of Bollobás' result is that $\text{|F| ? 2(}{}_{\mathrm{<mtext>[</mtext><mtext>m</mtext><mtext>2</mtext><mtext>]?1</mtext>}}{}^{\mathrm{m?1}}\text{)}$. Purdy proved that if $\text{A ∈ F ?}\text{A}\text{? F}$ then $\text{|F| ? (}{}_{\mathrm{<mtext>[</mtext><mtext>m</mtext><mtext>2</mtext><mtext>]+1</mtext>}}{}^{\mathrm{m}}\text{)}$, which implies Bollobás' corollary. We also show that Purdy's result may be deduced from Bollobás' by a short argument. Finally, we give a canonical form for Sperner families which are also pairwise intersecting.     

Some results on symplectic matrices

The principal results are that if A is an integral matrix such that AA^T is symplectic then A = CQ, where Q is a permutation matrix and C is symplectic; and that if A is a hermitian positive definite matrix which is symplectic, and B is the unique hermitian positive definite pth.root of A, where p is a positive integer, then B is also symplectic.     

Some results on fractionaln-factor-critical graphs

A simple graphG is said to be fractionaln-factor-critical if after deleting anyn vertices the remaining subgraph still has a fractional perfect matching. For fractionaln-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.     

Some results on quasipolyhedral convexity

The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions, which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right scalar multiplication (including the case where λ=0⁺) and pointwise addition.