Related papers: Enumerating (multiplex) juggling sequences
The paper aims at giving an introduction to the notion of quantum curves. The main purpose is to describe the new discovery of the relation between the following two disparate subjects: one is the topological recursion, that has its origin…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
This paper addresses the problem of scheduling a set of jobs that are released over the time on a set of identical parallel machines, aiming at the minimization of the total weighted completion time. This problem, referred to as $P|r_j|\sum…
Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is…
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…
Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
We address the observability problem for ensembles that are described by probability distributions. The problem is to reconstruct a probability distribution of the initial state from the time-evolution of the probability distribution of the…
Given a sequence A of 2n real numbers, the Even-Rank-Sum problem asks for the sum of the n values that are at the even positions in the sorted order of the elements in A. We prove that, in the algebraic computation-tree model, this problem…
A ring $R$ is periodic provided that for any $a\ in R$ there exist distinct elements $m,n \in {\Bbb N}$ such that $a^m=a^n$. We shall prove that periodicity is inherited by a type of generalized matrix rings.We define strongly periodic…
In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic…
The distributed matrix multiplication problem with an unknown number of stragglers is considered, where the goal is to efficiently and flexibly obtain the product of two massive matrices by distributing the computation across N servers.…
Multiplicities of periodic orbit lengths for non-arithmetic Hecke triangle groups are discussed. It is demonstrated both numerically and analytically that at least for certain groups the mean multiplicity of periodic orbits with exactly the…
Sequential sampling models (SSMs) are a widely used framework describing decision-making as a stochastic, dynamic process of evidence accumulation. SSMs popularity across cognitive science has driven the development of various software…
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences,…
We study the following synchronous process that we call "repeated balls-into-bins". The process is started by assigning $n$ balls to $n$ bins in an arbitrary way. In every subsequent round, from each non-empty bin one ball is chosen…
We study the collective schedules problem, which consists in computing a one machine schedule of a set of tasks, knowing that a set of individuals (also called voters) have preferences regarding the order of the execution of the tasks. Our…
For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if $\gamma$ is eventually linearly…
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…