Related papers: Counting polygon spaces, Boolean functions and maj…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
We consider inductive limits of weighted spaces of holomorphic functions in the unit ball of $\mathbb C^n$. The relationship between sets of uniqueness, weakly sufficient sets and sampling sets in these spaces is studied. In particular, the…
This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
The floor and ceiling functions appear often in mathematics and manipulating sums involving floors and ceilings is a subtle game. Fortunately, the well-known textbook Concrete Mathematics provides a nice introduction with a number of…
In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
Valuations, as additive functionals, allow various applications in Stochastic Geometry, yielding mean value formulas for specific random closed sets and processes of convex or polyconvex particles. In particular, valuations are especially…
In this work we cast the problem of binary classification in terms of estimating a partition on Bernoulli data. When the explanatory variables are all categorical, the problem can be modelled using the language of boolean functions. We…
The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…
We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are…
In this note we shall generalize the Stone duality between compact totally disconnected spaces and Boolean algebras to a duality between all complete non-Archimedean uniform spaces and Boolean algebras.
Two polygons $P,Q$ are code equivalent if there are billiard orbits $u,v$ which hit the same sequence of sides and such that the projections of the orbits are dense in the boundaries $\partial P, \partial Q$. Our main results show when code…
We introduce the notion of logical A-games for a fairly general class of algebras A of real truth-values. This concept generalizes the Boolean games of Harrenstein et al. as well as the recently defined Lukasiewicz games of Marchioni and…
This article concerns the resolution of impartial combinatorial games, and in particular games that can be split in sums of independent positions. We prove that in order to compute the outcome of a sum of independent positions, it is always…
Members of a shareholder meeting or legislative committee have greater or smaller voting power than meets the eye if the nucleolus of the induced majority game differs from the voting weight distribution. We establish a new sufficient…
We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame-property. Using these games,…
We give two examples where symmetric polynomials play an important role in physics: First, the partition functions of ideal quantum gases are closely related to certain symmetric polynomials, and a part of the corresponding theory has a…