Related papers: Muddy Waters
We present ColorFloat, a family of O(1) space complexity algorithms that solve the problem of attributing (coloring) fungible tokens to the entity that minted them (minter). Tagging fungible tokens with metadata is not a new problem and was…
In this paper a class of languages which are formal enough for mathematical reasoning is introduced. First-order formal languages containing natural numbers and numerals belong to that class. Its languages are called mathematically…
Math anxiety is a highly prevalent problem in education that has consistently shown to lead to poor math performance. This study sought to investigate whether certain behaviours are predictive of math anxiety among students. This study…
Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of…
First proved my Donald Martin in 1975, the result of Borel determinacy has been the subject of multiple revised proofs. Following Martin's book [1], we present a recent streamlined proof which implements ideas of Martin, Moschovakis, and…
Meteorological forecasting provides reliable prediction about the future weather within a given interval of time. Meteorological forecasting can be viewed as a form of hybrid diagnostic reasoning and can be mapped onto an integrated…
In this paper, we propose standard statistical tools as a solution to commonly highlighted problems in the explainability literature. Indeed, leveraging statistical estimators allows for a proper definition of explanations, enabling…
Hedges are widely studied across registers and disciplines, yet research on the translation of hedges in political texts is extremely limited. This contrastive study is dedicated to investigating whether there is a diachronic change in the…
We present two novel six-colorings of the Euclidean plane that avoid monochromatic pairs of points at unit distance in five colors and monochromatic pairs at another specified distance $d$ in the sixth color. Such colorings have previously…
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires…
We address the problem of providing contextual information about a logical formula (eg provenance, date of validity, or confidence) and representing it within a logical system. In this case, it is needed to rely on a higher order or non…
For edge coloring, the online and the W-streaming models seem somewhat orthogonal: the former needs edges to be assigned colors immediately after insertion, typically without any space restrictions, while the latter limits memory to…
We study three variations of the Waring problem for polynomials, concerning the Waring rank, the border rank and the cactus rank of a form and we show how the Lefschetz properties of the associated algebra affect them. The main tool is the…
Explainable AI has brought transparency into complex ML blackboxes, enabling, in particular, to identify which features these models use for their predictions. So far, the question of explaining predictive uncertainty, i.e. why a model…
Humor is prevalent in online communications and it often relies on more than one modality (e.g., cartoons and memes). Interpreting humor in multimodal settings requires drawing on diverse types of knowledge, including metaphorical,…
There is a recent surge of interest in using attention as explanation of model predictions, with mixed evidence on whether attention can be used as such. While attention conveniently gives us one weight per input token and is easily…
A certain sampling process, concerning an urn with balls of two colors, proposed in 1965 by B.E. Oakley and R.L. Perry, and discussed by Peter Winkler and Martin Gardner, that has an extremely simple answer for the probability, namely the…
I describe a puzzle I wrote for the 2018 MIT Mystery Hunt which introduced new types of people in logic puzzles. I discuss the puzzle itself, the solution, and the mathematics behind it.
Collectively, machine learning (ML) researchers are engaged in the creation and dissemination of knowledge about data-driven algorithms. In a given paper, researchers might aspire to any subset of the following goals, among others: to…
Let $c$ be an edge-coloring of the complete $n$-vertex graph $K_n$. The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollob\'as and Erd\H os and has been extensively studied since then.…