Nonlocal transport in the charge density waves of oo-TaS3_3

We studied the nonlocal transport of a quasi-one dimensional conductor $o$-TaS$_3$. Electric transport phenomena in charge density waves include the thermally-excited quasiparticles, and collective motion of charge density waves (CDW). In spite of its long-range correlation, the collective motion of a CDW does not extend far beyond the electrodes, where phase slippage breaks the correlation. We found that nonlocal voltages appeared in the CDW of $o$-TaS$_3$, both below and above the threshold field for CDW sliding. The temperature dependence of the nonlocal voltage suggests that the observed nonlocal voltage originates from the CDW even below the threshold field. Moreover, our observation of nonlocal voltages in both the pinned and sliding states reveals the existence of a carrier with long-range correlation, in addition to sliding CDWs and thermally-excited quasiparticles.Comment: 8 pages, 4 figure

Stochastic higher spin six vertex model and Macdonald measures

We prove an identity that relates the q-Laplace transform of the height function of a (higher spin inhomogeneous) stochastic six vertex model in a quadrant on one side and a multiplicative functional of a Macdonald measure on the other. The identity is used to prove the GUE Tracy-Widom asymptotics for two instances of the stochastic six vertex model via asymptotic analysis of the corresponding Schur measures.National Science Foundation (U.S.) (Grant DMS-1056390)National Science Foundation (U.S.) (Grant DMS-1607901

Asymptotics of a discrete-time particle system near a reflecting boundary

We examine a discrete-time Markovian particle system on the quarter-plane introduced by M. Defosseux. The vertical boundary acts as a reflecting wall. The particle system lies in the Anisotropic Kardar-Parisi-Zhang with a wall universality class. After projecting to a single horizontal level, we take the longtime asymptotics and obtain the discrete Jacobi and symmetric Pearcey kernels. This is achieved by showing that the particle system is identical to a Markov chain arising from representations of the infinite-dimensional orthogonal group. The fixed-time marginals of this Markov chain are known to be determinantal point processes, allowing us to take the limit of the correlation kernel. We also give a simple example which shows that in the multi-level case, the particle system and the Markov chain evolve differently.Comment: 16 pages, Version 2 improves the expositio

Generalized Green Functions and current correlations in the TASEP

We study correlation functions of the totally asymmetric simple exclusion process (TASEP) in discrete time with backward sequential update. We prove a determinantal formula for the generalized Green function which describes transitions between positions of particles at different individual time moments. In particular, the generalized Green function defines a probability measure at staircase lines on the space-time plane. The marginals of this measure are the TASEP correlation functions in the space-time region not covered by the standard Green function approach. As an example, we calculate the current correlation function that is the joint probability distribution of times taken by selected particles to travel given distance. An asymptotic analysis shows that current fluctuations converge to the ${Airy}_2$ process.Comment: 46 pages, 3 figure

Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles

A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors. The {\em total chromatic number} of a graph $G$, denoted by \chiup''(G), is the minimum number of colors in a total coloring of $G$. The well-known Total Coloring Conjecture (TCC) says that every graph with maximum degree $\Delta$ admits a total coloring with at most $\Delta + 2$ colors. A graph is {\em $1$-toroidal} if it can be drawn in torus such that every edge crosses at most one other edge. In this paper, we investigate the total coloring of $1$-toroidal graphs, and prove that the TCC holds for the $1$-toroidal graphs with maximum degree at least~$11$ and some restrictions on the triangles. Consequently, if $G$ is a $1$-toroidal graph with maximum degree $\Delta$ at least~$11$ and without adjacent triangles, then $G$ admits a total coloring with at most $\Delta + 2$ colors.Comment: 10 page

On a conjecture of Widom

We prove a conjecture of H.Widom stated in [W] (math/0108008) about the reality of eigenvalues of certain infinite matrices arising in asymptotic analysis of large Toeplitz determinants. As a byproduct we obtain a new proof of A.Okounkov's formula for the (determinantal) correlation functions of the Schur measures on partitions.Comment: 9 page

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching

We present a series of results regarding conceptually simple algorithms for bipartite matching in various online and related models. We first consider a deterministic adversarial model. The best approximation ratio possible for a one-pass deterministic online algorithm is $1/2$, which is achieved by any greedy algorithm. D\"urr et al. recently presented a $2$-pass algorithm called Category-Advice that achieves approximation ratio $3/5$. We extend their algorithm to multiple passes. We prove the exact approximation ratio for the $k$-pass Category-Advice algorithm for all $k \ge 1$, and show that the approximation ratio converges to the inverse of the golden ratio $2/(1+\sqrt{5}) \approx 0.618$ as $k$ goes to infinity. The convergence is extremely fast --- the $5$-pass Category-Advice algorithm is already within $0.01\%$ of the inverse of the golden ratio. We then consider a natural greedy algorithm in the online stochastic IID model---MinDegree. This algorithm is an online version of a well-known and extensively studied offline algorithm MinGreedy. We show that MinDegree cannot achieve an approximation ratio better than $1-1/e$, which is guaranteed by any consistent greedy algorithm in the known IID model. Finally, following the work in Besser and Poloczek, we depart from an adversarial or stochastic ordering and investigate a natural randomized algorithm (MinRanking) in the priority model. Although the priority model allows the algorithm to choose the input ordering in a general but well defined way, this natural algorithm cannot obtain the approximation of the Ranking algorithm in the ROM model

Airy processes and variational problems

We review the Airy processes; their formulation and how they are conjectured to govern the large time, large distance spatial fluctuations of one dimensional random growth models. We also describe formulas which express the probabilities that they lie below a given curve as Fredholm determinants of certain boundary value operators, and the several applications of these formulas to variational problems involving Airy processes that arise in physical problems, as well as to their local behaviour.Comment: Minor corrections. 41 pages, 4 figures. To appear as chapter in "PASI Proceedings: Topics in percolative and disordered systems