30,008 research outputs found
Some Bounds for the Number of Blocks III
Let be a pair of point set and
a set consists of point subsets of which are called
blocks. Let be the maximal cardinality of the intersections between the
distinct two blocks in . The triple is called the
parameter of . Let be the number of the blocks in .
It is shown that inequality
holds for each satisfying , in the paper: Some Bounds for
the Number of Blocks, Europ. J. Combinatorics 22 (2001), 91--94, by R. Noda. If
achieves the upper bound, is called a design. In
the paper, an upper bound and a lower bound, , for of a design are
given. In the present paper we consider the cases when does not achieve the
upper bound or lower bound given above, and get new more strict bounds for
respectively. We apply this bound to the problem of the perfect -codes in
the Johnson scheme, and improve the bound given by Roos in 1983.Comment: Stylistic corrections are made. References are adde
On the number of blocks required to access the core
For any transferable utility game in coalitional form with nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is less than or equal to n(n-1)/2, where n is the cardinality of the player set. This number considerably improves the upper bounds found so far by Koczy (2006) and Yang (2010). Our result relies on an altered version of the procedure proposed by Sengupta and Sengupta (1996). The use of the Davis-Maschler reduced-games is also pointed out.Core; excess function; dominance path; Davis-Maschler reduced-game
The Core Can Be Accessed with a Bounded Number of Blocks
We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.core, indirect dominance
The Core Can Be Accessed with a Bounded Number of Blocks
We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blocks.mathematical economics;
On the number of blocks required to access the coalition structure core
This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).coalition structure core; excess function; payoff configuration; outsider independent domination.
Constrained exchangeable partitions
For a class of random partitions of an infinite set a de Finetti-type
representation is derived, and in one special case a central limit theorem for
the number of blocks is shown
Deviations from the mean field predictions for the phase behaviour of random copolymers melts
We investigate the phase behaviour of random copolymers melts via large scale
Monte Carlo simulations. We observe macrophase separation into A and B--rich
phases as predicted by mean field theory only for systems with a very large
correlation lambda of blocks along the polymer chains, far away from the
Lifshitz point. For smaller values of lambda, we find that a locally
segregated, disordered microemulsion--like structure gradually forms as the
temperature decreases. As we increase the number of blocks in the polymers, the
region of macrophase separation further shrinks. The results of our Monte Carlo
simulation are in agreement with a Ginzburg criterium, which suggests that mean
field theory becomes worse as the number of blocks in polymers increases.Comment: 6 pages, 4 figures, Late
- …