相关论文: On Upper Bounds on the Church-Rosser Theorem

This paper establishes Noether's classical degree bound $\beta(G) \le |G|$ for finite and linearly reductive group schemes. On the other hand, we provide examples of infinitesimal group schemes where $\beta(G)$ is unbounded. We also…

This paper investigates the performance of a subclass of exponential integrators, specifically explicit exponential Runge--Kutta methods. It is well known that third-order methods can suffer from order reduction when applied to linearized…

Using the subordination approach, we provide a new Berry-Esseen-type estimate in the free central limit theorem in terms of the fourth Lyapunov fraction. In the special case of identical distributions, our result implies a rate of order…

We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1. We show that the classical adversary bound lifts to a lower bound on randomized communication…

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector $\theta\in\mathbb{R}^d$ of coefficients is constrained in either $\ell_1$-norm…

This note concerns an extension of the good-$\lambda$ inequality for fractional integrals, due to B. Muckenhoupt and R. Wheeden. The classical result is refined in two aspects. Firstly, general nonlinear potentials are considered; and…

Bayesian coresets speed up posterior inference in the large-scale data regime by approximating the full-data log-likelihood function with a surrogate log-likelihood based on a small, weighted subset of the data. But while Bayesian coresets…

In this work we prove decidability of the model-checking problem for safe recursion schemes against properties defined by alternating B-automata. We then exploit this result to show how to compute downward closures of languages of finite…

We develop an approach for the treatment of one--dimensional bounded quantum--mechanical models by straightforward modification of a successful method for unbounded ones. We apply the new approach to a simple example and show that it…

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…

The algebraic formulation of the derivation and integration related by the First Fundamental Theorem of Calculus (FFTC) gives rise to the notion of differential Rota-Baxter algebra. The notion has a remarkable list of categorical…

G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…

Hypothesis exclusion is an information-theoretic task in which an experimenter aims at ruling out a false hypothesis from a finite set of known candidates, and an error occurs if and only if the hypothesis being ruled out is the ground…

We consider the best constant in a critical Sobolev inequality of second order. We show non-rigidity for the optimizers above a certain threshold, namely we prove that the best constant is achieved by a non-constant solution of the…

This paper continues the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. In particular, we consider problems related to perfect subsets of Polish spaces, studying the perfect set…

We have previously published the Isabelle/HOL formalization of a general theory of syntax with bindings. In this companion paper, we instantiate the general theory to the syntax of lambda-calculus and formalize the development leading to…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

We establish the tightest possible Robertson-type preparation uncertainty relation, which explicitly depends on the eigenvalues of the quantum state. The conventional constant $ \tfrac{1}{4} $ is replaced by a state-dependent coefficient…