Topological games and continuity of group operations

We consider a topological game GΠ involving two players α and β and show that, for a paratopological group, the absence of a winning strategy for player β implies the group is a topological one. We provide a large class of topological spaces X for which the absence of a winning strategy for player β is equivalent to the requirement that X is a Baire space. This allows to extend the class of paratopological or semitopological groups for which one can prove that they are, actually, topological groups.Conditions of the type “existence of a winning strategy for the player α” or “absence of a winning strategy for the player β” are frequently used in mathematics. Though convenient and satisfactory for theoretical considerations, such conditions do not reveal much about the internal structure of the topological space where they hold. We show that the existence of a winning strategy for any of the players in all games of Banach-Mazur type can be expressed in terms of “saturated sieves” of open sets.     

An algorithm for the difference between set covers

A set cover for a set S is a collection C of special subsets whose union is S. Given covers A and B for two sets, the set-cover difference problem is to construct a new cover for the elements covered by A but not B. Applications include testing equivalence of set covers and maintaining a set cover dynamically. In this paper, we solve the set-cover difference problem by defining a difference operation A-B, which turns out to be a pseudocomplement on a distributive lattice. We give an algorithm for constructing this difference, and show how to implement the algorithm for two examples with applications in computer science: face covers on a hypercube, and rectangle covers on a grid. We derive an upper bound on the time complexity of the algorithm, and give upper and lower bounds on complexity for face covers and rectangle covers.     

Das Anfangs-Randwertproblem eines dünnen Profils in kompressibler Unterschallströmung

Summary The initial boundary value problem of a thin profile in a compressible subsonic flow is investigated, being important for the gust problem. Existence and uniqueness of the solution are shown. By a generalizedWiener-Hopf-equation, the solution is reduced to the solution of a system of integro-differential equations for the downwashes in the profile plane. This system can be solved exactly by an iterative calculation of integrals for any value of timet>0. Finally, for smallt>0, the indicial-admittance function for vertical translation is found and is compared with a result given byLomax [6]. The asymptotic case for larget>0 will be investigated in a later paper.     

An upper bound for permanents of nonnegative matrices

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in lp is attained either for the identity matrix I or for a constant multiple of the all-1 matrix J.The conjecture is known to be true for p=1 (I) and for p?2 (J).We prove the conjecture for a subinterval of (1,2), and show the conjectured upper bound to be true within a subexponential factor (in the dimension) for all 1<p<2. In fact, for p bounded away from 1, the conjectured upper bound is true within a constant factor.     

A fast algorithm for coloring Meyniel graphs

We color the nodes of a graph by first applying successive contractions to non-adjacent nodes until we get a clique; then we color the clique and decontract the graph. We show that this algorithm provides a minimum coloring and a maximum clique for any Meyniel graph by using a simple rule for choosing which nodes are to be contracted. This O(n³) algorithm is much simpler than those already existing for Meyniel graphs. Moreover, the optimality of this algorithm for Meyniel graphs provides an alternate nice proof of the following result of Hoàng: a graph G is Meyniel if and only if, for any induced subgraph of G, each node belongs to a stable set that meets all maximal cliques. Finally we give a new characterization for Meyniel graphs.     

Infinite Matroidal Version of Hall's Matching Theorem

Hall's theorem for bipartite graphs gives a necessary and sufficientcondition for the existence of a matching in a given bipartitegraph. Aharoni and Ziv have generalized the notion of matchabilityto a pair of possibly infinite matroids on the same set andgiven a condition that is sufficient for the matchability ofa given pair (M, W) of finitary matroids, where the matroidM is SCF (a sum of countably many matroids of finite rank).The condition of Aharoni and Ziv is not necessary for matchability.The paper gives a condition that is necessary for the existenceof a matching for any pair of matroids (not necessarily finitary)and is sufficient for any pair (M, W) of finitary matroids,where the matroid M is SCF.     

Cores in random hypergraphs and Boolean formulas

We describe a technique for determining the thresholds for the appearance of cores in random structures. We use it to determine (i) the threshold for the appearance of a k‐core in a random r‐uniform hypergraph for all r, k ≥ 2, r + k > 4, and (ii) the threshold for the pure literal rule to find a satisfying assignment for a random instance of r‐SAT, r ≥ 3. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

A sphere in a second degree polynomial creeping flow parallel to a wall

Comprehensive results are provided for the creeping flow arounda spherical particle in a viscous fluid close to a plane wall,when the external velocity is parallel to the wall and variesas a second degree polynomial in the coordinates. By linearityof Stokes equations, the solution is a sum of flows for typicalunperturbed flows: a pure shear flow, a ‘modulated shearflow’, for which the rate of shear varies linearly inthe direction normal to the wall, and a quadratic flow. Solutionsconsidered here use the bipolar coordinates technique. Theycomplement the accurate results of Chaoui and Feuillebois (2003)for the pure shear flow. The solution of Goren and O'Neill (1971)for the quadratic flow is reconsidered and a new analyticalsolution is derived for the ambient modulated shear flow. Theperturbed flow fields for these two cases are presented in detailand discussed. Results for the force and torque friction factorsare provided with a 5 x 10^–17 accuracy as a reference.For the quadratic flow, there is a force and a torque on a fixedsphere. A minimum value of the torque is found for a gap ofabout 0·18a, where a is the sphere radius. This minimumis interpreted in term of the corresponding flow structure.For the modulated shear flow, there is only a torque. The freemotion of a sphere in an ambient quadratic flow is also determined.     

The evolution of invariant manifolds in Hamiltonian-Hopf bifurcations

We consider the evolution of the stable and unstable manifolds of an equilibrium point of a Hamiltonian system of two degrees of freedom which depends on a parameter, ν. The eigenvalues of the linearized system are complex for ν<0 and pure imaginary for ν>0. Thus, for ν<0 the equilibrium has a two-dimensional stable manifold and a two-dimensional unstable manifold, but for ν>0 these stable and unstable manifolds are gone. If the sign of a certain term in the normal form is positive then for small negative ν the stable and unstable manifolds of the system are either identical or must have transverse intersection. Thus, either the system is totally degenerate or the system admits a suspended Smale horseshoe as an invariant set.     

Near invariance and kernels of Toeplitz operators

This paper makes a systematic study of kernels of Toeplitz operators on scalar and vector-valued H _p spaces (for 1 < p < ∞). The property of near invariance of a kernel for the backward shift is analysed and shown to hold in increased generality. In the scalar case, and in some vectorial cases, the existence of a minimal kernel containing a given function is established, and a symbol for a corresponding Toeplitz operator is determined; thus, for rational symbols, its dimension can be easily calculated. It is shown that every Toeplitz kernel in H _p is the minimal kernel for some function lying in it.     

Weak solutions of the Vlasov–Poisson initial boundary value problem

This paper deals with existence results for a Vlasov-Poisson system, equipped with an absorbing-type law for the Vlasov equation and a Dirichlet-type boundary condition for the Poisson part. Using the ideas of Lions and Perthame [21], we prove the existence of a weak solution having good L^p estimates for moment and electric field, by a good control on the higher moments of the initial data. As an application, we establish a homogenization result in the Hilbertian framework for this type of problem in non-homogeneous media, following the work by Alexandre and Hamdache [2] for general kinetic equations, and Cioranescu and Mural [11] for the Laplace problem.     

Exhausters af a positively homogeneous function *

Notions of upper exhauster and lower exhauster of a positively homogeneous (of the first degree) function h: ? ⁿ →? are introduced. They are linked to exhaustive families of upper convex and lower concave approximations of the function h. The pair of an upper exhauster and a lower exhauster is called a biexhauster of h. A calculus for biexhausters is described (in particular, a composition theorem is formulated). The problem of minimality of exhausters is stated. Necessary and sufficient conditions for a constrained minimum and a constrained maximum of a directionally differentiable function f: ? ⁿ →? are formulated in terms of exhausters of the directional derivative of f. In general, they are described by means of exhausters of the Hadamard upper and lower directional derivatives of the function f. To formulate conditions for a minimum, an upper exhauster is employed while conditions for a maximum are formulated via a lower exhauster of the respective directional derivative (the Hadamard lower derivative for a minimum and the Hadamard upper derivative for a maximum).

If a point x _o is not stationary then directions of steepest ascent and descent can also be calculated by means of exhausters.     

Equivariant fixed-point indices of iterated maps

We describe an equivariant version (for actions of a finite group G) of Dold’s index theory, [10], for iterated maps. Equivariant Dold indices are defined, in general, for a G-map U → X defined on an open G-subset of a G-ANR X (and satisfying a suitable compactness condition). A local index for isolated fixed-points is introduced, and the theorem of Shub and Sullivan on the vanishing of all but finitely many Dold indices for a continuously differentiable map is extended to the equivariant case. Homotopy Dold indices, arising from the equivariant Reidemeister trace, are also considered.      

Complex Hadamard matrices

R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex Hadamard matrix of order c and a real Hadamard matrix of order h> > 1, then there is a real Hadamard matrix of order he. Previously, complex Hadamard matrices were only known for a few small orders and the orders for which symmetric conference matrices were known. These latter are known only to exist for orders which can be written as 1+a² +b² where a, b are integers. We give many constructions for new infinite classes of complex Hadamard matrices and show that they exist for orders 306,650, 870,1406,2450 and 3782: for the orders 650, 870, 2450 and 3782, a symmetric conference matrix cannot exist.     

Estimation of rating classes and default probabilities in credit risk models with dependencies

Let Y = m(X) + ε be a regression model with a dichotomous output Y and a one‐step regression function m . In the literature, estimators for the three parameters of m , that is, the breakpoint θ and the levels a and b , are proposed for independent and identically distributed (i.i.d.) observations. We show that these standard estimators also work in a non‐i.i.d. framework, that is, that they are strongly consistent under mild conditions. For that purpose, we use a linear one‐factor model for the input X and a Bernoulli mixture model for the output Y . The estimators for the split point and the risk levels are applied to a problem arising in credit rating systems. In particular, we divide the range of individuals' creditworthiness into two groups. The first group has a higher probability of default and the second group has a lower one. We also stress connections between the standard estimator for the cutoff θ and concepts prevalent in credit risk modeling, for example, receiver operating characteristic. Copyright © 2014 John Wiley & Sons, Ltd.     

The Logical vs. the Ontological Understanding of Conditions

According to the truth-functional analysis of conditions, to be ‘necessary for’ and ‘sufficient for’ are converse relations. From this, it follows that to be ‘necessary and sufficient for’ is a symmetric relation, that is, that if P is a necessary and sufficient condition for Q, then Q is a necessary and sufficient condition for P. This view is contrary to common sense. In this paper, I point out that it is also contrary to a widely accepted ontological view of conditions, according to which if P is a necessary and sufficient condition for Q, then Q is in no sense a condition for P; it is a mere consequence of P.     

Tensor factorization and Spin construction for Kac-Moody algebras

In this paper we discuss the “Factorization phenomenon” which occurs when a representation of a Lie algebra is restricted to a subalgebra, and the result factors into a tensor product of smaller representations of the subalgebra. We analyze this phenomenon for symmetrizable Kac-Moody algebras (including finite-dimensional, semi-simple Lie algebras). We present a few factorization results for a general embedding of a symmetrizable Kac-Moody algebra into another and provide an algebraic explanation for such a phenomenon using Spin construction. We also give some application of these results for semi-simple, finite-dimensional Lie algebras.We extend the notion of Spin functor from finite-dimensional to symmetrizable Kac-Moody algebras, which requires a very delicate treatment. We introduce a certain category of orthogonal g-representations for which, surprisingly, the Spin functor gives a g-representation in Bernstein-Gelfand-Gelfand category O. Also, for an integrable representation, Spin produces an integrable representation. We give the formula for the character of Spin representation for the above category and work out the factorization results for an embedding of a finite-dimensional, semi-simple Lie algebra into its untwisted affine Lie algebra. Finally, we discuss the classification of those representations for which Spin is irreducible.     

Mixed multiplicities and the minimal number of generator of modules

Let (R,m) be a d-dimensional Noetherian local ring. In this work we prove that the mixed Buchsbaum-Rim multiplicity for a finite family of R-submodules of R^p of finite colength coincides with the Buchsbaum-Rim multiplicity of the module generated by a suitable superficial sequence, that is, we generalize for modules the well-known Risler-Teissier theorem. As a consequence, we give a new proof of a generalization for modules of the fundamental Rees’ mixed multiplicity theorem, which was first proved by Kirby and Rees in (1994, [8]). We use the above result to give an upper bound for the minimal number of generators of a finite colength R-submodule of R^p in terms of mixed multiplicities for modules, which generalize a similar bound obtained by Cruz and Verma in (2000, [5]) for m-primary ideals.     

Ramsey Functions for Quasi-Progressions

 A quasi-progression of diameter n is a finite sequence for which there exists a positive integer L such that for . Let be the least positive integer such that every 2-coloring of will contain a monochromatic k-term quasi-progression of diameter n. We give a lower bound for in terms of k and i that holds for all . Upper bounds are obtained for in all cases for which . In particular, we show that . Exact formulae are found for and . We include a table of computer-generated values of , and make several conjectures. Received: September 22, 1995 / Revised: February 28, 1997     

Genus polynomials and crosscap‐number polynomials for ring‐like graphs

An H‐linear graph is obtained by transforming a collection of copies of a fixed graph H into a chain. An H‐ring‐like graph is formed by binding the two end‐copies of H in such a chain to each other. Genus polynomials have been calculated for bindings of several kinds. In this paper, we substantially generalize the rules for constructing sequences of H‐ring‐like graphs from sequences of H‐linear graphs, and we give a general method for obtaining a recursion for the genus polynomials of the graphs in a sequence of ring‐like graphs. We use Chebyshev polynomials to obtain explicit formulas for the genus polynomials of several such sequences. We also give methods for obtaining recursions for partial genus polynomials and for crosscap‐number polynomials of a bar‐ring of a sequence of disjoint graphs.