Related papers: Multipliers and Disjointness from Mixing

We give an entirely new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique in additive combinatorics. The method provides a short and elegant generalization of the fact that there are at most…

A classifier for two or more samples is proposed when the data are high-dimensional and the underlying distributions may be non-normal. The classifier is constructed as a linear combination of two easily computable and interpretable…

Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two…

According to conventional wisdom electric double-layer forces normally decay exponentially with separation distance. Here we present experimental evidence of algebraically decaying double-layer interactions. We show that algebraic…

Remarkably persistent mixing and non-mixing regions (islands) are observed to coexist in a three-dimensional dynamical system where randomness is expected. The track of an x-ray opaque particle in a spherical shell half-filled with dry…

We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.

We examine high energy eigenfunctions for the Dirichlet Laplacian on domains where the billiard flow exhibits mixed dynamical behavior. (More generally, we consider semiclassical Schrodinger operators with mixed assumptions on the…

Let $(X,T)$ be a topological dynamical system and $\mu$ be a invariant measure, we show that $(X,\mathcal{B},\mu,T)$ is rigid if and only if there exists some subsequence $A$ of $\mathbb N$ such that $(X,T)$ is $\mu$-$A$-equicontinuous if…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

We say that a system of differential equations d^2x(t)/dt^2=Adx(t)/dt+Bx(t)+Cu(t), in which A and B are m-by-m complex matrices and C is an m-by-n complex matrix, is rigid if it can be reduced by substitutions x(t)=Sy(t),…

We study the dynamics of an open quantum system linearly coupled to a bosonic reservoir. We show that, in the ultrastrong coupling limit, the system undergoes a nonselective measurement and then evolves unitarily according to an effective…

A natural gradual extension of the idea of Grand Unification is to attempt to relate the gauge and Yukawa couplings; Gauge-Yukawa Unification (GYU). However, within the framework of renormalizable field theories, there exists no realistic…

Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…

We show that every invertible strong mixing transformation on a Lebesgue space has strictly over-recurrent sets. Also, we give an explicit procedure for constructing strong mixing transformations with no under-recurrent sets. This answers…

Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation…

Given $n$ pairwise disjoint sets $X_1,\ldots, X_n$, we call the elements of $S=X_1\times\ldots\times X_n$ strings. A nonempty set of strings $W\subseteq S$ is said to be well-connected if for every $v\in W$ and for every $i\, (1\le i\le…

The famous Rokhlin Problem asks whether mixing implies higher order mixing. So far, all the known examples of zero entropy, mixing dynamical systems enjoy a variant of the mixing via shearing mechanism. In this paper we introduce the notion…

In the conventional formulation of N=1 supersymmetry, a vector multiplet is supposed to be in the adjoint representation of a given gauge group. We present a new formulation with a vector multiplet in the non-adjoint representation of SO(N)…