Related papers: On the Lottery Problem: Tracing Stefan Mandel's Co…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system tournament. Matches of these tournaments are usually…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…
A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) characterized score sequences of the complete graph. Moon (1963)…
In Problem #1542 of Mathematics Magazine, Grossman and Turett define the Cantor game. In his 2007 Mathematics Magazine article about the Cantor game, Matt Baker proves several results and poses three challenging questions about it: Do there…
We give conjectures on the form of families of integer sequences whose Hankel transforms are, respectively, $(\alpha, \beta)$ Somos $4$ sequences, $(\alpha, 0, \gamma)$ Somos $6$ sequences, and $(\alpha, \beta, \gamma, \delta)$ Somos $8$…
Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…
In J. Schwenk.(2018) ['What is the Correct Way to Seed a Knockout Tournament?' Retrieved from The American Mathematical Monthly], Schwenk identified a surprising weakness in the standard method of seeding a single elimination (or knockout)…
In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…
We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose…
Consumers often face products sold as lotteries rather than fixed outcomes. A prominent case is the loot box in video games, where players pay for randomized rewards. We investigate how presentation formats shape consumer beliefs and…
In this paper, we study contention resolution schemes for matchings. Given a fractional matching $x$ and a random set $R(x)$ where each edge $e$ appears independently with probability $x_e$, we want to select a matching $M \subseteq R(x)$…
The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…
To reduce computational complexity and delay in randomized network coded content distribution (and for some other practical reasons), coding is not performed simultaneously over all content blocks but over much smaller subsets known as…
We prove results concerning the representation of a given distribution by means of a given random quantity. The existence of a solution to this problem is related to the notion of conglomerability, originally introduced by Dubins to study…
This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
Alt's problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial…
This study replicates and adapts the experiment of Hoelzl and Rustichini (2005), which examined overplacement, i.e., overconfidence in relative self-assessments, by analyzing individuals' voting preferences between a performance-based and a…