中文
相关论文

相关论文: Almost-Sharp Quantitative Duffin-Schaeffer without…

200 篇论文

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

组合数学 · 数学 2025-11-12 Qiuli Li , Fuliang Lu , Heping Zhang

The author, and independently De Concini, conjectured that the monodromy of the Casimir connection of a simple Lie algebra g is described by the quantum Weyl group operators of the quantum group U_h(g). The aim of this paper, and of its…

量子代数 · 数学 2009-09-29 V. Toledano-Laredo

Dumas, Foucaud, Perez, and Todinca [SIAM J. Disc. Math., 2024] proved that if the vertex set of a graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is bounded by $\mathcal{O}(k \cdot 3^k)$. We prove a coarse variant…

组合数学 · 数学 2025-03-05 Meike Hatzel , Michał Pilipczuk

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

数论 · 数学 2016-04-01 Victor Beresnevich

In this paper, we solve the longstanding Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. The conjecture asserts that for any minimal graph above the unit disk, the Gaussian curvature at the point directly above the…

微分几何 · 数学 2025-06-10 David Kalaj , Petar Melentijevic

We show that for every $M,A,n \in \mathbb{N}$ there exists a graph $G$ that does not contain the $(154\times 154)$-grid as a $3$-fat minor and is not $(M,A)$-quasi-isometric to a graph with no $K_n$ minor. This refutes the conjectured…

组合数学 · 数学 2026-02-25 Sandra Albrechtsen , James Davies

In the DAG Edge Deletion problem, we are given an edge-weighted directed acyclic graph and a parameter $k$, and the goal is to delete the minimum weight set of edges so that the resulting graph has no paths of length $k$. This problem,…

数据结构与算法 · 计算机科学 2025-07-11 Sina Kalantarzadeh , Nathan Klein , Victor Reis

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

组合数学 · 数学 2020-03-31 Jakub Przybyło

In 1962, Gallagher proved an higher dimensional version of Khintchine's theorem on Diophantine approximation. Gallagher's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with…

数论 · 数学 2022-03-04 Han Yu

The Castelnuovo bound conjecture, which is proposed by physicists, predicts an effective vanishing result for Gopakumar-Vafa invariants of Calabi-Yau 3-folds of Picard number one. Previously, it is only known for a few cases and all the…

代数几何 · 数学 2024-07-30 Zhiyu Liu

A recent celebrated theorem of Diverio-Trapani and Wu-Yau states that a compact K\"ahler manifold admitting a K\"ahler metric of quasi-negative holomorphic sectional curvature has an ample canonical line bundle, confirming a conjecture of…

微分几何 · 数学 2022-02-15 Yashan Zhang , Tao Zheng

The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…

交换代数 · 数学 2022-01-04 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…

组合数学 · 数学 2025-04-29 Arindam Biswas , Jyoti Prakash Saha

In 1975 Bollob\'{a}s, Erd\H{o}s, and Szemer\'{e}di asked what minimum degree guarantees an octahedral subgraph $K_3(2)$ in any tripartite graph $G$ with $n$ vertices in each vertex class. We show that $\delta(G)\geq n+2n^{\frac{5}{6}}$…

组合数学 · 数学 2025-06-24 Yihan Chen , Jialin He , Allan Lo , Cong Luo , Jie Ma , Yi Zhao

In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…

数论 · 数学 2025-10-07 Frank Calegari , Vesselin Dimitrov , Yunqing Tang

We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…

数论 · 数学 2016-10-27 Matthew Palmer

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

K理论与同调 · 数学 2014-07-23 Martin Finn-Sell , Nick Wright

Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…

数论 · 数学 2026-02-17 Yubin He , Lingmin Liao

In this paper we re-examine the theory of systems with quasi-discrete spectrum initiated in the 1960's by Abramov, Hahn, and Parry. In the first part, we give a simpler proof of the Hahn--Parry theorem stating that each minimal topological…

动力系统 · 数学 2017-06-02 Markus Haase , Nikita Moriakov

We establish some limit theorems for quasi-arithmetic means of random variables. This class of means contains the arithmetic, geometric and harmonic means. Our feature is that the generators of quasi-arithmetic means are allowed to be…

统计理论 · 数学 2022-05-09 Yuichi Akaoka , Kazuki Okamura , Yoshiki Otobe