These notes are dedicated to the study of the complexity of several classes of separable Banach spaces. We compute the complexity of the Banach-Saks property, the alternating Banach-Saks property, the complete continuous property, and the LUST property. We also show that the weak Banach-Saks property, the Schur property, the Dunford-Pettis property, the analytic Radon-Nikodym property, the set of Banach spaces whose set of unconditionally converging operators is complemented in its bounded operators, the set of Banach spaces whose set of weakly compact operators is complemented in its bounded operators, and the set of Banach spaces whose set of Banach-Saks operators is complemented in its bounded operators, are all non Borel in ${\rm SB}$. At last, we give several applications of those results to non-universality results.
In the Shapley-Scarf economy each agent is endowed with one unit of an indivisible good (house) and wants to exchange it for another, possibly the most preferred one among the houses in the market. In this economy, core is always nonempty and a core allocation can be found by the famous Top Trading Cycles algorithm. Recently, a modification of this economy, containing Q >= 2 types of goods (say, houses and cars for Q=2) has been introduced. We show that if the number of agents is 2, a complete description of the core can be found efficiently. However, when the number of agents is not restricted, the problem to decide the nonemptyness of the core becomes NP-hard already in the case of two types of goods. We also show that even the problem to decide whether an allocation exists in which each agent strictly improves compared to his endowment, is NP-complete.
Let $G$ be a finite group. The prime graph of $G$ is a graph whose vertex set is the set of prime divisors of $|G|$ and two distinct primes $p$ and $q$ are joined by an edge, whenever $G$ contains an element of order $pq$. The prime graph of $G$ is denoted by $\Gamma (G)$. It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if $G$ is a finite group such that $\Gamma (G)=\Gamma (B_{n}(5))$, where $n\geq 6$, then $G$ has a unique nonabelian composition factor isomorphic to $B_{n}(5)$ or $C_{n}(5)$.
The compound Poisson-gamma variable is the sum of a random sample from a gamma distribution with sample size an independent Poisson random variable. It has received wide ranging applications. In this note, we give an account of its mathematical properties including estimation procedures by the methods of moments and maximum likelihood. Most of the properties given are hitherto unknown.
Vine copulas are a flexible way for modeling dependences using only pair-copulas as building blocks. However if the number of variables grows the problem gets fastly intractable. For dealing with this problem Brechmann at al. proposed the truncated R-vine copulas. The truncated R-vine copula has the very useful property that it can be constructed by using only pair-copulas and a lower number of conditional pair-copulas. In our earlier papers we introduced the concept of cherry-tree copulas. In this paper we characterize the relation between cherry-tree copulas and truncated R-vine copulas. It turns out that the concept of cherry-tree copula is more general than the concept of truncated R-vine copula. Although both contain in their expressions conditional independences between the variables, the truncated R-vines constructed in greedy way do not exploit the existing conditional independences in the data. We give a necessary and sufficient condition for a cherry-tree copula to be a truncated R-vine copula. We introduce a new method for truncated R-vine modeling. The new idea is that in the first step we construct the top tree by exploiting conditional independences for finding a good-fitting cherry-tree of order k. If this top tree is a tree in an R-vine structure then this will define a truncated R-vine at level k and in the second step we construct a sequence of trees which leads to it. If this top tree is not a tree in an R-vine structure then we can transform it into such a tree at level k+1 and then we can again apply the second step. The second step is performed by a backward construction named Backward Algorithm. This way the cherry-tree copulas always can be expressed by pair-copulas and conditional pair-copulas.
In this note we show that 1-skeletons and 2-skeletons of n-pseudomanifolds with full boundary are (n+ 1)-connected graphs and n-connected 2-complexes, respectively. This generalizes previous results due to Barnette and Woon.
Recently, the topic of construction methods for triangular norms (triangular conorms), uninorms, nullnorms, etc. has been studied widely. In this paper, we propose construction methods for triangular norms (t-norms) and triangular conorms (t-conorms) on bounded lattices by using interior and closure operators, respectively. Thus, we obtain some proposed methods given by Ertuğrul, Karaçal, Mesiar [15] and Çaylı [8] as results. Also, we give some illustrative examples. Finally, we conclude that the introduced construction methods can not be generalized by induction to a modified ordinal sum for t-norms and t-conorms on bounded lattices.