中文
相关论文

相关论文: Using the No-Search Easy-Hard Technique for Downwa…

200 篇论文

We extend the results of Deligne and Illusie on liftings modulo $p^2$ and decompositions of the de Rham complex in several ways. We show that for a smooth scheme $X$ over a perfect field $k$ of characteristic $p>0$, the truncations of the…

代数几何 · 数学 2023-03-29 Piotr Achinger , Junecue Suh

To expand a fundamental theory of context-free languages, we equip nondeterministic one-way pushdown automata with additional oracle mechanisms, which naturally induce various nondeterministic reducibilities among formal languages. As a…

形式语言与自动机理论 · 计算机科学 2015-05-26 Tomoyuki Yamakami

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

概率论 · 数学 2007-12-23 Iosif Pinelis

Let $f(x)=x^TAx+2a^Tx+c$ and $h(x)=x^TBx+2b^Tx+d$ be two quadratic functions having symmetric matrices $A$ and $B$. The S-lemma with equality asks when the unsolvability of the system $f(x)<0, h(x)=0$ implies the existence of a real number…

最优化与控制 · 数学 2015-04-20 Yong Xia , Shu Wang , Ruey-Lin Sheu

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

q-alg · 数学 2008-02-03 Anne Schilling , S. Ole Warnaar

This paper is devoted to studies of non-negative, non-trivial (classical, punctured, or distributional) solutions to the higher order Hardy-H\'enon equations \[ (-\Delta)^m u = |x|^\sigma u^p \] in $\mathbf R^n$ with $p > 1$. We show that…

偏微分方程分析 · 数学 2022-06-30 Quôc Anh Ngô , Dong Ye

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…

机器学习 · 计算机科学 2009-11-03 Dasika Ratna Deepthi , K. Eswaran

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

组合数学 · 数学 2023-01-19 Csaba Biró , Jenő Lehel , Géza Tóth

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

逻辑 · 数学 2015-12-16 Pedro Sánchez Terraf

We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is…

数据库 · 计算机科学 2019-01-29 Mahmoud Abo Khamis , Hung Q. Ngo , Dan Olteanu , Dan Suciu

We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delta) \cdot n$ for some constant $c_k > 0$,…

组合数学 · 数学 2026-03-27 Chunchao Fan , Qizhong Lin

We use orthogonality calculus to prove a downward transfer from categoricity in a successor in abstract elementary classes (AECs) that have a good frame (a forking-like notion for types of singletons) on an interval of cardinals:…

逻辑 · 数学 2016-12-22 Sebastien Vasey

We establish Borel equivariant analogues of several classical theorems from complex analysis and PDE. The starting point is an equivariant Weierstrass theorem for entire functions: there exists a Borel mapping which assigns to each…

动力系统 · 数学 2025-12-19 Konstantin Slutsky , Mikhail Sodin , Aron Wennman

It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and…

经典分析与常微分方程 · 数学 2019-09-20 Simon Baker , Jonathan M. Fraser , András Máthé

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

计算复杂性 · 计算机科学 2008-05-15 Alexander A. Sherstov

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

计算复杂性 · 计算机科学 2024-04-12 Yahel Manor , Or Meir

This paper proves Buss's hierarchy of bounded arithmetics $S^1_2 \subseteq S^2_2 \subseteq \cdots \subseteq S^i_2 \subseteq \cdots$ does not entirely collapse. More precisely, we prove that, for a certain $D$, $S^1_2 \subsetneq S^{2D+5}_2$…

逻辑 · 数学 2019-10-31 Yoriyuki Yamagata

We give a direct algebraic proof of the necessity direction in the single-point higher-order Szeg\H{o} sum rules on the unit circle for $m=1,2,3$. More precisely, for $H_m(e^{i\theta})=(1-\cos\theta)^m$, we show that…

经典分析与常微分方程 · 数学 2026-04-28 Daxiong Piao

Let $d,k$ be natural numbers and let $\mathcal{L}_1, \dots, \mathcal{L}_k \in \mathrm{GL}_d(\mathbb{Q})$ be linear transformations such that there are no non-trivial subspaces $U, V \subseteq \mathbb{Q}^d$ of the same dimension satisfying…

组合数学 · 数学 2024-09-10 Albert Lopez Bruch , Yifan Jing , Akshat Mudgal

We illustrate how to invite and excite students about research by exploring higher-dimensional generalizations of the classical egg drop problem, in which the goal is to locate a critical breaking point using the fewest number of trials.…

历史与综述 · 数学 2025-12-02 Xiangwen Cao , Zongyun Chen , Steven J. Miller