Related papers: Counting polygon spaces, Boolean functions and maj…

We define a random step size tug-of-war game, and show that the gradient of a value function exists almost everywhere. We also prove that the gradients of value functions are uniformly bounded and converge weakly to the gradient of the…

In this paper we study the class of so called `ball-bodies' in ${\mathbb R}^n$, given by intersections of translates of Euclidean unit balls (or, equivalently, summand of the Euclidean ball). We study the class along with the natural…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

In the setting of the Euclidean space equipped with an arbitrary Radon measure, we prove the equivalence between several notions of function of bounded variation present in the literature. We also study the relation between various…

The strict relation between some class of multiboson hamiltonian systems and the corresponding class of orthogonal polynomials is established. The correspondence is used effectively to integrate the systems. As an explicit example we…

This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to address several challenging problems in statistical…

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…

This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…

Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful…

Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted voting, where each agent is assigned a weight. Here a proposal is…

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the…

We consider weighted sums of independent random variables regulated by an increment sequence. We provide operative conditions that ensure strong law of large numbers for such sums to hold in both the centered and non-centered case. The…

The additive energy plays a central role in combinatorial number theory. We show an uncertainty inequality which indicates how the additive energy of support of a Boolean function, its degree and subcube partition are related.

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…

We study continuous, symmetric and unanimous aggregation functions and continuous majority functions and prove that such functions exist on a choice space if and only if the choice space is contractible.

Given a set of n balls each colored with a color, a ball is said to be majority, k-majority, plurality if its color class has size larger than half of the number of balls, has size at least k, has size larger than any other color class;…

We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal…