Related papers: Arhangelskii's $\alpha$-principles and selection g…
We consider the class of algebras of rank 4 equipped with a standard involution over an arbitrary base ring. In particular, we characterize quaternion rings, those algebras defined by the construction of the even Clifford algebra.
When can a majority of voters find common ground, that is, a position they all agree upon? How does the shape of the political spectrum influence the outcome? When mathematical objects have a social interpretation, the associated theorems…
We continue to explore the ways in which high-level topological connections arise from connections between fundamental features of the spaces, in this case focusing on star-selection principles in Pixley-Roy hyperspaces and uniform spaces.…
Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…
In this paper, in the line of Aytar\cite{Ay2} and \c{C}olak \cite{Co}, we introduce the notion of rough statistical convergence of order $\alpha$ in normed linear spaces and study some properties of the set of all rough statistical limit…
By using Sulanke-Xin continued fractions method, Xin proposed a recursion system to solve the Somos 4 Hankel determinant conjecture. We find Xin's recursion system indeed give a sufficient condition for $(\alpha, \beta)$ Somos $4$…
We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed…
Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…
Bayesian probability theory is used to analyze the oft-made assumption that humans are typical observers in the universe. Some theoretical calculations make the {\it selection fallacy} that we are randomly chosen from a class of objects by…
We derive some equalities for relations on the algebra A, under the assumption that every subalgebra of A $\times$ A is congruence modular.
The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…
We consider four properties of a field $K$ related to the existence of (definable) henselian valuations on $K$ and on elementarily equivalent fields, and study the implications between them. Surprisingly, the full pictures look very…
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
Suppose that $n$ computer devices are to be connected to a network via inhomogeneous Bernoulli trials. The Shapley value of a device quantifies how much the network's value increases due to the participation of that device. Characteristic…
We explain how to deduce the degenerate analogue of Ariki's categorification theorem over the ground field C as an application of Schur-Weyl duality for higher levels and the Kazhdan-Lusztig conjecture in finite type A. We also discuss some…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…
Originally introduced in cooperative game theory, Shapley values have become a very popular tool to explain machine learning predictions. Based on Shapley's fairness axioms, every input (feature component) gets a credit how it contributes…