On the Positivity Problem for Simple Linear Recurrence Sequences

Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.Comment: arXiv admin note: substantial text overlap with arXiv:1307.277

On Simultaneous Two-player Combinatorial Auctions

We consider the following communication problem: Alice and Bob each have some valuation functions $v_1(\cdot)$ and $v_2(\cdot)$ over subsets of $m$ items, and their goal is to partition the items into $S, \bar{S}$ in a way that maximizes the welfare, $v_1(S) + v_2(\bar{S})$. We study both the allocation problem, which asks for a welfare-maximizing partition and the decision problem, which asks whether or not there exists a partition guaranteeing certain welfare, for binary XOS valuations. For interactive protocols with $poly(m)$ communication, a tight 3/4-approximation is known for both [Fei06,DS06]. For interactive protocols, the allocation problem is provably harder than the decision problem: any solution to the allocation problem implies a solution to the decision problem with one additional round and $\log m$ additional bits of communication via a trivial reduction. Surprisingly, the allocation problem is provably easier for simultaneous protocols. Specifically, we show: 1) There exists a simultaneous, randomized protocol with polynomial communication that selects a partition whose expected welfare is at least $3/4$ of the optimum. This matches the guarantee of the best interactive, randomized protocol with polynomial communication. 2) For all $\varepsilon > 0$, any simultaneous, randomized protocol that decides whether the welfare of the optimal partition is $\geq 1$ or $\leq 3/4 - 1/108+\varepsilon$ correctly with probability $> 1/2 + 1/ poly(m)$ requires exponential communication. This provides a separation between the attainable approximation guarantees via interactive ($3/4$) versus simultaneous ($\leq 3/4-1/108$) protocols with polynomial communication. In other words, this trivial reduction from decision to allocation problems provably requires the extra round of communication

Selling to a No-Regret Buyer

We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution $D$ in every round). Prior work assumes that the buyer is fully rational and will perfectly reason about how their bids today affect the seller's decisions tomorrow. In this work we initiate a different direction: the buyer simply runs a no-regret learning algorithm over possible bids. We provide a fairly complete characterization of optimal auctions for the seller in this domain. Specifically: - If the buyer bids according to EXP3 (or any "mean-based" learning algorithm), then the seller can extract expected revenue arbitrarily close to the expected welfare. This auction is independent of the buyer's valuation $D$, but somewhat unnatural as it is sometimes in the buyer's interest to overbid. - There exists a learning algorithm $\mathcal{A}$ such that if the buyer bids according to $\mathcal{A}$ then the optimal strategy for the seller is simply to post the Myerson reserve for $D$ every round. - If the buyer bids according to EXP3 (or any "mean-based" learning algorithm), but the seller is restricted to "natural" auction formats where overbidding is dominated (e.g. Generalized First-Price or Generalized Second-Price), then the optimal strategy for the seller is a pay-your-bid format with decreasing reserves over time. Moreover, the seller's optimal achievable revenue is characterized by a linear program, and can be unboundedly better than the best truthful auction yet simultaneously unboundedly worse than the expected welfare

Modules over the small quantum group and semi-infinite flag manifold

We develop a theory of perverse sheaves on the semi-infinite flag manifold $G((t))/N((t))\cdot T[[t]]$, and show that the subcategory of Iwahori-monodromy perverse sheaves is equivalent to the regular block of the category of representations of the small quantum group at an even root of unity

Proposal to demonstrate the non-locality of Bohmian mechanics with entangled photons

Bohmian mechanics reproduces all statistical predictions of quantum mechanics, which ensures that entanglement cannot be used for superluminal signaling. However, individual Bohmian particles can experience superluminal influences. We propose to illustrate this point using a double double-slit setup with path-entangled photons. The Bohmian velocity field for one of the photons can be measured using a recently demonstrated weak-measurement technique. The found velocities strongly depend on the value of a phase shift that is applied to the other photon, potentially at spacelike separation.Comment: 6 pages, 4 figure

Surface Operators in N=2 Abelian Gauge Theory

We generalise the analysis in [arXiv:0904.1744] to superspace, and explicitly prove that for any embedding of surface operators in a general, twisted N=2 pure abelian theory on an arbitrary four-manifold, the parameters transform naturally under the SL(2,Z) duality of the theory. However, for nontrivially-embedded surface operators, exact S-duality holds if and only if the "quantum" parameter effectively vanishes, while the overall SL(2,Z) duality holds up to a c-number at most, regardless. Nevertheless, this observation sets the stage for a physical proof of a remarkable mathematical result by Kronheimer and Mrowka--that expresses a "ramified" analog of the Donaldson invariants solely in terms of the ordinary Donaldson invariants--which, will appear, among other things, in forthcoming work. As a prelude to that, the effective interaction on the corresponding u-plane will be computed. In addition, the dependence on second Stiefel-Whitney classes and the appearance of a Spin^c structure in the associated low-energy Seiberg-Witten theory with surface operators, will also be demonstrated. In the process, we will stumble upon an interesting phase factor that is otherwise absent in the "unramified" case.Comment: 46 pages. Minor refinemen

Comparative risks of initial aortic events associated with genetic thoracic aortic disease

BACKGROUND: Pathogenic variants in 11 genes predispose individuals to heritable thoracic aortic disease (HTAD), but limited data are available to stratify the risk for aortic events associated with these genes. OBJECTIVES: This study sought to compare the risk of first aortic event, specifically thoracic aortic aneurysm surgery or an aortic dissection, among 7 HTAD genes and variant types within each gene. METHODS: A retrospective cohort of probands and relatives with rare variants in 7 genes for HTAD (n = 1,028) was assessed for the risk of first aortic events based on the gene altered, pathogenic variant type, sex, proband status, and location of recruitment. RESULTS: Significant differences in aortic event risk were identified among the smooth muscle contraction genes (ACTA2, MYLK, and PRKG1; P = 0.002) and among the genes for Loeys-Dietz syndrome, which encode proteins in the transforming growth factor (TGF)-β pathway (SMAD3, TGFB2, TGFBR1, and TGFBR2;P \u3c 0.0001). Cumulative incidence of type A aortic dissection was higher than elective aneurysm surgery in patients with variants in ACTA2, MYLK, PRKG1, and SMAD3; in contrast, patients with TGFBR2 variants had lower cumulative incidence of type A aortic dissection than elective aneurysm surgery. Cumulative incidence of type B aortic dissection was higher for ACTA2, PRKG1, and TGFBR2 than other genes. After adjusting for proband status, sex, and recruitment location, specific variants in ACTA2 and TGFBR2 were associated with substantially higher risk of aortic event with childhood onset. CONCLUSIONS: Gene- and variant-specific data on aortic events in individuals with HTAD support personalized aortic surveillance and clinical management