Related papers: Synchronization and separation in the Johnson sche…
In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…
Synchronization resulting in unified collective behavior of the individual elements of a system that are weakly coupled to each other has long fascinated scientists. Examples range from the periodic oscillation of coupled pendulum clocks to…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…
For a compact and convex window, Mecke described a process of tessellations which arise from cell divisions in discrete time. At each time step, one of the existing cells is selected according to an equally-likely law. Independently, a line…
Synchronization is a widespread phenomenon encountered in many natural and engineered systems with nonlinear classical dynamics. How synchronization concepts and mechanisms transfer to the quantum realm and whether features are universal or…
Under the assumption $\mathcal{P} \neq \mathcal{NP}$, we prove that two natural problems from the theory of synchronizing automata cannot be solved in polynomial time. The first problem is to decide whether a given reachable partial…
We consider the dynamics of $n$ points on a sphere in $\mathbb{R}^d$ ($d \geq 2$) which attract each other according to a function $\varphi$ of their inner products. When $\varphi$ is linear ($\varphi(t) = t$), the points converge to a…
A system $(P_\alpha: \alpha\in\mathcal{A})$ of probability distributions on a partially ordered set (poset) $\mathcal{S}$ indexed by another poset $\mathcal{A}$ can be realized by a system of $\mathcal{S}$-valued random variables…
Strongly interacting quantum many-body systems are expected to thermalize, however, some evade thermalization due to symmetries. Quantum synchronization provides one such example of ergodicity breaking, but previous studies have focused on…
Consider minimizing the entropy of a mixture of states by choosing each state subject to constraints. If the spectrum of each state is fixed, we expect that in order to reduce the entropy of the mixture, we should make the states less…
Cluster synchronization is a phenomenon in which a network self-organizes into a pattern of synchronized sets. It has been shown that diverse patterns of stable cluster synchronization can be captured by symmetries of the network. Here we…
We consider three dimensional conformal field theories that have a higher spin symmetry that is slightly broken. The theories have a large N limit, in the sense that the operators separate into single trace and multitrace and obey the usual…
In this paper we study a family of discrete configuration spaces, the so-called protocol complexes, which are of utmost importance in theoretical distributed computing. Specifically, we consider questions of the existance of compliant…
Permutation $\sigma$ appears in permutation $\pi$ if there exists a subsequence of $\pi$ that is order-isomorphic to $\sigma$. The natural question is to check if $\sigma$ appears in $\pi$, and if so count the number of occurrences. We know…
We first prove a new separating hyperplane theorem characterizing when a pair of compact convex subsets $K, K'$ of the Euclidean space intersect, and when they are disjoint. The theorem is distinct from classical separation theorems. It…
Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cornerstones in this area is the celebrated six standard deviations result of Spencer (AMS 1985): In any system of n sets in a universe of size…
We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f \colon [n] \to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in [n]$ such that $f(i_j) < f(i_\ell)$ if and only if…
A Kirkman triple system of order $v$, KTS$(v)$, is a resolvable Steiner triple system on $v$ elements. In this paper, we investigate an open problem posed by Doug Stinson, namely the existence of KTS$(v)$ which contain as a subdesign a…