Results 11 to 20 of about 1,275,089 (180)
Uniform Bounds for Invariant Subspace Perturbations [PDF]
SIAM Journal on Matrix Analysis and Applications, 2020 29 pages, 3 figures; added new theorem for random E; corrected typos and improved clarity; mild revisions to the way the main results are stated, but no significant changes to the results ...
Anil Damle, Yuekai Sun
openaire +2 more sources
Renormalization approach to the superconducting Kondo model
SciPost Physics, 2022 An approach to bound states based on unitary transformations of Hamiltonians is presented. The method is applied to study the interaction between electrons in a BCS $s$-wave superconductor and a quantum spin.
Steffen Sykora, Tobias Meng
doaj +1 more source
Uniform Linear Bound in Chevalley's Lemma [PDF]
Canadian Journal of Mathematics, 2008 AbstractWe obtain a uniform linear bound for the Chevalley function at a point in the source of an analytic mapping that is regular in the sense of Gabrielov. There is a version of Chevalley’s lemma also along a fibre, or at a point of the image of a proper analytic mapping.
Adamus, Janusz +2 more
openaire +5 more sources
Optimal PAC Bounds without Uniform Convergence
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 In statistical learning theory, determining the sample complexity of realizable binary classification for VC classes was a long-standing open problem. The results of Simon and Hanneke established sharp upper bounds in this setting. However, the reliance of their argument on the uniform convergence principle limits its applicability to more general ...
Aden-Ali, Ishaq +3 more
openaire +2 more sources
Uniform bounds for strongly 𝐹-regular surfaces [PDF]
Transactions of the American Mathematical Society, 2015 We show that if ( X , B ) (X,B) is a two dimensional Kawamata log terminal pair defined over an algebraically closed field of characteristic p p , and p p is sufficiently large, depending only on the coefficients of B B , then (
Cascini, P, Gongyo, Y, Schwede, K
openaire +5 more sources
Uniform derandomization from pathetic lower bounds [PDF]
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012 The notion of probabilistic computation dates back at least to Turing, who also wrestled with the practical problems of how to implement probabilistic algorithms on machines with, at best, very limited access to randomness. A more recent line of research, known as derandomization, studies the extent to which randomness is superfluous.
Allender, Eric +3 more
openaire +2 more sources
Cheeger constants and $L^2$-Betti numbers [PDF]
, 2013 We prove the existence of positive lower bounds on the Cheeger constants of manifolds of the form $X/\Gamma$ where $X$ is a contractible Riemannian manifold and ...
Bowen, Lewis
core +1 more source
Quantitative Stability of Optimization Problems with Stochastic Constraints
Mathematics, 2023 In this paper, we consider optimization problems with stochastic constraints. We derive quantitative stability results for the optimal value function, the optimal solution set and the feasible solution set of optimization models in which the underlying ...
Wei Ouyang, Kui Mei
doaj +1 more source
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
A non-uniform bound on binomial approximation to the beta binomial cumulative distribution function [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2019 This paper uses Stein’s method and the characterization of beta binomial random variable to determine a non-uniform bound for the distance between the beta binomial cumulative distribution function with parameters n N, 0 and 0 and the ...
Kanint Teerapabolarn, Khunakorn Sae-Jeng
doaj +1 more source