Related papers: Ordinal Sums, Clockwise Hackenbush, and Domino Sha…
We have obtained explicit integral expressions for the sums of inverse powers of the eigenvalues of the Laplacian on a unit sphere, in presence of an arbitrary variable density. The exact expressions for the sum rules are obtained by…
We consider the recently introduced knotting-unknotting game, in which two players take turns resolving crossings in a knot diagram which initially is missing all its crossing information. Once the knot is fully resolved, the winner is…
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…
We reexamine the classical subset sum problem: given a set $X$ of $n$ positive integers and a number $t$, decide whether there exists a subset of $X$ that sums to $t$; or more generally, compute the set $\mbox{out}$ of all numbers…
We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target…
A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees…
In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph $H$ and a graph $G$ of an infinite set of independent vertices. In each round Builder draws an edge and Painter colors it either red…
We perform a systematic study of $SU(2)$ flavor amplitude sum rules with particular emphasis on $U$-spin. This study reveals a rich mathematical structure underlying the sum rules that allows us to formulate an algorithm for deriving all…
We derive spectral sum rules for inverse powers of the eigenvalues of the Helmholtz equation on a $d$-sphere in the presence of an arbitrary density. By adopting a rigorous renormalization scheme, we remove the divergent contributions of…
The exact distribution of the square sum of Dirichlet random variables is given by two different univariate integral representations. Alternatively, three representations by orthogonal series with Jacobi or Legendre polynomials are derived.…
We provide an algorithm to solve Rabin and Streett games over graphs with $n$ vertices, $m$ edges, and $k$ colours that runs in $\tilde{O}\left(mn(k!)^{1+o(1)} \right)$ time and $O(nk\log k \log n)$ space, where $\tilde{O}$ hides…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
We define real origami (that is, origami equipped with a real structure) and enumerate them using the combinatorics of zonal polynomials. We explicitly express in terms of sums of divisors the numbers of genus 2 real origami with 2 simple…
In this paper, a sum rule means a relationship between a functional defined on a subset of all probability measures on $\mathbb{R}$ involving the reverse Kullback-Leibler divergence with respect to a particular distribution and recursion…