Related papers: Extending Sicherman Dice to 100-cell Calculation T…

We consider the problem of enumerating periodic $\sigma$-juggling sequences of length $n$ for multiplex juggling, where $\sigma$ is the initial state (or {\em landing schedule}) of the balls. We first show that this problem is equivalent to…

We present two recursive strategy improvement algorithms for solving simple stochastic games. First we present an algorithm for solving SSGs of degree $d$ that uses at most $O\left(\left\lfloor(d+1)^2/2\right\rfloor^{n/2}\right)$…

The Bellman equation and its continuous-time counterpart, the Hamilton-Jacobi-Bellman (HJB) equation, serve as necessary conditions for optimality in reinforcement learning and optimal control. While the value function is known to be the…

Let $S_{\rm lcm}(n)$ denote the set of permutations $\pi$ of $[n]=\{1,2,\dots,n\}$ such that ${\rm lcm}[j,\pi(j)]\le n$ for each $j\in[n]$. Further, let $S_{\rm div}(n)$ denote the number of permutations $\pi$ of $[n]$ such that…

Based on empirical evidence obtained using the {\sf CHEVIE} computer algebra system, we present a series of conjectures concerning the combinatorial description of the Kazhdan--Lusztig cells for type $B_n$ with unequal parameters. These…

We study the problem of instance segmentation in biological images with crowded and compact cells. We formulate this task as an integer program where variables correspond to cells and constraints enforce that cells do not overlap. To solve…

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

A new deterministic, numerical method to solve fermion field theories is presented. This approach is based on finding solutions $Z[J]$ to the lattice functional equations for field theories in the presence of an external source $J$. Using…

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…

We complete the Lie symmetry classification of scalar nth order, $n \geq 4$, ordinary differential equations by means of the symmetry Lie algebras they admit. It is known that there are three types of such equations depending upon the…

A nilpotent Lie algebra n_{n,1} with an (n-1) dimensional Abelian ideal is studied. All indecomposable solvable Lie algebras with n_{n,1} as their nilradical are obtained. Their dimension is at most n+2. The generalized Casimir invariants…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

For $n\ge 5$, we prove that every $n\times n$ matrix $M=(a_{i,j})$ with entries in $\{-1,1\}$ and absolute discrepancy $|\mathrm{disc}(M)|=|\sum a_{i,j}|\le n$ contains a zero-sum square except for the split matrix (up to symmetries). Here,…

We continue the exploration of a question of dice relabeling posed by Gallian and Rusin: Given $n$ dice, each labeled 1 through $m$, how many ways are there to relabel the dice without changing the frequencies of the possible sums? We…

We explain how the theory of sandwich cellular algebras can be seen as a version of cell theory for algebras. We apply this theory to many examples such as Hecke algebras, and various monoid and diagram algebras.

In this paper a small survey is presented on fourteen sequences, such as: G Add-on Sequences, Sieve Sequences, Digital Sequences, Non-Arithmetic Progressions, recreational sequences (Lucky…

Let $B$ be a Poisson algebra $\Bbb C[x_1,\ldots, x_k]$ with Poisson bracket such that $$\{x_j,x_i\}=c_{ji}x_ix_j+p_{ji}$$ for all $j>i$, where $c_{ji}\in\Bbb C$ and $p_{ji}\in\Bbb C[x_1,\ldots,x_i]$. Here we obtain an iterated skew…

In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $\Delta(n)$ is obtained. $\Delta(n)$ is…

For an integer $b\geq 2$, a positive integer is called a $b$-Niven number if it is a multiple of the sum of the digits in its base-$b$ representation. In this article, we show that every arithmetic progression contains infinitely many…