English
Related papers

Related papers: Counting Martingales for Measure and Dimension in …

200 papers

We investigate \emph{magnitude} as a new unary and strictly Pareto-compliant quality indicator for finite approximation sets to the Pareto front in multiobjective optimization. Magnitude originates in enriched category theory and metric…

Optimization and Control · Mathematics 2026-04-21 Michael T. M. Emmerich

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…

Computational Complexity · Computer Science 2026-03-10 Nikolai Chukhin , Alexander S. Kulikov , Ivan Mihajlin , Arina Smirnova

Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our study concentrates on the quantitative aspect, specifically…

Logic in Computer Science · Computer Science 2024-07-17 Mohimenul Kabir , Kuldeep S Meel

This thesis is concerned with the quantitative assessment of security in software. More specifically, it tackles the problem of efficient computation of channel capacity, the maximum amount of confidential information leaked by software,…

Cryptography and Security · Computer Science 2015-04-14 Quoc-Sang Phan

In this paper, we consider a compact Riemannian manifold with boundary, endowed with a magnetic potential $\alpha$ and a potential $U$. For brevity, this type of systems are called $\MP$-systems. On simple $\MP$-systems, we consider both…

Differential Geometry · Mathematics 2013-07-30 Yernat M. Assylbekov , Hanming Zhou

Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…

Computational Geometry · Computer Science 2025-04-08 Robert Krauthgamer , Nir Petruschka , Shay Sapir

We prove the boundedness on $L^p$, $1<p<\infty$, of operators on manifolds which arise by taking conditional expectation of transformations of stochastic integrals. These operators include various classical operators such as second order…

Probability · Mathematics 2011-09-28 Rodrigo Bañuelos , Fabrice Baudoin

This thesis presents a formalization of martingales in arbitrary Banach spaces using Isabelle/HOL. We begin by examining formalizations in prominent proof repositories and extend the definition of the conditional expectation operator from…

Logic in Computer Science · Computer Science 2023-11-13 Ata Keskin

In \cite{MR447956}, Muckenhoupt and Wheeden formulated a weighted weak $(p,p)$ inequality where the weight for the weak $L^p$ space is treated as a multiplier rather than a measure. They proved such inequalities for the Hardy-Littlewood…

Classical Analysis and ODEs · Mathematics 2024-10-08 Brandon Sweeting

We introduce an analogue of the theory of length spaces into the setting of Lorentzian geometry and causality theory. The r\^ole of the metric is taken over by the time separation function, in terms of which all basic notions are…

Differential Geometry · Mathematics 2019-11-07 Michael Kunzinger , Clemens Sämann

Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences. The aim is to be able to model the behaviour of systems without estimating…

Computational Engineering, Finance, and Science · Computer Science 2012-09-19 Thomas W. Kelsey , Lars Kotthoff , Christoffer A. Jefferson , Stephen A. Linton , Ian Miguel , Peter Nightingale , Ian P. Gent

Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller…

Quantum Physics · Physics 2023-03-24 Simon C. Marshall , Jordi Tura , Vedran Dunjko

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

Dynamical Systems · Mathematics 2021-09-20 Shilpak Banerjee , Philipp Kunde , Daren Wei

In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every $i\geq 0$, $\Ppoly$ has $i$th order scaled $\pthree$-strong dimension 0. We also show that $\Ppoly^\io$ has…

Computational Complexity · Computer Science 2008-02-29 Xiaoyang Gu

In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that permit run-lengths from a countably infinite set. For a…

Information Theory · Computer Science 2010-01-14 Georg Böcherer , Rudolf Mathar , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

Generalized counting constraint satisfaction problems include Holant problems with planarity restrictions; polynomial-time algorithms for such problems include matchgates and matchcircuits, which are based on Pfaffians. In particular, they…

Category Theory · Mathematics 2015-10-08 Jason Morton , Jacob Turner

This is an introduction to measure theory, integration and function spaces, with all the needed preliminaries included, and with some applications included as well. We first discuss some basic motivations, coming from discrete probability,…

Mathematical Physics · Physics 2025-06-19 Teo Banica

We investigated the asymptotics of high-rate constrained quantization errors for a compactly supported probability measure P on Euclidean spaces whose quantizers are confined to a closed set S. The key tool is the metric projection of K…

Metric Geometry · Mathematics 2025-05-19 Chenxing Qian

This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator). We first consider $\gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space…

Machine Learning · Computer Science 2025-03-18 Gen Li , Yuting Wei , Yuejie Chi , Yuxin Chen

Korn's inequalities show that the $L^2$-norm of $\nabla u$ can be controlled by the $L^2$-norm of $\mathrm{Sym}(\nabla u)$, which only has $d(d+1)/2$ components. In [J. Math. Pures Appl. 148 (2021), pp. 199-220] Chipot posed the question of…

Analysis of PDEs · Mathematics 2025-12-03 Gabriele Cassese