相关论文: Balanced 2-subsets

In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…

A family $\cF \subseteq 2^{[n]}$ saturates the monotone decreasing property $\cP$ if $\cF$ satisfies $\cP$ and one cannot add any set to $\cF$ such that property $\cP$ is still satisfied by the resulting family. We address the problem of…

We propose a computationally feasible way of deriving the identified features of models with multiple equilibria in pure or mixed strategies. It is shown that in the case of Shapley regular normal form games, the identified set is…

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…

We study the Subnormal Completion Problem (SCP) for 2-variable weighted shifts. We use tools and techniques from the theory of truncated moment problems to give a general strategy to solve SCP. We then show that when all quadratic moments…

We show how in PT-symmetric 2J-level quantum systems the assumption of an upside-down symmetry (or duality) of their spectra simplifies their classification based on the non-equivalent pairwise mergers of the energy levels.

We construct an open set of structurally unstable three parameter families whose weak and so called moderate topological classification defined below has a numerical invariant that may take an arbitrary positive value. Here and below…

In this article, we explore the combinatorics of balanced collections. A collection of subsets of the set $[n] = \{1, \dots, n\}$ is called \emph{balanced} if the relative interior of the convex hull of the corresponding characteristic…

Pregroup grammars were developed in 1999 and stayed Lambek's preferred algebraic model of grammar. The set-theoretic semantics of pregroups, however, faces an ambiguity problem. In his latest book, Lambek suggests that this problem might be…

We consider the unsupervised learning problem of assigning labels to unlabeled data. A naive approach is to use clustering methods, but this works well only when data is properly clustered and each cluster corresponds to an underlying…

We present equivalent formulations for concepts related to set families for which every subfamily with empty intersection has a bounded sub-collection with empty intersection. Hereby, we summarize the progress on the related questions about…

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

A subgroup H of G=(Z/dZ)^* is called balanced if every coset of H is evenly distributed between the lower and upper halves of G, i.e., has equal numbers of elements with representatives in (0,d/2) and (d/2,d). This notion has applications…

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid's conjecture using arithmetic arguments. No constructive proof has been found since. In this…

A new family of Gaussian-type SIGMA basis sets, termed reduced SIGMA basis sets, is introduced and preliminarily tested. Sharing the same composition as Dunning basis sets, they enhance performance by reducing linear dependencies in large…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Given a poset $P$ we say a family $\mathcal{F}\subseteq P$ is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset $P$ is said to have the centeredness property if for any $M$, among all families of…

We give an introduction to the theory of 2-Segal sets, and two of the main applications of them: Hall algebras and a discrete version of Waldhausen's $S_\bullet$-construction. We present several combinatorial examples and how these…