Related papers: Selection principles and proofs from the Book
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…
There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct…
The article deals with a simplified proof of the Sobolev embedding theorem for Lizorkin--Triebel spaces (that contain the $L_p$-Sobolev spaces $H^s_p$ as special cases). The method extends to a proof of the corresponding fact for general…
This paper deals with the Peskine version of Zariski Main Theorem published in 1965 and discusses some applications. It is written in the style of Bishop's constructive mathematics. Being constructive, each proof in this paper can be…
We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data reduction rules for a parameterized problem having (a). a…
In this paper, I model and study the process of natural selection between all possible mixed strategies in classical two-player two-strategy games. I derive and solve an equation that is a natural generalization of the Taylor-Jonker…
We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to…
In this dissertation, we show that the Central Limit Theorem and the Invariance Principle for Discrete Fourier Transforms discovered by Peligrad and Wu can be extended to the quenched setting. We show that the random normalization…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…
We obtain general inequalities constraining the difference between the average of an arbitrary function of a phenotypic trait, which includes the fitness landscape of the trait itself, in the presence or in the absence of natural selection.…
Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…
Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…
We introduces a general linear framework that unifies the study of multi-winner voting rules and proportionality axioms, demonstrating that many prominent multi-winner voting rules-including Thiele methods, their sequential variants, and…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…