相关论文: Ideal games and Ramsey sets

We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

Let ${\bf x}=(x_n)_n$ be a sequence in a Banach space. A set $A\subseteq \mathbb{N}$ is perfectly bounded, if there is $M$ such that $\|\sum_{n\in F}x_n\|\leq M$ for every finite $F\subseteq A$. The collection $B({\bf x})$ of all perfectly…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…

We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and…

We say that a 0-1 matrix $N$ of size $a\times b$ can be found in a collection of sets $\mathcal{H}$ if we can find sets $H_{1}, H_{2}, \dots, H_{a}$ in $\mathcal{H}$ and elements $e_1, e_2, \dots, e_b$ in $\cup_{H \in \mathcal{H}} H$ such…

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…

Let $R$ be a commutative ring with identity. In this note, we study the property: If $ I \subsetneqq J$ are ideals in $R$, then $ I^n \subsetneqq J^n$ for all $ n\geq 1$. We define the notion of a big ideal (Definition 1.2). It is noted…

Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…

Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and the natural extension…

A subset $S$ of a cardinal $\kappa$ is Ramsey if for every function $f:[S]^{<\omega}\to \kappa$ with $f(a)<\min a$ for all $a\in[S]^{<\omega}$, there is a set $H\subseteq S$ of cardinality $\kappa$ which is \emph{homogeneous} for $f$,…

We introduce an enumeration-free method based on mathematical programming to precisely characterize various properties such as fairness or sparsity within the set of "good models", known as Rashomon set. This approach is generically…

The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables)…

The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…

We prove a recent conjecture of Duch\^ene and Rigo, stating that every complementary pair of homogeneous Beatty sequences represents the solution to an \emph{invariant} impartial game. Here invariance means that each available move in a…

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

For a number of important mean field games models, the Hamiltonian is non-local and not additively separable. This means that the distribution of agents appears in the Hamiltonian only in an integral over the whole spatial domain. For mean…

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

We study families of infinite block sequences of elements of the space $\FIN_k$. In particular we study Ramsey properties of such families and Ramsey properties localized to a selective or semiselective coideal. We show how the stable…