Quasirandomness in hypergraphs

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical' properties are asymptotically equivalent and, thus, a graph $G$ possessing one such property automatically satisfies the others. In recent years, work in this area has focused on uncovering more quasirandom graph properties and on extending the known results to other discrete structures. In the context of hypergraphs, however, one may consider several different notions of quasirandomness. A complete description of these notions has been provided recently by Towsner, who proved several central equivalences using an analytic framework. We give short and purely combinatorial proofs of the main equivalences in Towsner's result.Comment: 19 page

The Relationship between Personality Organization and Psychiatric Classification in Chronic Pain Patients

The assessment of PO is a crucial issue for diagnosis and treatment planning in CPPs, since it represents a measure of structural impairment that is to a considerable extent independent of axis I and II diagnoses. Moreover, the STIPO dimensional rating focuses on the most salient dysfunctions at a given time. Copyright (C) 2010 S. Karger AG, BaselBackground: The present study investigated the relationship between psychiatric classification and personality organization (PO) in a secondary/tertiary clinical sample of chronic pain patients (CPPs). Sampling and Methods: Forty-three patients were administered the Structured Clinical Interview for DSM-IV (SCID I+II) and the Structured Interview of Personality Organization (STIPO). The prevalence of axis I and axis II disorders was correlated with the STIPO level of PO. The STIPO dimensional ratings of patients without personality disorder (PD) were compared to those of patients diagnosed with one or more PDs. Results: Axis I comorbidity was high (93%), and 63% of the patients met the criteria for at least one axis II diagnosis. Twenty-five patients (58%) were diagnosed as borderline PO, with high-level impairments in the dimensions `coping/rigidity', `primitive defenses' and `identity'. Higher axis I and axis II comorbidity corresponded with greater severity of PO impairment. No difference was found between the dimensional ratings of patients without PD and those of patients with one or more PDs. Conclusions

The Cop Number of the One-Cop-Moves Game on Planar Graphs

Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game, alternately called the one-active-cop game, one-cop-moves game or the lazy-cops-and-robbers game, where at most one cop can move during any round. We show that Aigner and Frommer's result does not generalise to this game variant by constructing a connected planar graph on which a robber can indefinitely evade three cops in the one-cop-moves game. This answers a question recently raised by Sullivan, Townsend and Werzanski.Comment: 32 page

Minimum and maximum against k lies

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has been studied in the context of the Renyi-Ulam liar games, where the oracle may give up to k false answers. For large k, an upper bound due to Aigner shows that (k+O(\sqrt{k}))n comparisons suffice. We improve on this by providing an algorithm with at most (k+1+C)n+O(k^3) comparisons for some constant C. The known lower bounds are of the form (k+1+c_k)n-D, for some constant D, where c_0=0.5, c_1=23/32=0.71875, and c_k=\Omega(2^{-5k/4}) as k goes to infinity.Comment: 11 pages, 3 figure

Imaging geometry through dynamics: the observable representation

For many stochastic processes there is an underlying coordinate space, $V$, with the process moving from point to point in $V$ or on variables (such as spin configurations) defined with respect to $V$. There is a matrix of transition probabilities (whether between points in $V$ or between variables defined on $V$) and we focus on its ``slow'' eigenvectors, those with eigenvalues closest to that of the stationary eigenvector. These eigenvectors are the ``observables,'' and they can be used to recover geometrical features of $V$

Long-Range Order in Electronic Transport through Disordered Metal Films

Ultracold atom magnetic field microscopy enables the probing of current flow patterns in planar structures with unprecedented sensitivity. In polycrystalline metal (gold) films we observe long-range correlations forming organized patterns oriented at +/- 45 deg relative to the mean current flow, even at room temperature and at length scales orders of magnitude larger than the diffusion length or the grain size. The preference to form patterns at these angles is a direct consequence of universal scattering properties at defects. The observed amplitude of the current direction fluctuations scales inversely to that expected from the relative thickness variations, the grain size and the defect concentration, all determined independently by standard methods. This indicates that ultracold atom magnetometry enables new insight into the interplay between disorder and transport

Uniform generation in trace monoids

We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components-a case where other notions such as Parry measures, are not defined. Random generation algorithms are then examined.Comment: Full version of the paper in MFCS 2015 with the same titl

How to share a quantum secret

We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum "no-cloning theorem", which requires that n < 2k, and, in all such cases, we give an efficient construction of a ((k,n)) threshold scheme. We also explore similarities and differences between quantum secret sharing schemes and quantum error-correcting codes. One remarkable difference is that, while most existing quantum codes encode pure states as pure states, quantum secret sharing schemes must use mixed states in some cases. For example, if k <= n < 2k-1 then any ((k,n)) threshold scheme must distribute information that is globally in a mixed state.Comment: 5 pages, REVTeX, submitted to PR