Related papers: A Gale-Berlekamp permutation-switching problem in …
Let $a_1, ..., a_s$ be positive integers. For a graph $G$ the expression $$ G \overset{v}{\rightarrow} (a_1, ..., a_s) $$ means that for every coloring of the vertices of $G$ in $s$ colors ($s$-coloring) there exists $i \in \{1, ..., s\}$,…
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…
We give a bijection between permutations of length 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from a set of 2n items: the permutation encodes…
We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…
There are many ways of establishing upper bounds on fluctuations of random variables, but there is no systematic approach for lower bounds. As a result, lower bounds are unknown in many important problems. This paper introduces a general…
A nonparametric variant of the Kiefer--Weiss problem is proposed and investigated. In analogy to the classical Kiefer--Weiss problem, the objective is to minimize the maximum expected sample size of a sequential test. However, instead of…
A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…
We study Landau-Zener interband transitions for a non-symmetric optical lattice in the presence of an external force. We show that gain and losses of the light beam, as well as the relative occupation probabilities of the bands involved in…
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
We give an elementary inductive proof of a classical result for the \emph{Lights Out problem} on graphs: from any configuration of vertices, one can reach the complementary configuration by a sequence of moves, where a move consists of…
The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for the sign change counting function is given where classical…
An iterative finite difference scheme for mean field games (MFGs) is proposed. The target MFGs are derived from control problems for multidimensional systems with advection terms. For such MFGs, linearization using the Cole-Hopf…
Light crossing dark domain walls that source a top form coupled to gauge Chern--Simons terms mixing visible and dark $U(1)$ gauge fields generically converts into dark photons. The effect is entirely localized on the wall and requires no…
This paper proposes a new algorithm deciding the star height problem. As shown by Kirsten, the star height problem reduces to a problem concerning automata with counters, called limitedness. The new contribution is a different algorithm for…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…
Infinitely repeated games can support cooperative outcomes that are not equilibria in the one-shot game. The idea is to make sure that any gains from deviating will be offset by retaliation in future rounds. However, this model of…
Using a switching operation on tournaments we obtain some new lower bounds on the Tur\'{a}n number of the $r$-graph on $r+1$ vertices with $3$ edges. For $r=4$, extremal examples were constructed using Paley tournaments in previous work. We…
We emphasize the dominance in the Monty Hall problem, both in the classical scenario and its multi-door generalization. This is used to show optimality of the class of always-switching strategies for nonuniform allocation of the prize and…