English
Related papers

Related papers: Almost-Sharp Quantitative Duffin-Schaeffer without…

200 papers

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

Differential Geometry · Mathematics 2025-08-29 Shiping Liu , Chiyu Zhou

Let $(\mathbf{U}, \mathbf{U}^\imath)$ be a quasi-split affine quantum symmetric pair of type $\mathsf{AIII}$. This case is of particular interest thanks to the existence of geometric realizations and Schur--Weyl dualities. We establish…

Quantum Algebra · Mathematics 2026-01-12 Jian-Rong Li , Tomasz Przezdziecki

For a non-negative function $\psi: ~ \N \mapsto \R$, let $W(\psi)$ denote the set of real numbers $x$ for which the inequality $|n x - a| < \psi(n)$ has infinitely many coprime solutions $(a,n)$. The Duffin--Schaeffer conjecture, one of the…

Number Theory · Mathematics 2018-05-16 Christoph Aistleitner

We show the existence of length-constrained expander decomposition in directed graphs and undirected vertex-capacitated graphs. Previously, its existence was shown only in undirected edge-capacitated graphs [Haeupler-R\"acke-Ghaffari, STOC…

Data Structures and Algorithms · Computer Science 2025-04-01 Bernhard Haeupler , Yaowei Long , Thatchaphol Saranurak , Shengzhe Wang

Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph $G$ becomes disconnected, given that its edges are removed independently with probability $p$. This…

Data Structures and Algorithms · Computer Science 2023-10-13 David G. Harris , Aravind Srinivasan

Inspired by recent advances in singular SPDE theory, we use the Poincar\'e inequality on Wiener space to show that controlled complementary Young regularity is sufficient to obtain Gaussian rough paths lifts. This allows us to completely…

Probability · Mathematics 2024-12-09 Paul Gassiat , Tom Klose

Let $G=G_{n,k}$ denote the graph formed by placing points in a square of area $n$ according to a Poisson process of density 1 and joining each pair of points which are both $k$ nearest neighbours of each other. Then $G_{n,k}$ can be used as…

Combinatorics · Mathematics 2014-06-04 Neville Ball

We prove a conjecture of Jockers-Mayr and Garoufalidis-Scheidegger, relating genus zero quantum $K$-invariants and Gopakumar--Vafa invariants on the quintic threefold.

Algebraic Geometry · Mathematics 2023-01-04 You-Cheng Chou , Y. -P. Lee

We consider the question of approximating Max 2-CSP where each variable appears in at most $d$ constraints (but with possibly arbitrarily large alphabet). There is a simple $(\frac{d+1}{2})$-approximation algorithm for the problem. We prove…

Data Structures and Algorithms · Computer Science 2023-09-11 Euiwoong Lee , Pasin Manurangsi

We study an odd-dimensional analogue of the Goldberg conjecture for compact Einstein almost K\"ahler manifolds. We give an explicit non-compact example of an Einstein almost cok\"ahler manifold that is not cok\"ahler. We prove that compact…

Differential Geometry · Mathematics 2016-01-11 Diego Conti , Marisa Fernández

We solve the problem of giving sharp asymptotic bounds on the Hausdorff dimensions of certain sets of badly approximable matrices, thus improving results of Broderick and Kleinbock (preprint 2013) as well as Weil (preprint 2013), and…

Number Theory · Mathematics 2017-01-13 David Simmons

This paper takes a new step in the direction of proving the Duffin-Schaeffer Conjecture for measures arbitrarily close to Lebesgue. The main result is that under a mild `extra divergence' hypothesis, the conjecture is true.

Number Theory · Mathematics 2012-01-06 Victor Beresnevich , Glyn Harman , Alan Haynes , Sanju Velani

For an integer $k\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+\Omega(m^{(2k+1)/(2k+2)})$…

Combinatorics · Mathematics 2025-07-22 Jianfeng Hou , Siwei Lin , Qinghou Zeng

A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical graph $G$ of order $n$, $e(G) \leq \lfloor…

Combinatorics · Mathematics 2024-09-27 Xiaolin Wang , Yanbo Zhang , Xiutao Zhu

Measurement based quantum computing is preformed by adding non-Clifford measurements to a prepared stabilizer states. Entangling gates like CZ are likely to have lower fidelities due to the nature of interacting qubits, so when preparing a…

Quantum Physics · Physics 2025-07-29 James Davies , Andrew Jena

In this note, we describe a $\alpha_{GW} + \tilde{\Omega}(1/d^2)$-factor approximation algorithm for Max-Cut on weighted graphs of degree $\leq d$. Here, $\alpha_{GW}\approx 0.878$ is the worst-case approximation ratio of the…

Data Structures and Algorithms · Computer Science 2022-06-23 Jun-Ting Hsieh , Pravesh K. Kothari

An effective quantum field theory description of graphene in the ultra-relativistic regime is given by reduced QED aka. pseudo QED aka. mixed-dimensional QED. It has been speculated in the literature that reduced QED constitutes an example…

High Energy Physics - Theory · Physics 2019-03-06 D. Dudal , A. J. Mizher , P. Pais

In this paper, we extend the sharp lower bounds of spectal gap, due to Chen- Wang [10, 11], Bakry-Qian [6] and Andrews-Clutterbuck [5], from smooth Riemaniannian manifolds to general metric measure spaces with Riemannian curvature-dimension…

Differential Geometry · Mathematics 2015-03-03 Yin Jiang , Hui-Chun Zhang

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…

Combinatorics · Mathematics 2017-11-16 Martina Juhnke-Kubitzke , Lorenzo Venturello

Strong untestable assumptions are almost universal in causal point estimation. In particular settings, bounds can be derived to narrow the possible range of a causal effect. Symbolic bounds apply to all settings that can be depicted using…

Computation · Statistics 2022-09-09 Gustav Jonzon , Michael C Sachs , Erin E Gabriel