中文
相关论文

相关论文: An Exponential Lower Bound on OBDD Refutations for…

200 篇论文

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

数论 · 数学 2021-11-16 Paul Buterus , Friedrich Götze , Thomas Hille , Gregory Margulis

Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…

数论 · 数学 2016-03-16 Jun Wu , Jian-Sheng Xie

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

逻辑 · 数学 2018-10-16 Pierre Simon

We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from $\mathcal{F}_2(n,\delta n)$, the uniform distribution over all 2-CNFs with $\delta n$ clauses and $n$…

数据结构与算法 · 计算机科学 2026-05-20 Alexis de Colnet , Alfons Laarman , Joon Hyung Lee

We show that the value of the $n$-fold repeated GHZ game is at most $2^{-\Omega(n)}$, improving upon the polynomial bound established by Holmgren and Raz. Our result is established via a reduction to approximate subgroup type questions from…

计算复杂性 · 计算机科学 2022-11-28 Mark Braverman , Subhash Khot , Dor Minzer

Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the…

计算复杂性 · 计算机科学 2011-06-06 Sebastian Müller , Iddo Tzameret

It is shown that the orthogonal polynomials, corresponding to the oscillatory weight $e^{\im\omega x}$, exists if $\omega$ is a transcendental number and $\tan\omega/\omega\in\Q$. Also, it is proved that such orthogonal polynomials exist…

数值分析 · 数学 2014-04-08 Hassan Majidian

We establish the existence of many holomorphic Hecke eigenforms $f$ of large weight $k$ for the full modular group, for which the least positive integer $n_f$ such that $\lambda_f(n_f)<0$ satisfies $n_f \ge (\log k)^{1-o(1)}.$ This is…

数论 · 数学 2026-02-10 Youness Lamzouri

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

交换代数 · 数学 2026-04-14 Francesca Cioffi , Margherita Guida , Enrica Pirozzi

In this paper, we prove the Generalized P\'{o}lya conjecture for the Dirichlet eigenvalues. In other words, we show that $\lambda_k(\alpha) \ge \frac{(2\pi)^{\alpha} k^{\alpha/n}}{\big(\omega_n \cdot {vol}(\Omega)\big)^{\alpha/n}}, \quad\,…

偏微分方程分析 · 数学 2015-02-16 Genqian Liu

Ozawa and Shioya proposed the limit formula for observable diameters of pyramids under weak convergence. However, we find a constructive counterexample to an inequality used in their proof. In this paper, we correct the inequality and…

度量几何 · 数学 2024-07-12 Shigeaki Yokota

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

经典分析与常微分方程 · 数学 2009-04-20 M. A. M. Alwash

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

最优化与控制 · 数学 2026-03-03 Hongyu Cheng , Amitabh Basu

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

组合数学 · 数学 2015-05-29 Georgios Vlachos

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

数论 · 数学 2007-05-23 Damien Roy

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

数论 · 数学 2025-04-21 Byungchul Cha , Dong Han Kim

Higher order MDS codes are an interesting generalization of MDS codes recently introduced by Brakensiek, Gopi and Makam (IEEE Trans. Inf. Theory 2022). In later works, they were shown to be intimately connected to optimally list-decodable…

信息论 · 计算机科学 2024-08-22 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

计算几何 · 计算机科学 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

We propose a conjecture, similar to Skolem's conjecture, on a Hasse-type principle for exponential diophantine equations. We prove that in a sense the principle is valid for "almost all" equations. Based upon this we propose a general…

数论 · 数学 2014-07-25 Cs. Bertok , L. Hajdu

We exhibit a monotone function computable by a monotone circuit of quasipolynomial size such that any monotone circuit of polynomial depth requires exponential size. This is the first size-depth tradeoff result for monotone circuits in the…

计算复杂性 · 计算机科学 2024-11-22 Mika Göös , Gilbert Maystre , Kilian Risse , Dmitry Sokolov