A bargaining set for monotonic simple games based on external and internal stability

A new bargaining set based on notions of both internal and external stability is developed in the context of endogenous coalition formation. It allows to make an explicit distinction between within-group and outside-group deviation options. This type of distinction is not present in current bargaining sets. For the class of monotonic proper simple games, the outcomes in the bargaining set are characterized. Furthermore, it is shown that the bargaining set of any homogeneous weighted majority game contains an outcome for which the underlying coalition structure consists of a minimal winning coalition and its complement.

Coalitional Games and Contracts Based on Individual Deviations

We study what coalitions form and how the members of each coalition split the coalition value in coalitional games in which only individual deviations are allowed. In this context we employ three stability notions: individual, contractual, and compensational stability. These notions differ in terms of the underlying contractual assumptions. We characterize the coalitional games in which individually stable outcomes exist by means of the top-partition property. Furthermore, we show that any coalition structure of maximum social worth is both contractually and compensationally stable.

Two-dimensional Banach spaces with polynomial numerical index zero

We study two-dimensional Banach spaces with polynomial numerical indices equal to zero.

Comparing skew Schur functions: a quasisymmetric perspective

Reiner, Shaw and van Willigenburg showed that if two skew Schur functions sA and sB are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that sA and sB have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true. In fact, we work in terms of inequalities, showing that if the F-support of sA contains that of sB, then the row overlap partitions of A are dominated by those of B, and again conjecture that the converse also holds. Our evidence in favor of these conjectures includes their consistency with a complete determination of all F-support containment relations for F-multiplicity-free skew Schur functions. We conclude with a consideration of how some other quasisymmetric bases fit into our framework.

Lattice-free models of cell invasion : discrete simulations and travelling waves

Invasion waves of cells play an important role in development, disease and repair. Standard discrete models of such processes typically involve simulating cell motility, cell proliferation and cell-to-cell crowding effects in a lattice-based framework. The continuum-limit description is often given by a reaction–diffusion equation that is related to the Fisher–Kolmogorov equation. One of the limitations of a standard lattice-based approach is that real cells move and proliferate in continuous space and are not restricted to a predefined lattice structure. We present a lattice-free model of cell motility and proliferation, with cell-to-cell crowding effects, and we use the model to replicate invasion wave-type behaviour. The continuum-limit description of the discrete model is a reaction–diffusion equation with a proliferation term that is different from lattice-based models. Comparing lattice based and lattice-free simulations indicates that both models lead to invasion fronts that are similar at the leading edge, where the cell density is low. Conversely, the two models make different predictions in the high density region of the domain, well behind the leading edge. We analyse the continuum-limit description of the lattice based and lattice-free models to show that both give rise to invasion wave type solutions that move with the same speed but have very different shapes. We explore the significance of these differences by calibrating the parameters in the standard Fisher–Kolmogorov equation using data from the lattice-free model. We conclude that estimating parameters using this kind of standard procedure can produce misleading results.

On Additive Combinatorics of Permutations of Z(n)

Let Z(n) denote the ring of integers modulo n. A permutation of Z(n) is a sequence of n distinct elements of Z(n). Addition and subtraction of two permutations is defined element-wise. In this paper we consider two extremal problems on permutations of Z(n), namely, the maximum size of a collection of permutations such that the sum of any two distinct permutations in the collection is again a permutation, and the maximum size of a collection of permutations such that no sum of two distinct permutations in the collection is a permutation. Let the sizes be denoted by s (n) and t (n) respectively. The case when n is even is trivial in both the cases, with s (n) = 1 and t (n) = n!. For n odd, we prove (n phi(n))/2(k) <= s(n) <= n!.2(-)(n-1)/2/((n-1)/2)! and 2 (n-1)/2 . (n-1/2)! <= t (n) <= 2(k) . (n-1)!/phi(n), where k is the number of distinct prime divisors of n and phi is the Euler's totient function.

Peirce's mathematical-logical approach to discrete collections and the premonition of continuity

According to Peirce one of the most important philosophical problems is continuity. Consequently, he set forth an innovative and peculiar approach in order to elucidate at once its mathematical and metaphysical challenges through proper non-classical logical reasoning. I will restrain my argument to the definition of the different types of discrete collections according to Peirce, with a special regard to the phenomenon called premonition of continuity (Peirce, 1976, Vol. 3, p. 87, c. 1897). © 2012 Copyright Taylor and Francis Group, LLC.

About Learning Discrete Mathematics at Bulgarian School

The present work is dedicated to the learning discrete mathematics at Bulgarian school. A review of syllabuses and standards has been made. A project of learning discrete mathematics elements from first to twelve class is proposed.